← 2024 Paper 2
UPSC 2024 Maths Optional Paper 2 Q3c — Step-by-Step Solution
15 marks · Section A
Duality · Linear Programming · asked 4× in 13 yrs · Read the full method →
Question
Using duality, solve: Minimise z=4x1+3x2+x3 subject to x1+2x2+4x3≥12, 3x1+2x2+x3≥8, x1,x2,x3≥0.
Technique
Form the dual (a two-variable max LP); solve graphically; recover primal via complementary slackness.
Solution
Maximise w=12y1+8y2
subject to y1+3y2≤4, 2y1+2y2≤3, 4y1+y2≤1, y1,y2≥0.
Step 2 — Solve the dual graphically
The third constraint 4y1+y2≤1 is the most restrictive. Feasible vertices:
- (0,0): w=0.
- (1/4,0): w=3. (Check: 4(1/4)+0=1≤1 ✓; others satisfied ✓.)
- (0,1): w=8. (Check: 4(0)+1=1≤1 ✓; others satisfied ✓.)
- Intersection of 4y1+y2=1 with 2y1+2y2=3: gives y1=−1/6<0 — infeasible.
Maximum is w=8 at (y1,y2)=(0,1). By strong duality, zmin=8.
Step 3 — Recover primal via complementary slackness
At (y1,y2)=(0,1):
- Dual constraint 1: y1+3(1)=3<4 (slack) → x1=0.
- Dual constraint 2: 2(0)+2(1)=2<3 (slack) → x2=0.
- y2=1>0 → primal constraint 2 is binding: 3(0)+2(0)+x3=8⇒x3=8.
Check primal constraint 1: 0+0+4(8)=32≥12 ✓.
Optimal solution
x1=0,x2=0,x3=8,zmin=4(0)+3(0)+1(8)=8.
Answer
x1=0,x2=0,x3=8,zmin=8.