Assignment 3 β€” Sensitivity Analysis

Four QM for Windows ranging reports read line by line: binding constraints, shadow prices, reduced costs, the range of optimality, and the effect of changing a right-hand side β€” plus the standard form of each LPP.

PROBLEMS: 4 UNIT: UNIT 01 β€” SENSITIVITY Original: Assignment 3
β—† The method for every problem on this page
  1. Binding or not? Slack/surplus = 0 ⟹ binding (fully used). Slack > 0 ⟹ unused by exactly that amount; its dual value is 0.
  2. RHS change? Check the new RHS against that constraint's lower/upper bound. Inside ⟹ the same basis; Ξ”Z = dual value Γ— Ξ”RHS. Outside ⟹ the basis changes and the problem must be re-solved.
  3. Objective coefficient change? Check the new coefficient against that variable's bounds. Inside ⟹ the same optimal quantities; Z changes by Ξ”c Γ— (variable's value). Outside ⟹ re-solve.
  4. Reduced cost of a variable at 0 = how much its coefficient must improve before it becomes worth producing; equivalently, the amount Z worsens per unit if you force it in.

Every interpretation, with the class example: Unit 1 Β· Sensitivity Analysis.

β˜… Tricks that save time in the exam
  • Four-part answer template: rule β†’ number from the table β†’ arithmetic β†’ one-line business meaning. Every sub-question, every time.
  • "Solution doesn't change" β‰  "Z doesn't change". A coefficient moved inside its range keeps the quantities but changes Z β€” always recompute Z.
  • Min problems: QM shows the dual value of a β‰₯ constraint as negative (e.g. βˆ’2.5). Read it as "each extra unit required raises the cost by 2.5".
  • Standard form (asked for Q2–Q4) = add a slack to every ≀ and subtract a surplus from every β‰₯, so every constraint becomes an equation; for the simplex, also add an artificial variable to every β‰₯.

Q1 β€” Reading the full report (Max Z = 7X₁ + 5Xβ‚‚ + 6X₃)

Question

The QM for Windows ranging output for Max Z = 7X₁ + 5Xβ‚‚ + 6X₃ (the constraints are those of Assignment 2 Q2: 3X₁ + 2Xβ‚‚ ≀ 12, X₁ + 3X₃ ≀ 9, 2Xβ‚‚ + X₃ ≀ 8, X₁ + Xβ‚‚ + 2X₃ ≀ 10, 2X₁ + Xβ‚‚ + X₃ ≀ 11):

VariableValueReduced costOriginal valueLower boundUpper bound
X₁2.1071.179.5
Xβ‚‚2.85053.3316.67
X₃2.3060.1723.5
ConstraintDual valueSlack / surplusOriginal valueLower boundUpper bound
Constraint 11.75012515
Constraint 21.75091.339.82
Constraint 30.75081.679.29
Constraint 400.45 (printed "45")109.55Infinity
Constraint 501.65119.35Infinity

(1) Are all constraints exhausted? If not, which are unused and by how much? (2) What do the upper and lower bounds in the variable table mean? (3) Economic interpretation of the dual value / shadow price, with an example.

Assignment 3 p. 1

Solution
  1. (1) Not all constraints are exhausted
    ConstraintSlackStatus
    1, 2, 30Binding β€” fully used; dual values 1.75, 1.75, 0.75
    40.45Unused by 0.45: X₁ + Xβ‚‚ + 2X₃ = 2.1 + 2.85 + 4.6 = 9.55 of 10
    51.65Unused by 1.65: 2(2.1) + 2.85 + 2.3 = 9.35 of 11

    The report prints Constraint 4's slack as "45" β€” the column is too narrow for the leading point. It is 0.45, which matches its lower bound of 9.55 (= 10 βˆ’ 0.45).

  2. (2) The variable bounds are the range of optimality

    They are the range over which each objective coefficient can move without changing the optimal quantities. Example: X₁'s profit of 7 may lie anywhere from 1.17 to 9.5 and the best plan stays X₁ = 2.1, Xβ‚‚ = 2.85, X₃ = 2.3 β€” only Z changes. Push it outside the range and a different corner becomes optimal, so the problem must be re-solved.

  3. (3) Shadow price

    The shadow price is the increase in Z from one more unit of a constraint's resource, valid while the RHS stays inside its range. Constraint 1's 1.75 means a 13th unit of resource 1 adds 1.75 to profit: raising it from 12 to 14 gives Z = 42.75 + 2 Γ— 1.75 = 46.25 (14 lies inside 5–15). It is also the most the firm should pay for an extra unit. Constraints 4 and 5 have shadow price 0 β€” they already have spare capacity, so more of them is worth nothing.


