XSLP_FINDIV
|
Description
|
Option for running a heuristic to find a feasible initial point
|
||||||
|
Type
|
Integer
|
||||||
|
Values
|
|
||||||
|
Default value
|
-1
|
||||||
|
Notes
|
The procedure uses bound reduction (and, up to an extent, probing) to obtain a point in the initial bounding box that is feasible for the bound reduction techniques.
If an initial point is already specified and is found not to violate bound reduction, then the heuristic is not run and the given point is used as the initial solution. |
||||||
|
Affects routines
|
© 2001-2019 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.