Solution Quality Values

CPX_MAX_PRIMAL_INFEAS 

 

IloCplex::MaxPrimalInfeas 

To access the maximum primal infeasibility or, equivalently, the maximum bound violation including slacks for the unscaled problem. 

To access the lowest index of a column or row where the maximum primal infeasibility occurs for the unscaled problem. An index (*quality_p) < 0 indicates that the maximum occurs at the slack variable for row (-i-1). 

CPX_MAX_SCALED_PRIMAL_INFEAS 

 

IloCplex::MaxScaledPrimalInfeas 

To access the maximum primal infeasibility or, equivalently, the maximum bound violation including slacks for the scaled problem. 

To access the lowest index of a column or row where the maximum primal infeasibility occurs for the scaled problem.  

CPX_SUM_PRIMAL_INFEAS 

 

IloCplex::SumPrimalInfeas 

To access the sum of primal infeasibilities or, equivalently, the sum of bound violations for the unscaled problem. 

 

CPX_SUM_SCALED_PRIMAL_INFEAS 

 

IloCplex::SumScaledPrimalInfeas 

To access the sum of primal infeasibilities or, equivalently, the sum of bound violations for the scaled problem. 

 

CPX_MAX_DUAL_INFEAS 

 

IloCplex::MaxDualInfeas 

To access the maximum of dual infeasibility or, equivalently, the maximum reduced-cost infeasibility for the unscaled problem. 

To access the lowest index where the maximum dual infeasibility occurs for the unscaled problem. 

CPX_MAX_SCALED_DUAL_INFEAS 

 

IloCplex::MaxScaledDualInfeas 

To access the maximum of dual infeasibility or, equivalently, the maximum reduced-cost infeasibility for the scaled problem. 

To access the lowest index where the maximum dual infeasibility occurs for the scaled problem. 

CPX_SUM_DUAL_INFEAS 

 

IloCplex::MumDualInfeas 

To access the sum of dual infeasibilities or, equivalently, the sum of reduced-cost bound violations for the unscaled problem. 

 

CPX_SUM_SCALED_DUAL_INFEAS 

 

IloCplex::SumScaledDualInfeas 

To access the sum of dual infeasibilities or, equivalently, the sum of reduced-cost bound violations for the scaled problem. 

 

CPX_MAX_INT_INFEAS 

 

IloCplex::MaxIntInfeas 

To access the maximum of integer infeasibility for the unscaled problem. 

To access the lowest index where the maximum integer infeasibility occurs for the unscaled problem. 

CPX_SUM_INT_INFEAS 

 

IloCplex::SumIntInfeas 

To access the sum of integer infeasibilities for the unscaled problem. 

 

CPX_MAX_PRIMAL_RESIDUAL 

 

IloCplex::MaxPrimalResidual 

To access the maximum of the vector |Ax-b| for the unscaled problem. 

To access the lowest index where the maximum primal residual occurs for the unscaled problem. 

CPX_MAX_SCALED_PRIMAL_RESIDUAL 

 

IloCplex::MaxScaledPrimalResidual 

To access the maximum of the vector |Ax-b| for the scaled problem. 

To access the lowest index where the maximum primal residual occurs for the scaled problem. 

CPX_SUM_PRIMAL_RESIDUAL 

 

IloCplex::MumPrimalResidual 

To access the sum of the elements of vector |Ax-b| for the unscaled problem. 

 

CPX_SUM_SCALED_PRIMAL_RESIDUAL 

 

IloCplex::SumScaledPrimalResidual 

To access the sum of the elements of vector |Ax-b| for the unscaled problem. 

 

CPX_MAX_DUAL_RESIDUAL 

 

IloCplex::MaxDualResidual 

To access maximum dual residual value. For a simplex solution this is the maximum of the vector |c-B'pi|, and for a Barrier solution it is the maximum of the vector |A'pi+rc-c| for the unscaled problem. 

To access the lowest index where the maximum dual residual occurs for the unscaled problem. 

CPX_MAX_SCALED_DUAL_RESIDUAL 

 

IloCplex::MaxScaledDualResidual 

To access maximum dual residual value for the scaled problem. 

To access the lowest index where the maximum dual residual occurs for the scaled problem. 

CPX_SUM_DUAL_RESIDUAL 

 

IloCplex::SumDualResidual 

To access the sum of the absolute values of the dual residual vector for the unscaled problem. 

 

