[Previous] [Next]

XSLPglobal

---

Purpose

Initiate the Xpress-SLP mixed integer SLP (MISLP) algorithm

Synopsis

int XPRS_CC XSLPglobal(XSLPprob Prob);

Argument

Prob	The current SLP problem.

Example

The following example optimizes the problem and then finds the integer solution.

XSLPmaxim(Prob,"");
XSLPglobal(Prob);

Further information

The current Xpress-SLP mixed integer problem will be maximized or minimized using the algorithm defined by the control variable XSLP_MIPALGORITHM.

It is recommended that XSLPminim or XSLPmaxim is used first to obtain a converged solution to the relaxed problem. If this is not done, ensure that XSLP_OBJSENSE is set appropriately.

See the chapter on "Mixed Integer Successive Linear Programming" for more information about the Xpress-SLP MISLP algorithms.

Related topics

XSLPmaxim, XSLPminim, XSLP_MIPALGORITHM, XSLP_OBJSENSE

[Previous] [Next] [Index]

---

If you have any comments or suggestions about these pages, please send mail to docs@dashoptimization.com.