21 |
The maximum primal infeasibility or, equivalently, the maximum bound violation including slacks for the unscaled problem.
|
22 |
The maximum primal infeasibility or, equivalently, the maximum bound violation including slacks for the scaled problem.
|
23 |
The sum of primal infeasibilities or, equivalently, the sum of bound violations for the unscaled problem.
|
24 |
The sum of primal infeasibilities or, equivalently, the sum of bound violations for the scaled problem.
|
25 |
(S,B) The maximum of dual infeasibility or, equivalently, the maximum reduced-cost infeasibility for the unscaled problem.
|
26 |
(S,B) The maximum of dual infeasibility or, equivalently, the maximum reduced-cost infeasibility for the scaled problem.
|
27 |
(S,B) The sum of dual infeasibilities or, equivalently, the sum of reduced-cost bound violations for the unscaled problem .
|
28 |
(S,B) The sum of dual infeasibilities or, equivalently, the sum of reduced-cost bound violations for the scaled problem .
|
29 |
(MIP) The maximum of integer infeasibility for the unscaled problem.
|
30 |
(MIP) The sum of integer infeasibilities for the unscaled problem.
|
31 |
Ax - b\| for the unscaled problem.
|
32 |
Ax - b\| for the scaled problem.
|
33 |
Ax - b\| for the unscaled problem.
|
34 |
Ax - b\| for the unscaled problem.
|
35 |
(S,B) The 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.
|
36 |
(S,B) The maximum dual residual value for the scaled problem.
|
37 |
(S,B) The sum of the absolute values of the dual residual vector for the unscaled 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 un- scaled problem.
|
41 |
(B) The sum of the violations of the complementary slackness conditions for the unscaled problem.
|
43 |
The maximum absolute value in the primal solution vector for the unscaled 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 prob- lem.
|
46 |
(S,B) The maximum absolute value in the dual solution vector for the scaled problem.
|
47 |
The maximum absolute slack value for the unscaled problem.
|
48 |
The maximum absolute slack value for the scaled problem.
|
49 |
(S,B) The maximum absolute reduced cost value for the unscaled problem.
|
50 |
(S,B) The maximum absolute reduced cost value for the scaled problem.
|
51 |
The sum of the absolute values in the primal solution vector for the unscaled problem.
|
52 |
The sum of the absolute values in the primal solution vector for the scaled problem.
|
53 |
(S,B) The sum of the absolute values in the dual solution vector for the unscaled problem.
|
54 |
(S,B) The sum of the absolute values in the dual solution vector for the scaled problem.
|
55 |
The sum of the absolute slack values for the unscaled problem.
|
56 |
The sum of the absolute slack values for the scaled problem.
|
57 |
(S,B) The sum of the absolute reduced cost values for the unscaled problem.
|
58 |
(S,B) The sum of the absolute reduced cost values for the unscaled problem.
|
59 |
(S) The estimated condition number of the scaled basis matrix.
|
60 |
(B) The objective value gap between the primal and dual objective value solution.
|
61 |
(B) The objective value relative to the dual barrier solution.
|
62 |
(B) The objective value relative to the primal barrier solution.
|
81 |
(MIP) The relative objective gap for a MIP optimization.
|