indicates the solver status at termination. It can take one of the following values:

OK

procedure terminated normally

SYNTAX_ERROR

incorrect use of syntax

DATA_ERROR

inconsistent input data

OUT_OF_MEMORY

insufficient memory allocated to the procedure

IO_ERROR

problem in reading or writing of data

ERROR

status that cannot be classified into any of the preceding categories

indicates the solution status at termination. It can take one of the following values:

OPTIMAL

solution is optimal

CONDITIONAL_OPTIMAL

optimality of the solution cannot be proven

INFEASIBLE

problem is infeasible

UNBOUNDED

problem is unbounded

INFEASIBLE_OR_UNBOUNDED

problem is infeasible or unbounded

ITERATION_LIMIT_REACHED

maximum allowable iterations reached

TIME_LIMIT_REACHED

maximum time limit reached

FAILED

solver failed to converge, possibly due to numerical issues

NONCONVEX

quadratic matrix is nonconvex (minimization)

NONCONCAVE

quadratic matrix is nonconcave (maximization)

indicates the objective value obtained by the solver at termination.

indicates the (relative) infeasibility of the primal constraints at the optimal solution. See the section Interior Point Algorithm: Overview for details.

indicates the (relative) infeasibility of the dual constraints at the optimal solution. See the section Interior Point Algorithm: Overview for details.

indicates the (relative) violation of the optimal solution over the lower and upper bounds. See the section Interior Point Algorithm: Overview for details.

indicates the (relative) duality gap. See the section Interior Point Algorithm: Overview for details.

indicates the (absolute) complementarity at the optimal solution. See the section Interior Point Algorithm: Overview for details.

indicates the number of iterations required to solve the problem.

indicates the time for preprocessing (seconds).

indicates the time taken by the interior point algorithm to perform iterations for solving the problem (seconds).