CPX_SUM_SCALED_DUAL_RESIDUAL 

 

IloCplex::SumScaledDualResidual 

To access the sum of the absolute values of the dual residual vector for the scaled problem. 

 

CPX_MAX_COMP_SLACK 

 

IloCplex::MaxCompSlack 

To access the maximum violation of the complementary slackness conditions for the unscaled problem. This is available only for a Barrier solution. 

To access the lowest index of a row or column with the largest violation of the complementary slackness conditions. An index (*quality_p) < 0 denotes (the slack variable for) row (-i-1). This is available only for a Barrier solution. 

CPX_SUM_COMP_SLACK 

 

IloCplex::SumCompSlack 

To access the sum of the violations of the complementary slackness conditions for the unscaled problem. This is available only for a Barrier solution. 

 

CPX_MAX_X 

 

IloCplex::MaxX 

To access the maximum absolute value in the primal solution vector for the unscaled problem. 

To access the lowest index where the maximum x value occurs for the unscaled problem. 

CPX_MAX_SCALED_X 

 

IloCplex::MaxScaledX 

To access the maximum absolute value in the primal solution vector for the scaled problem. 

To access the lowest index where the maximum x value occurs for the scaled problem. 

CPX_MAX_PI 

 

IloCplex::MaxPi 

To access the maximum absolute value in the dual solution vector for the unscaled problem. 

To access the lowest index where the maximum pi value occurs for the unscaled problem. 

CPX_MAX_SCALED_PI 

 

IloCplex::MaxScaledPi 

To access the maximum absolute value in the dual solution vector for the scaled problem. 

To access the lowest index where the maximum pi value occurs for the scaled problem. 

CPX_MAX_SLACK 

 

IloCplex::MaxSlack 

To access the maximum absolute slack value for the unscaled problem. 

To access the lowest index where the maximum slack value occurs for the unscaled problem. 

CPX_MAX_SCALED_SLACK 

 

IloCplex::MaxScaledSlack 

To access the maximum absolute slack value for the scaled problem. 

To access the lowest index where the maximum slack value occurs for the scaled problem. 

CPX_MAX_RED_COST 

 

IloCplex::MaxRedCost 

To access the maximum absolute reduced cost value for the unscaled problem. 

To access the lowest index where the maximum reduced cost value occurs for the unscaled problem. 

CPX_MAX_SCALED_RED_COST 

 

IloCplex::MaxScaledRedCost 

To access the maximum absolute reduced cost value for the scaled problem. 

To access the lowest index where the maximum reduced cost value occurs for the scaled problem. 

CPX_SUM_X 

 

SumXIloCplex:: 

To access the sum of the absolute values in the primal solution vector for the unscaled problem. 

 

CPX_SUM_SCALED_X 

 

IloCplex::SumScaledX 

To access the sum of the absolute values in the primal solution vector for the scaled problem. 

 

CPX_SUM_PI 

 

IloCplex::SumPi 

To access the sum of the absolute values in the dual solution vector for the unscaled problem. 

 

CPX_SUM_SCALED_PI 

 

IloCplex::SumScaledPi 

To access the sum of the absolute values in the dual solution vector for the scaled problem. 

 

CPX_SUM_SLACK 

 

IloCplex::SumSlack 

To access the sum of the absolute slack values for the unscaled problem. 

 

CPX_SUM_SCALED_SLACK 

 

IloCplex::SumScaledSlack 

To access the sum of the absolute slack values for the scaled problem. 

 

CPX_SUM_RED_COST 

 

IloCplex::SumRedCost 

To access the sum of the absolute reduced cost values for the unscaled problem. 

 

CPX_SUM_SCALED_RED_COST 

 

IloCplex::SumScaledRedCost 

To access the sum of the absolute reduced cost values for the unscaled problem. 

 

CPX_KAPPA 

 

IloCplex::Kappa 

To access the condition number of the scaled basis matrix. This is available only for a simplex solution. 

 

CPX_OBJ_GAP 

 

IloCplex::Objgap 

To access the objective value gap between the primal and dual objective value solution. This is available only for a Barrier solution. 

 

CPX_DUAL_OBJ 

 

IloCplex::Dualobj 

To access the objective value relative to the dual Barrier solution. This is available only for a Barrier solution. 

 

CPX_PRIMAL_OBJ 

 

IloCplex::Primalobj 

To access the objective value relative to the primal Barrier solution. This is available only for a Barrier solution.