← 2022 Paper 2

UPSC 2022 Maths Optional Paper 2 Q1e — Step-by-Step Solution

10 marks · Section A

Big-M / two-phase method (artificial variables) · Linear Programming · asked 5× in 14 yrs · Read the full method →

Question

Use two-phase method: Minimize Z=x1+x2Z=x_1+x_2 subject to 2x1+x2≥42x_1+x_2\ge 4, x1+7x2≥7x_1+7x_2\ge 7, x1,x2≥0x_1,x_2\ge 0.

Technique

Two-phase method: Phase 1 drives artificials to zero (minimize sum of artificials); Phase 2 minimizes the original objective with the remaining basis.

Solution

Setup. Two ≥\ge-constraints; need surplus variables and artificial variables.

Standard form:

Phase 1 — Minimize w=a1+a2w=a_1+a_2

Initial basis: a1,a2a_1,a_2. Initial values: a1=4,a2=7a_1=4,a_2=7, w=11w=11.

Basisx1x_1x2x_2s1s_1s2s_2a1a_1a2a_2RHS
a1a_121-10104
a2a_2170-1017

Reduced cost for Phase 1 (c=(0,0,0,0,1,1)c=(0,0,0,0,1,1)): cˉj=cj−cBTAj\bar c_j=c_j-c_B^T A_j.

For x1x_1: 0−(1)(2)−(1)(1)=−30-(1)(2)-(1)(1)=-3. For x2x_2: 0−(1)(1)−(1)(7)=−80-(1)(1)-(1)(7)=-8. For s1s_1: 0−(1)(−1)=10-(1)(-1)=1. For s2s_2: 0−(1)(−1)=10-(1)(-1)=1.

Most negative: −8-8 for x2x_2. x2x_2 enters.

Ratio test: a1:4/1=4a_1: 4/1=4, a2:7/7=1a_2: 7/7=1. Min at a2a_2 row. a2a_2 leaves.

Pivot on (a2,x2)(a_2, x_2):

New x2x_2 row: (1/7,1,0,−1/7,0,1/7,1)(1/7, 1, 0, -1/7, 0, 1/7, 1) (divide a2a_2 row by 7).

New a1a_1 row: a1−1⋅x2a_1-1\cdot x_2: (2−1/7,0,−1,1/7,1,−1/7,3)=(13/7,0,−1,1/7,1,−1/7,3)(2-1/7, 0, -1, 1/7, 1, -1/7, 3)=(13/7, 0, -1, 1/7, 1, -1/7, 3).

Updated reduced costs: cˉx1=0−(1)(13/7)−(0)(1/7)=−13/7\bar c_{x_1}=0-(1)(13/7)-(0)(1/7)=-13/7.

Most negative: −13/7-13/7 for x1x_1. x1x_1 enters.

Ratio test: a1:3/(13/7)=21/13a_1: 3/(13/7)=21/13, x2:1/(1/7)=7x_2: 1/(1/7)=7. Min at a1a_1. a1a_1 leaves.

Pivot on (a1,x1)(a_1, x_1):

New x1x_1 row: (1,0,−7/13,1/13,7/13,−1/13,21/13)(1, 0, -7/13, 1/13, 7/13, -1/13, 21/13).

New x2x_2 row: x2−1/7⋅x1x_2-1/7\cdot x_1: (0,1,−7/13⋅(−1/7)⋅…)(0, 1, -7/13\cdot(-1/7)\cdot\ldots) — let me redo carefully.

Old x2x_2 row: (1/7,1,0,−1/7,0,1/7,1)(1/7, 1, 0, -1/7, 0, 1/7, 1). Subtract (1/7)(1/7) times new x1x_1 row: (1/7−1/7,1−0,0−(1/7)(−7/13),−1/7−(1/7)(1/13),0−(1/7)(7/13),1/7−(1/7)(−1/13),1−(1/7)(21/13))(1/7-1/7, 1-0, 0-(1/7)(-7/13), -1/7-(1/7)(1/13), 0-(1/7)(7/13), 1/7-(1/7)(-1/13), 1-(1/7)(21/13)) =(0,1,1/13,−2/13,−1/13,2/13,1−3/13)=(0,1,1/13,−2/13,−1/13,2/13,10/13)=(0, 1, 1/13, -2/13, -1/13, 2/13, 1-3/13)=(0, 1, 1/13, -2/13, -1/13, 2/13, 10/13).

Wait, −1/7−(1/7)(1/13)=−1/7⋅(1+1/13)=−1/7⋅14/13=−2/13-1/7-(1/7)(1/13)=-1/7\cdot(1+1/13)=-1/7\cdot 14/13=-2/13 ✓.

All artificial variables a1,a2a_1,a_2 are now out of the basis. Phase 1 complete with w=0w=0.

Phase 1 solution: x1=21/13,x2=10/13,s1=s2=0,a1=a2=0x_1=21/13, x_2=10/13, s_1=s_2=0, a_1=a_2=0.

Phase 2 — Restore original objective

Drop artificial columns; minimize Z=x1+x2Z=x_1+x_2.

Basis: {x1,x2}\{x_1,x_2\}. Current values: x1=21/13,x2=10/13x_1=21/13,x_2=10/13. Z=31/13Z=31/13.

Tableau (drop a1,a2a_1,a_2 columns):

Basisx1x_1x2x_2s1s_1s2s_2RHS
x1x_110-7/131/1321/13
x2x_2011/13-2/1310/13

Reduced costs for ZZ: c=(1,1,0,0)c=(1,1,0,0). cB=(1,1)c_B=(1,1).

For s1s_1: 0−(1)(−7/13)−(1)(1/13)=7/13−1/13=6/13>00-(1)(-7/13)-(1)(1/13)=7/13-1/13=6/13>0. For s2s_2: 0−(1)(1/13)−(1)(−2/13)=−1/13+2/13=1/13>00-(1)(1/13)-(1)(-2/13)=-1/13+2/13=1/13>0.

All non-basic reduced costs are non-negative ⇒ current solution is optimal.

Answer

  x1=21/13,  x2=10/13,  Zmin⁡=31/13≈2.385.  \boxed{\;x_1=21/13,\;x_2=10/13,\;Z_{\min}=31/13\approx 2.385.\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 14 years, mapped. Get the take-away PDF free.