30.01.2015 Views

ILOG CPLEX C++ API 9.0 Reference Manual

ILOG CPLEX C++ API 9.0 Reference Manual

ILOG CPLEX C++ API 9.0 Reference Manual

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

IloCplex<br />

public IloCplex::BasisStatus getBasisStatus(const IloIntVar var)<br />

This method returns the basis status for the variable var.<br />

public IloCplex::BasisStatus getBasisStatus(const IloNumVar var)<br />

This method returns the basis status for the variable var.<br />

public void getBasisStatuses(IloCplex::BasisStatusArray cstat,<br />

const IloNumVarArray var,<br />

IloCplex::BasisStatusArray rstat,<br />

const IloConstraintArray con)<br />

This method puts the basis status of each variable in var into the corresponding element<br />

of the array cstat, and it puts the status of each row in con (an array of ranges or<br />

constraints) into the corresponding element of the array rstat. Arrays rstat and<br />

cstat are resized accordingly.<br />

public void getBasisStatuses(IloCplex::BasisStatusArray stat,<br />

const IloConstraintArray con)<br />

This method puts the basis status of each constraint in con into the corresponding<br />

element of the array stat. Array stat is resized accordingly.<br />

public void getBasisStatuses(IloCplex::BasisStatusArray stat,<br />

const IloNumVarArray var)<br />

This method puts the basis status of each variable in var into the corresponding element<br />

of the array stat. Array stat is resized accordingly.<br />

public IloNum getBestObjValue()<br />

This method returns a bound on the optimal solution value of the problem. When a<br />

model has been solved to optimality, this value matches the optimal solution value. If a<br />

MIP optimization is terminated before optimality has been proven, this value is<br />

computed for a minimization (maximization) problem as the minimum (maximum)<br />

objective function value of all remaining unexplored nodes.<br />

public void getBoundSA(IloNumArray lblower,<br />

IloNumArray lbupper,<br />

IloNumArray ublower,<br />

IloNumArray ubupper,<br />

const IloNumVarArray vars)<br />

For the given set of variables vars, bound sensitivity information is computed. When<br />

the method returns, the element lblower[j] and lbupper[j] will contain the<br />

lowest and highest value the lower bound of variable vars[j] can assume without<br />

affecting the optimality of the solution. Likewise, ublower[j] and ubupper[j]<br />

will contain the lowest and highest value the upper bound of variable vars[j] can<br />

assume without affecting the optimality of the solution. The arrays lblower,<br />

lbupper, ublower, and ubupper will be resized to the size of array vars. The<br />

value 0 (zero) can be passed for any of the return arrays if the information is not desired.<br />

<strong>ILOG</strong> <strong>CPLEX</strong> <strong>C++</strong> <strong>API</strong> <strong>9.0</strong> REFERENCE M ANUAL 59

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!