The Cplex type exposes the following members.
Properties
| Name | Description | |
|---|---|---|
|
BestObjValue |
This method returns a bound on the optimal solution value of the active problem.
When a model has been solved to optimality, this value matches the optimal solution value.
If a MIP optimization is terminated before optimality has been proven, this value is computed for a
minimization (maximization) problem as the minimum (maximum) objective
function value of all remaining unexplored nodes.
|
|
|
CplexSubStatus |
Returns the status of the IloCplex algorithm.
|
|
|
Cutoff |
Returns the cutoff for the objective value
when nodes are being solved during
branch-and-cut search. This value is typically computed from the
objective value of an incumbent solution and the optimality gap.
In the case of a minimization problem, for example, if the objective
value of a node exceeds the cutoff value, the node can be pruned
without the need to solve the node to optimality.
|
|
|
Diverging |
This method returns the diverging variable or constraint, in a
case where the primal simplex algorithm has determined the problem to be
infeasible.
|
|
|
IncumbentNode |
Returns the node number where the current incumbent was found.
|
|
|
IsDualFeasible |
Returns true if a dual feasible solution is available. If
false is returned the solution may still be dual feasible,
but the algorithm has not determined the feasibility before it
terminated.
|
|
|
IsMIP |
Returns true if the active model is a MIP.
|
|
|
IsPrimalFeasible |
Returns true if a primal feasible solution is available for
the current node. If false is returned the solution may
still be primal feasible, but the algorithm has not determined the
feasibility before it terminated.
|
|
|
IsQC |
Returns true if the active model has quadratic
constraints. See the topic QCP in the IBM ILOG Cplex User's
Manual for more detail about the characteristics of such
constraints with respect to their concavity and positive
semi-definiteness (PSD).
|
|
|
IsQO |
Returns true if the active model has a quadratic objective
function.
|
|
|
Model | |
|
|
NbarrierIterations |
Returns the number of barrier iterations from the last solve.
|
|
|
NbinVars |
Returns the number of binary (or Boolean) variables in the matrix
representation of the active model.
Note that the result is not necessarily equal to the number of
Boolean variables in the active model, as some mapping of
modeling objects may require the introduction of added matrix columns.
|
|
|
Ncols |
Returns the number of columns in the matrix representation of the
active model. Note that the result may be greater than the number of
variables in the active model, since some modeling
objects may require more than one matrix column.
|
|
|
NcrossDExch |
Returns the number of dual exchange operations in the crossover of the
last solve.
|
|
|
NcrossDPush |
Returns the number of dual push operations in the crossover of the
last solve.
|
|
|
NcrossPExch |
Returns the number of primal exchange operations in the crossover of the
last solve.
|
|
|
NcrossPPush |
Returns the number of primal push operations in the crossover of the
last solve.
|
|
|
NdualSuperbasics |
Returns the number of dual superbasic variables in the basis.
|
|
|
Nindicators | |
|
|
NintVars |
Returns the number of integer variables in the matrix representation of
the active model.
Note that the result is not necessarily equal to the number of
integer variables in the active model, as some mapping of
modeling objects may require the introduction of added matrix columns.
|
|
|
Niterations |
Returns the number of iterations from the last solve.
|
|
|
NLCs | |
|
|
Nnodes |
Returns the number of branch-and-cut nodes explored in solving
the active model.
|
|
|
NnodesLeft |
Returns the number of unexplored nodes in the branch-and-cut tree.
|
|
|
NNZs |
Returns the number of nonzero elements in the matrix representation of the
active model.
|
|
|
NphaseOneIterations |
Returns the number of phase I simplex iterations from the last solve.
|
|
|
NprimalSuperbasics |
Returns the number of primal superbasic variables in the basis.
|
|
|
NQCs |
Returns the number of quadratic constraints in the active
model. Note that the result may be different from the number
of constraints in the active model, since linear constraints
are counted separately.
|
|
|
Nrows |
Returns the number of rows of the matrix representation of the active
model. Note that the result may be different than the number of
constraints in the active model, as some modeling
objects may require more than one matrix row and quadratic
constraints are not accounted for as rows.
|
|
|
NsemiContVars |
Returns the number of semi-continuous variables in the matrix
representation of the active model.
|
|
|
NsemiIntVars |
Returns the number of semi-integer variables in the matrix representation
of the active model.
|
|
|
NsiftingIterations |
Returns the number of sifting iterations from the last solve.
|
|
|
NsiftingPhaseOneIterations |
Returns the number of sifting phase I iterations from the last solve.
|
|
|
NSOS1 |
Returns the number of
 CopyC#SOS |
|
|
NSOS2 |
Returns the number of
CopyC#SOS |
|
|
NSOSs |
Returns the number of
CopyC#SOS |
|
|
NUCs | |
|
|
ObjValue |
Returns the objective value of the current solution.
|
|
|
SolnPoolMeanObjValue |
Computes the mean of the objective values of the solutions currently in the solution pool. |
|
|
SolnPoolNreplaced |
Accesses the number of solutions that have been replaced
according to the solution pool replacement strategy.
|
|
|
SolnPoolNsolns |
Accesses the number of solutions currently in the solution pool.
|
|
|
SubAlgorithm |
Returns the algorithm that was used to generate the solution
of the last branch-and-cut node solved during a MIP solve.
|
|
|
Version |
Returns a string that indicates the version of Cplex.
|
