Solution query methods and routines are used to access information about the results of applying an optimization method to a problem object. For MIP problem objects, you can access the values of variables and constraint slacks. Methods and routines are also available to retrieve other information about the optimization process, for example, the number of nodes used.
Note: Names of classes, methods, and symbolic constants in the .NET API correspond very closely to those in the Java API with these systematic exceptions:
Ilo
, whereas in .NET they do not.
addCols
,
whereas in the .NET API, the names of methods conventionally
begin with an uppercase (that is, capital) letter, for example,
AddCols
according to Microsoft practice.
Purpose |
Java API |
C++ API |
C API |
---|---|---|---|
Accesses MIP start information |
---- |
---- |
|
Accesses the MIP solution objective value |
IloCplex.getObjValue |
IloCplex::getObjValue IloCplex derives from IloAlgorithm and thus inherits its methods. |
|
Accesses a range of MIP variable values |
IloCplex.getValues |
IloCplex::getValues |
|
Accesses slack values for MIP problem |
IloCplex.getSlacks |
IloCplex::getSlacks |
|
Accesses the number of simplex iterations used to solve the MIP |
IloCplex.getNiterations |
IloCplex::getNiterations |
|
Accesses the number of nodes used to solve the MIP |
IloCplex.getNnodes |
IloCplex::getNnodes |
|
Accesses objective value of best remaining node |
IloCplex.getBestObjValue |
IloCplex::getBestObjValue |
|
Accesses number of unexplored remaining nodes |
IloCplex.getNnodesLeft |
IloCplex::getNnodesLeft |
|
Accesses the node number of the integer solution |
IloCplex.getIncumbentNode |
IloCplex::getIncumbentNode |
|
Accesses the cutoff being used |
IloCplex.getCutoff |
IloCplex::getCutoff |
|
Accesses algorithmic status of last subproblem optimization |
IloCplex.getCplexSubStatus |
IloCplex::getCplexSubStatus |
|
Accesses solution method of last subproblem optimization |
IloCplex.getSubAlgorithm |
IloCplex::getSubAlgorithm |