Value
| Symbolic Constant
| Meaning
|
|---|
For Simplex, Barrier
|
1
|
CPX_OPTIMAL
|
Optimal solution found
|
2
|
CPX_INFEASIBLE
|
Problem infeasible
|
3
|
CPX_UNBOUNDED
|
Problem unbounded
|
4
|
CPX_OBJ_LIM
|
Objective limit exceeded in Phase II
|
5
|
CPX_IT_LIM_FEAS
|
Iteration limit exceeded in Phase II
|
6
|
CPX_IT_LIM_INFEAS
|
Iteration limit exceeded in Phase I
|
7
|
CPX_TIME_LIM_FEAS
|
Time limit exceeded in Phase II
|
8
|
CPX_TIME_LIM_INFEAS
|
Time limit exceeded in Phase I
|
9
|
CPX_NUM_BEST_FEAS
|
Problem non-optimal, singularities in Phase II
|
10
|
CPX_NUM_BEST_INFEAS
|
Problem non-optimal, singularities in Phase I
|
11
|
CPX_OPTIMAL_INFEAS
|
Optimal solution found, unscaled infeasibilities
|
12
|
CPX_ABORT_FEAS
|
Aborted in Phase II
|
13
|
CPX_ABORT_INFEAS
|
Aborted in Phase I
|
14
|
CPX_ABORT_DUAL_INFEAS
|
Aborted in barrier, dual infeasible
|
15
|
CPX_ABORT_PRIM_INFEAS
|
Aborted in barrier, primal infeasible
|
16
|
CPX_ABORT_PRIM_DUAL_INFEAS
|
Aborted in barrier, primal and dual infeasible
|
17
|
CPX_ABORT_PRIM_DUAL_FEAS
|
Aborted in barrier, primal and dual feasible
|
18
|
CPX_ABORT_CROSSOVER
|
Aborted in crossover
|
19
|
CPX_INForUNBD
|
Infeasible or unbounded
|
For Barrier Only
|
32
|
CPX_PRIM_INFEAS
|
Converged, dual feasible, primal infeasible
|
33
|
CPX_DUAL_INFEAS
|
Converged, primal feasible, dual infeasible
|
34
|
CPX_PRIM_DUAL_INFEAS
|
Converged, primal and dual infeasible
|
35
|
CPX_PRIM_OBJ_LIM
|
Primal objective limit reached
|
36
|
CPX_DUAL_OBJ_LIM
|
Dual objective limit reached
|
37
|
CPX_OPTIMAL_FACE_UNBOUNDED
|
Primal has unbounded optimal face
|
38
|
CPX_NUM_BEST_PRIM_DUAL_FEAS
|
Non-optimal solution found, primal-dual feasible
|
39
|
CPX_NUM_BEST_PRIM_INFEAS
|
Non-optimal solution found, primal infeasible
|
40
|
CPX_NUM_BEST_DUAL_INFEAS
|
Non-optimal solution found, dual infeasible
|
41
|
CPX_NUM_BEST_PRIM_DUAL_INFEAS
|
Non-optimal solution found, primal-dual infeasible
|
42
|
CPX_BARRIER_NUM_ERROR
|
Non-optimal solution found, numerical difficulties
|
43
|
CPX_BARRIER_INCONSISTENT
|
Barrier found inconsistent constraints
|
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_NODE_FILE_LIM_FEAS
|
Node file size limit, integer solution exists
|
119
|
CPXMIP_NODE_FILE_LIM_INFEAS
|
Node file size limit, no integer solution
|
