SLPMISLPALGORITHM, XSLP_MISLPALGORITHM
|
Description
|
Selects the MISLP strategy used to combine SLP with the branch-and-bound search
|
||||||||
|
Type
|
Integer
|
||||||||
|
Topic area
|
|||||||||
|
Values
|
|
||||||||
|
Default value
|
-1
|
||||||||
|
Note
|
SLP-MIP-SLP is generally the fastest algorithm since it only requires two SLP- and one MILP-solve compared to number-of-nodes-many SLP solves for SLP-in-MIP and number-of-SLP-iterations-many MIP solves in MIP-in-SLP. On the other hand it usually produces worse local optima and has the highest likelihood of running into local infeasibility.
|
||||||||
|
Note
|
This control replaces bits 9 and 10 of
SLPMIPALGORITHM (
XPRS_SLPMIPWITHINSLP and
XPRS_SLPSLPTHENMIP), which are now deprecated. While
SLPMISLPALGORITHM is left at its default of
XPRS_SLPMISLPALGORITHM_AUTOMATIC, those bits continue to determine the MISLP strategy exactly as before; setting
SLPMISLPALGORITHM to any other value overrides them.
|
||||||||
|
Affects routines
|
|||||||||
|
See also
|
|||||||||
|
Category
|
Control
|
© 2001-2026 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.
