← 2024 Paper 2
UPSC 2024 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 13 yrs · Read the full method →
Question
Use the two-phase method to solve:
Maximise z=x1+2x2subject to x1−x2≥3,2x1+x2≤10,x1,x2≥0.
Technique
Phase I removes the artificial variable introduced for the ≥ constraint; Phase II maximises the original objective.
Solution
Introduce surplus s1≥0, slack s2≥0, and artificial a1≥0:
x1−x2−s1+a1=3,2x1+x2+s2=10.
Phase I — Minimise w=a1
Initial BFS: a1=3,s2=10.
The Phase I objective in terms of non-basic variables: w=3−x1+x2+s1. Most negative coefficient: x1 enters. Ratio test: min(3/1,10/2)=3, so a1 leaves at x1=3.
New BFS: x1=3,s2=4. w=0; no artificial in basis. Phase I complete.
Phase II — Maximise z=x1+2x2
Current basis: {x1,s2}. Express z in terms of non-basics {x2,s1}:
x1=3+x2+s1,z=3+3x2+s1.
Coefficient of x2 is +3>0: x2 enters. From the s2 row: s2=4−3x2−2s1≥0⇒x2≤4/3. So x2=4/3, s2 leaves.
New BFS: x2=4/3, x1=3+4/3=13/3. Updated z=3+3(4/3)=7. All coefficients in z now negative. Optimal.
Optimal solution
x1=313,x2=34,zmax=7.
Answer
x1=313,x2=34,zmax=7.