XSLPnlpoptimize
XSLPnlpoptimize |
int XPRS_CC XSLPnlpoptimize(XSLPprob Prob, char *Flags);
|
Prob
|
The current SLP problem.
|
|
Flags
|
These have the same meaning as for
XPRSmaxim and
XPRSminim.
|
|
Determines the direction of optimization: +1 is for minimization, -1 is for maximization.
|
Integer
|
Bit map determining the SLP algorithm(s) used in the optimization.
|
|
|
Bit map determining the type of augmentation used to create the linearization.
|
|
|
Bit map determining the type of cascading (recalculation of SLP variable values) used during the SLP optimization.
|
|
|
Determines the amount of iteration logging information produced.
|
|
|
Bit map determining the type of nonlinear presolve used before the SLP optimization starts.
|
XSLPnlpoptimize is equivalent to XSLPmaxim (if XSLP_OBJSENSE = -1) or XSLPminim (if XSLP_OBJSENSE = +1).
If XSLPconstruct has not already been called, it will be called first, using the augmentation defined by the control variable XSLP_AUGMENTATION. If determining rows are provided, then cascading will be invoked in accordance with the setting of the control variable XSLP_CASCADE.
© 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.