← 2015 Paper 2
UPSC 2015 Maths Optional Paper 2 Q4c — Step-by-Step Solution
20 marks · Section A
Simplex method (basic) · Linear Programming · asked 9× in 13 yrs · Read the full method →
Question
Solve the following LPP by the simplex method. Write its dual. Also, write the optimal solution of the dual from the optimal table of the given problem:
Maximize Z=2x1−4x2+5x3
subject to x1+4x2−2x3≤2, −x1+2x2+3x3≤1, x1,x2,x3≥0.
Technique
Standard simplex on the standard form (max with ≤, slack variables); iterate till all reduced costs ≥0; dual optimum = zj−cj row at slack-variable columns of optimal tableau (this is the standard “shadow price” reading).
Solution
Max Z=2x1−4x2+5x3+0⋅s1+0⋅s2
subject to
x1+4x2−2x3+s1=2,
−x1+2x2+3x3+s2=1,
x1,x2,x3,s1,s2≥0.
Step 2 — Initial simplex tableau
Basis: {s1,s2}.
| Basis | x1 | x2 | x3 | s1 | s2 | RHS |
|---|
| s1 | 1 | 4 | -2 | 1 | 0 | 2 |
| s2 | -1 | 2 | 3 | 0 | 1 | 1 |
| zj−cj | -2 | 4 | -5 | 0 | 0 | 0 |
(zj−cj for the negative-of-coefficient form: −cj initially. Most-negative is −5 for x3.)
Step 3 — Iteration 1: x3 enters
Ratio test on positive entries in x3 column:
- Row s1: −2 (negative; skip).
- Row s2: 3; ratio =1/3.
So s2 leaves; pivot on row s2, column x3.
New row s2 (becomes x3): divide by 3: (−1/3,2/3,1,0,1/3∣1/3).
New row s1: Rs1+2⋅Rx3 (to make −2 become 0):
- 1+2(−1/3)=1−2/3=1/3
- 4+2(2/3)=4+4/3=16/3
- −2+2(1)=0 ✓
- 1+2(0)=1
- 0+2(1/3)=2/3
- 2+2(1/3)=2+2/3=8/3.
New zj−cj row: subtract −5× new pivot row from old zj−cj:
Actually let me redo. Standard: (zj−cj) becomes (zj−cj)+5⋅ (pivot row). The pivot was at the x3 column with zj−cj=−5. So:
New zj−cj:
- x1: −2+(−5)(−1/3)⋅(−1)=−2−5/3. Wait let me think more carefully.
Standard simplex update for zj−cj: new=old−(old pivot col entry)⋅(new pivot row).
Old (zj−cj) row: (−2,4,−5,0,0∣0). Pivot column was x3 with old value −5.
New (zj−cj)=old−(−5)⋅(new pivot row)=old+5⋅(new pivot row):
- x1: −2+5(−1/3)=−2−5/3=−11/3.
- x2: 4+5(2/3)=4+10/3=22/3.
- x3: −5+5(1)=0.
- s1: 0+5(0)=0.
- s2: 0+5(1/3)=5/3.
- RHS: 0+5(1/3)=5/3.
Tableau:
| Basis | x1 | x2 | x3 | s1 | s2 | RHS |
|---|
| s1 | 1/3 | 16/3 | 0 | 1 | 2/3 | 8/3 |
| x3 | -1/3 | 2/3 | 1 | 0 | 1/3 | 1/3 |
| zj−cj | -11/3 | 22/3 | 0 | 0 | 5/3 | 5/3 |
Most-negative: −11/3 at x1. x1 enters.
Step 4 — Iteration 2: x1 enters
Ratio test on positive entries in x1 column:
- Row s1: 1/3; ratio =(8/3)/(1/3)=8.
- Row x3: −1/3 (negative; skip).
s1 leaves. Pivot on row s1, column x1.
New row s1 (becomes x1): divide by 1/3 = multiply by 3:
(1,16,0,3,2∣8).
New row x3: Rx3+(1/3)⋅Rx1:
- −1/3+(1/3)(1)=0 ✓
- 2/3+(1/3)(16)=2/3+16/3=18/3=6
- 1+0=1
- 0+(1/3)(3)=1
- 1/3+(1/3)(2)=1/3+2/3=1
- 1/3+(1/3)(8)=1/3+8/3=3.
New (zj−cj): old+(11/3)⋅Rx1 new:
- x1: −11/3+(11/3)(1)=0.
- x2: 22/3+(11/3)(16)=22/3+176/3=198/3=66.
- x3: 0+0=0.
- s1: 0+(11/3)(3)=11.
- s2: 5/3+(11/3)(2)=5/3+22/3=27/3=9.
- RHS: 5/3+(11/3)(8)=5/3+88/3=93/3=31.
Tableau:
| Basis | x1 | x2 | x3 | s1 | s2 | RHS |
|---|
| x1 | 1 | 16 | 0 | 3 | 2 | 8 |
| x3 | 0 | 6 | 1 | 1 | 1 | 3 |
| zj−cj | 0 | 66 | 0 | 11 | 9 | 31 |
All zj−cj≥0 ⇒ optimal.
Step 5 — Optimal solution
x1=8, x3=3, x2=0, s1=0, s2=0.
Zmax=2(8)−4(0)+5(3)=16+15=31. ✓
Answer
x1=8,x2=0,x3=3,Zmax=31.