ILOG CPLEX C++ API 9.0 Reference Manual
ILOG CPLEX C++ API 9.0 Reference Manual
ILOG CPLEX C++ API 9.0 Reference Manual
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
IloCplex::GoalI<br />
public IloNum getBestObjValue()<br />
This method returns the currently best known bound on the optimal solution value of the<br />
problem at the time the invoking goal is executed by an instance of IloCplex while<br />
solving a MIP. When a model has been solved to optimality, this value matches the<br />
optimal solution value. Otherwise, this value is computed for a minimization<br />
(maximization) problem as the minimum (maximum) objective function value of all<br />
remaining unexplored nodes.<br />
public IloNum getBranch(IloNumVarArray vars,<br />
IloNumArray bounds,<br />
IloCplex::BranchDirectionArray dirs,<br />
IloInt i)<br />
This method accesses branching information for the i-th branch that the invoking<br />
instance of IloCplex is about to create. The parameter i must be between 0 (zero)<br />
and getNbranches - 1; that is, it must be a valid index of a branch; normally, it<br />
will be zero or one.<br />
A branch is normally defined by a set of variables and the bounds for these variables.<br />
Branches that are more complex cannot be queried. The return value is the node estimate<br />
for that branch.<br />
◆<br />
◆<br />
The parameter vars contains the variables for which new bounds will be set in the<br />
i-th branch.<br />
The parameter bounds contains the new bounds for the variables listed in vars;<br />
that is, bounds[j] is the new bound for vars[j].<br />
◆ The parameter dirs indicates the branching direction for the variables in vars.<br />
dir[j] == IloCplex::BranchUp<br />
means that bounds[j] specifies a lower bound for vars[j].<br />
dirs[j] == IloCplex::BranchDown<br />
means that bounds[j] specifies an upper bound for vars[j].<br />
public GoalI::BranchType getBranchType()<br />
This method returns the type of branching IloCplex is going to do for the current<br />
node.<br />
public IloNum getCutoff()<br />
The method returns the current cutoff value. An instance of IloCplex uses the cutoff<br />
value (the value of the objective function of the subproblem at a node in the search tree)<br />
to decide when to prune nodes from the search tree (that is, when to cut off that node<br />
and discard the nodes beyond it). The cutoff value is updated whenever a new incumbent<br />
is found.<br />
public IloCplex::BranchDirection getDirection(const IloIntVar var)<br />
<strong>ILOG</strong> <strong>CPLEX</strong> <strong>C++</strong> <strong>API</strong> <strong>9.0</strong> REFERENCE M ANUAL 139