The properties of the Cplex class are listed below. For a complete list of Cplex class members, see the Cplex Members topic.
![]() | Gets a bound on the optimal solution value of the active problem in a MIP. When a model has been solved to optimality, this value matches the optimal solution value within the current MIP gap tolerance. 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. |
![]() | Gets 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. |
![]() | Gets the node number where the current incumbent was found. |
![]() | |
![]() | Gets the number of barrier iterations from the last solve. |
![]() | Gets 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. |
![]() | Deprecated, no replacement. |
![]() | Gets 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. |
![]() | Deprecated, no replacement. |
![]() | Gets the number of dual exchange operations in the crossover of the last solve. |
![]() | Gets the number of dual push operations in the crossover of the last solve. |
![]() | Gets the number of primal exchange operations in the crossover of the last solve. |
![]() | Gets the number of primal push operations in the crossover of the last solve. |
![]() | Gets the number of dual superbasic variables in the basis. |
![]() | Gets 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. |
![]() | Gets the number of iterations from the last solve. |
![]() | Gets the number of branch-and-cut nodes explored in solving the active model. |
![]() | Gets the number of unexplored nodes in the branch-and-cut tree. |
![]() | Gets the number of nonzero elements in the matrix representation of the active model. |
![]() | Gets the number of phase I iterations from the last solve. |
![]() | Gets the number of primal superbasic variables in the basis. |
![]() | Gets 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. |
![]() | Gets the number of rows in the matrix representation of the active model. Note that the result may be different from the number of constraints in the active model, since some modeling objects may require more than one matrix row and quadratic constraints are not accounted for as rows. |
![]() | Gets the number of semi-continuous variables in the matrix representation of the active model. |
![]() | Gets the number of semi-integer variables in the matrix representation of the active model. |
![]() | Gets the number of sifting iterations from the last solve. |
![]() | Gets the number of sifting phase I iterations from the last solve. |
![]() | Gets the number of SOS s of type 1 in the active model. |
![]() | Gets the number of SOS s of type 2 in the active model. |
![]() | Gets the number of SOS s of both types, 1 and 2 in the active model. |
![]() | Gets the objective value of the current solution. |
![]() | Gets a linear expression representing an unbounded direction for the active model if it has been proven unbounded by one of the simplex methods. If a*x + b*y is the returned by this method, it represents an unbounded direction vector with an x coordinate of a and y coordinate of b . |
![]() | Gets the type of the algorithm that was used to generate the solution of the last branch-and-cut node solved during a MIP solve terminated because of an error during mixed integer optimization. |
![]() | Gets a string that indicates the version of CPLEX. |