Q2 β€” Min Z = 5X₁ + 4Xβ‚‚ + 6X₃

Question
Min Z = 5X₁ + 4Xβ‚‚ + 6X₃ C1: X₁ + Xβ‚‚ + X₃ ≀ 10 C2: 2X₁ + Xβ‚‚ β‰₯ 14 C3: X₁ + 2Xβ‚‚ + X₃ ≀ 8 X₁, Xβ‚‚, X₃ β‰₯ 0
VariableValueReduced costOriginal valueLower boundUpper bound
X₁70508
Xβ‚‚01.542.5Infinity
X₃0660Infinity
ConstraintDual valueSlack / surplusOriginal valueLower boundUpper bound
Constraint 103107Infinity
Constraint 2βˆ’2.5014016
Constraint 30187Infinity

Convert to standard form, and answer: (1) which constraints are unutilised and how much is consumed; (2) the meaning of X₃'s reduced cost of 6; (3) does raising X₃'s cost from 6 to 9 change the optimum; (4) does reducing C2 from 14 to 8 change it?

Assignment 3 p. 1

Solution
  1. Standard form Min Z = 5X₁ + 4Xβ‚‚ + 6X₃ + 0S₁ + 0Sβ‚‚ + 0S₃ X₁ + Xβ‚‚ + X₃ + S₁ = 10 2X₁ + Xβ‚‚ βˆ’ Sβ‚‚ = 14 X₁ + 2Xβ‚‚ + X₃ + S₃ = 8 X₁, Xβ‚‚, X₃, S₁, Sβ‚‚, S₃ β‰₯ 0

    (For the simplex table add an artificial Aβ‚‚ to C2 with cost +M.) The optimum is X₁ = 7, Xβ‚‚ = X₃ = 0, Z = 35.

  2. (1) Unutilised constraints C1: uses 7 of 10 ⟹ 3 units unused (slack 3) C3: uses 7 of 8 ⟹ 1 unit unused (slack 1) C2: 2(7) = 14, exactly the requirement ⟹ binding
  3. (2) Reduced cost of 6 on X₃

    X₃ is not used. Forcing one unit of X₃ into the solution would raise the cost by 6; put the other way, X₃'s cost would have to fall by 6 (from 6 to 0) before it would be worth using.

  4. (3) Cost of X₃ from 6 to 9 X₃'s range of optimality: 0 to Infinity; 9 lies inside ⟹ No change: X₃ stays at 0 and Z stays 35

    Making an unused input dearer can only make it less attractive.

  5. (4) C2 from 14 to 8 C2's RHS range: 0 to 16; 8 lies inside ⟹ the same basis (only X₁ is used) But the values change: 2X₁ = 8 ⟹ X₁ = 4 Ξ”Z = dual Γ— Ξ”RHS = 2.5 Γ— (βˆ’6) = βˆ’15 ⟹ Z = 35 βˆ’ 15 = 20

    So the basis does not change but the optimal quantity and cost do β€” say both.


Q3 β€” Max Z = 5X₁ + 5Xβ‚‚ + 3X₃

Question
Max Z = 5X₁ + 5Xβ‚‚ + 3X₃ C1: 2X₁ + 2Xβ‚‚ ≀ 12 C2: X₁ + Xβ‚‚ + X₃ ≀ 10 C3: 3X₁ + Xβ‚‚ ≀ 15 (printed "X₁ + Xβ‚‚ ≀ 15" β€” see note) C4: X₁ + 3Xβ‚‚ ≀ 15 C5: X₃ ≀ 6
VariableValueReduced costOriginal valueLower boundUpper bound
X₁4.50559
Xβ‚‚1.5053.675
X₃40305
ConstraintDual valueSlack / surplusOriginal valueLower boundUpper bound
Constraint 110121015
Constraint 23010612
Constraint 30015918
Constraint 406159Infinity
Constraint 50264Infinity

Standard form, then: (1) impact of raising C4 from 15 to 25; (2) economic implication of raising C2 from 10 to 12; (3) does the solution change if C1 falls from 12 to 9; (4) if X₁'s profit rises from 5 to 8, must the problem be re-solved, and what happens to Z?

Assignment 3 p. 1 β€” continues on p. 2

