CPLEX cpxRetVec: Difference between revisions
From TomWiki
Jump to navigationJump to search
Line 26: | Line 26: | ||
|1||Solution objective value | |1||Solution objective value | ||
|- | |- | ||
|2||(MIP) The currently best known bound on the optimal solution value of a MIP | |2||(MIP) The currently best known bound on the optimal solution value of a MIP problem. When a problem has been solved to optimality, this value matches the optimal solution value. Otherwise, this value is computed for a minimization (maximization) problem as the minimum (maximum) objective function value of all remaining unexplored nodes. | ||
|- | |- | ||
|3||(MIP) The MIP cutoff value being used during mixed integer optimization. The cutoff is updated with the objective function value, each time an integer solution is found during branch and cut. | |3||(MIP) The MIP cutoff value being used during mixed integer optimization. The cutoff is updated with the objective function value, each time an integer solution is found during branch and cut. | ||
Line 96: | Line 96: | ||
|38||(S,B) The sum of the absolute values of the dual residual vector for the scaled problem. | |38||(S,B) The sum of the absolute values of the dual residual vector for the scaled problem. | ||
|- | |- | ||
|39||(B) The maximum violation of the complementary slackness conditions for the | |39||(B) The maximum violation of the complementary slackness conditions for the unscaled problem. | ||
|- | |- | ||
|41||(B) The sum of the violations of the complementary slackness conditions for the unscaled problem. | |41||(B) The sum of the violations of the complementary slackness conditions for the unscaled problem. | ||
Line 104: | Line 104: | ||
|44||The maximum absolute value in the primal solution vector for the scaled problem. | |44||The maximum absolute value in the primal solution vector for the scaled problem. | ||
|- | |- | ||
|45||(S,B) The maximum absolute value in the dual solution vector for the unscaled | |45||(S,B) The maximum absolute value in the dual solution vector for the unscaled problem. | ||
|- | |- | ||
|46||(S,B) The maximum absolute value in the dual solution vector for the scaled problem. | |46||(S,B) The maximum absolute value in the dual solution vector for the scaled problem. | ||
Line 154: | Line 154: | ||
|66||(S,B) the lowest index where the maximum dual infeasibility occurs for the scaled problem. | |66||(S,B) the lowest index where the maximum dual infeasibility occurs for the scaled problem. | ||
|- | |- | ||
|67||(MIP) The lowest index where the maximum integer infeasibility occurs for the | |67||(MIP) The lowest index where the maximum integer infeasibility occurs for the unscaled problem. | ||
|- | |- | ||
|68||(MIP) The lowest index where the maximum primal residual occurs for the unscaled problem. | |68||(MIP) The lowest index where the maximum primal residual occurs for the unscaled problem. |
Latest revision as of 14:46, 19 March 2020
This page is part of the CPLEX Manual. See CPLEX. |
Purpose
cpxRetVec is a global variable that CPLEX can write more detailed solution information to. For all fields, the default value is NaN and appears whenever the element in question is not available/not applicable for the problem type.
Note about integer and double quality values:
Some quality values are present in both the integer and double lists. This is because these quality identifiers have a meaning both as double and integer qualities. Example: The double interpretation is normally the largest (absolute) value of the variables, while the integer interpretation is the first index where that value occurs.
Calling Syntax
global cpxRetVec % Call cplex by tomRun or directly
CPLEX functions or parameter names in cpxRetVec
The following outputs are created: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Index | Result of CPLEX run. (S=Simplex, B=Barrier, MIP=Mixed-Integer)
Double-type quality values:
Integer-type quality values:
|