c→jth: cost coefficients of the jth decision variable
ai,j: constraint coefficient for variable j in constraint i
bi→RHS: coefficient for constraint i
(Ak∣k={h,g}): matrix of size [mk×n]
Sensitivity reports
Decision variables
Reduced cost: the amount of objective function will change if variable bounds are tighten
Allowable increase/decrease: how much objective coefficient must change before optimal solution changes.
100% Rule
If there are simultaneous changes to objective coefficients, and ∑each coefficient(Allowable changeProposed change)≤100% then the optimal solution would not change.
Constraints
Final value: the value of constraints at the optimal solution
Shadow price: of a constraint is the marginal improvement of the objective function value if the RHS is increased by 1 unit.
Allowable increase/decrease: how much the constraint can change before the shadow prices changes.