Solution Status Codes


This table lists the statuses for solutions to LP, QP, or MIP problems. These values are returned by the routine CPXgetstat() or by the member functions IloCplex::getCplexStatus() and IloCplex::getCplexSubStatus(). If no solution exists, the return value is zero.

Note on Unboundedness

The treatment of models that are Unbounded involves a few subtleties. Specifically, a declaration of unboundedness means that CPLEX has determined that the model has an unbounded ray. Given any feasible solution x with objective z, a multiple of the unbounded ray can be added into x to give a feasible solution with objective z-1 (or z+1 for maximization models). Thus, if a feasible solution exists, then the optimal objective is unbounded. Note that CPLEX has not necessarily concluded that a feasible solution exists. Users can call function CPXsolninfo() to determine whether CPLEX has also concluded that the model has a feasible solution.

Value 
Callable Library Symbolic Constan
IloCplex::CplexStatus Enumeration Values 
Meaning 
For Simplex, Barrier 
CPX_STAT_OPTIMAL 
Optimal solution is available 
CPX_STAT_UNBOUNDED 
Model has an Unbounded ray 
CPX_STAT_INFEASIBLE 
Model is proved Infeasible 
CPX_STAT_INForUNBD 
Model is proved either Infeasible or Unbounded 
CPX_STAT_OPTIMAL_INFEAS 
Optimal solution is available, but with infeasibilities after unscaling 
CPX_STAT_NUM_BEST 
Solution is available, but not proved optimal, due to numerical difficulties during optimization 
10 
CPX_STAT_ABORT_IT_LIM 
Aborted due to an iteration limit 
11 
CPX_STAT_ABORT_TIME_LIM 
Aborted due to a time limit 
12 
CPX_STAT_ABORT_OBJ_LIM 
Aborted due to an objective limit 
13 
CPX_STAT_ABORT_USER 
Aborted on user request 
For Barrier Only 
20 
CPX_STAT_OPTIMAL_FACE_UNBOUNDED 
Model has Unbounded optimal face 
21 
CPX_STAT_ABORT_PRIM_OBJ_LIM 
Aborted due to a primal obj limit 
22 
CPX_STAT_ABORT_DUAL_OBJ_LIM 
Aborted due to a dual obj limit 
For MIP Only 
101 
CPXMIP_OPTIMAL 
Optimal integer solution found 
102 
CPXMIP_OPTIMAL_TOL 
Optimal sol. within epgap or epagap tolerance found 
103 
CPXMIP_INFEASIBLE 
Integer infeasible 
104 
CPXMIP_SOL_LIM 
Mixed integer solutions limit exceeded 
105 
CPXMIP_NODE_LIM_FEAS 
Node limit exceeded, integer solution exists 
106 
CPXMIP_NODE_LIM_INFEAS 
Node limit exceeded, no integer solution 
107 
CPXMIP_TIME_LIM_FEAS 
Time limit exceeded, integer solution exists 
108 
CPXMIP_TIME_LIM_INFEAS 
Time limit exceeded, no integer solution 
109 
CPXMIP_FAIL_FEAS 
Error termination, integer solution exists 
110 
CPXMIP_FAIL_INFEAS 
Error termination, no integer solution 
111 
CPXMIP_MEM_LIM_FEAS 
Treememory limit, integer solution exists 
112 
CPXMIP_MEM_LIM_INFEAS 
Treememory limit, no integer solution exists 
113 
CPXMIP_ABORT_FEAS 
Aborted, integer solution exists 
114 
CPXMIP_ABORT_INFEAS 
Aborted, no integer solution 
115 
CPXMIP_OPTIMAL_INFEAS 
Problem optimal with unscaled infeasibilities 
116 
CPXMIP_FAIL_FEAS_NO_TREE 
Out of memory, no tree, integer solution exists 
117 
CPXMIP_FAIL_INFEAS_NO_TREE 
Out of memory, no tree, no integer solution 
118 
CPXMIP_UNBOUNDED 
Model has an Unbounded ray 
119 
CPXMIP_INForUNBD 
Model is proved either Infeasible or Unbounded 


Previous Page: Parameter Table  Return to Top Next Page: Error Messages