Solution
  1. Note on C3

    The handout prints C3 as X₁ + Xβ‚‚ ≀ 15, but the report only fits 3X₁ + Xβ‚‚ ≀ 15 (the Assignment 2 Q5 constraint): 3(4.5) + 1.5 = 15 gives slack 0, as printed, whereas X₁ + Xβ‚‚ = 6 would leave slack 9. Answer from the report. The solution is X₁ = 4.5, Xβ‚‚ = 1.5, X₃ = 4, Z = 42 β€” and it is one of several optima (Assignment 2 Q5).

  2. Standard form Max Z = 5X₁ + 5Xβ‚‚ + 3X₃ + 0S₁ + … + 0Sβ‚… 2X₁ + 2Xβ‚‚ + S₁ = 12 X₁ + Xβ‚‚ + X₃ + Sβ‚‚ = 10 3X₁ + Xβ‚‚ + S₃ = 15 X₁ + 3Xβ‚‚ + Sβ‚„ = 15 X₃ + Sβ‚… = 6 all variables β‰₯ 0
  3. (1) C4 from 15 to 25 C4 is non-binding: slack 6, dual value 0, range 9 to Infinity ⟹ No impact on the solution or on Z; the slack simply grows to 16
  4. (2) C2 from 10 to 12 Dual value 3; range 6 to 12 β€” 12 is still inside (at the limit) Ξ”Z = 3 Γ— 2 = +6 ⟹ Z = 48

    Each extra unit of resource 2 is worth 3 in profit, so the firm should pay at most 3 per unit for more of it. Beyond 12 the shadow price no longer holds.

  5. (3) C1 from 12 to 9 C1's range is 10 to 15; 9 is BELOW the lower bound ⟹ The current basis is no longer optimal β€” the problem must be re-solved

    Re-solving gives X₁ = 4.5, Xβ‚‚ = 0, X₃ = 5.5, Z = 39: Xβ‚‚ drops out of the solution, which is exactly the basis change the range warned about.

  6. (4) X₁'s profit from 5 to 8 X₁'s range of optimality is 5 to 9; 8 lies inside ⟹ No need to re-solve: X₁ = 4.5, Xβ‚‚ = 1.5, X₃ = 4 stay optimal Ξ”Z = 3 Γ— 4.5 = 13.5 ⟹ Z = 42 + 13.5 = 55.5

Q4 β€” Min Z = 5X₁ + 5Xβ‚‚ + 3X₃ β€” binding constraints

Question
Min Z = 5X₁ + 5Xβ‚‚ + 3X₃ C1: X₁ + Xβ‚‚ β‰₯ 10 C2: X₁ β‰₯ 2 C3: Xβ‚‚ β‰₯ 3 C4: X₃ β‰₯ 4 C5: 2X₁ + Xβ‚‚ β‰₯ 12
VariableValueReduced costOriginal valueLower boundUpper bound
X₁205510
Xβ‚‚8052.55
X₃4030Infinity
ConstraintDual valueSlack / surplusOriginal valueLower boundUpper bound
Constraint 1βˆ’50107.510
Constraint 2002βˆ’Infinity2
Constraint 3053βˆ’Infinity8
Constraint 4βˆ’3040Infinity
Constraint 500121217

Standard form, then: (1) which constraints are binding; (2) is C5 fully utilised; (3) how much of C3 is utilised; (4) the final answer and Z.

Assignment 3 p. 2

Solution
  1. Standard form Min Z = 5X₁ + 5Xβ‚‚ + 3X₃ + 0S₁ + … + 0Sβ‚… X₁ + Xβ‚‚ βˆ’ S₁ = 10 X₁ βˆ’ Sβ‚‚ = 2 Xβ‚‚ βˆ’ S₃ = 3 X₃ βˆ’ Sβ‚„ = 4 2X₁ + Xβ‚‚ βˆ’ Sβ‚… = 12 all variables β‰₯ 0 (artificials A₁…Aβ‚… are added for the simplex)
  2. (1) Binding constraints C1: X₁ + Xβ‚‚ = 10 β€” surplus 0 (dual βˆ’5) C2: X₁ = 2 β€” surplus 0 C4: X₃ = 4 β€” surplus 0 (dual βˆ’3) C5: 2(2) + 8 = 12 β€” surplus 0 Binding: C1, C2, C4, C5. Non-binding: C3

    C2 and C5 are binding with a dual value of 0 β€” a sign of degeneracy (the same LP is Assignment 2 Q6).

  3. (2) C5

    Yes β€” 2X₁ + Xβ‚‚ = 2(2) + 8 = 12, exactly the requirement, surplus 0. But its dual value is 0, so tightening it slightly would not raise the cost.

  4. (3) C3 Xβ‚‚ = 8 against a requirement of at least 3 ⟹ exceeded by 5 (surplus 5)
  5. (4) Final answer X₁ = 2, Xβ‚‚ = 8, X₃ = 4, Min Z = 5(2) + 5(8) + 3(4) = 62

    Because 5X₁ + 5Xβ‚‚ is parallel to C1, any X₁ from 2 to 7 with Xβ‚‚ = 10 βˆ’ X₁ also gives 62.