Pratidin
2026 · Statistics Optional Paper II · 15 marksMainsQuestion 3cii

Use the dual simplex method to solve the following Linear Programming Problem (LPP) :
Minimize Z = 2x₁ + x₂ + 3x₃
subject to
x₁ − 2x₂ + x₃ ≥ 4
2x₁ + x₂ + x₃ ≤ 8
x₁ − x₃ ≥ 0
and x₁ ≥ 0, x₂ ≥ 0, x₃ ≥ 0

15 marks · directive: Solve

Answer

The core of a good answer

Writing all constraints as ≤ with slacks gives a dual-feasible but primal-infeasible start (s₁ = −4); s₁ leaves, x₁ enters (ratio 2 against 3 for x₃), and after one iteration all basic values are non-negative, so the optimum is x₁ = 4, x₂ = 0, x₃ = 0 with minimum Z = 8.

An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work

What the question asks

The dual simplex method needs a starting tableau that is optimal (dual feasible: all zj − cj ≤ 0 for a minimisation) but infeasible. Convert ≥ constraints to ≤ by multiplying by −1, add slacks, then pick the leaving variable as the most negative basic value and the entering variable by the minimum ratio |(zj − cj)/a_rj| over a_rj < 0. Show each tableau.

Answer outline

Introduction

Multiply the ≥ constraints by −1: −x₁ + 2x₂ − x₃ + s₁ = −4; 2x₁ + x₂ + x₃ + s₂ = 8; −x₁ + x₃ + s₃ = 0; all variables ≥ 0. Costs c = (2, 1, 3, 0, 0, 0).

Step 1: Initial tableau (basis s₁, s₂, s₃)

Step 2: Choose pivot

Step 3: Second tableau (basis x₁, s₂, s₃)

Step 4: Solution and check

Conclusion

Minimum Z = 8 at x₁ = 4, x₂ = 0, x₃ = 0, reached in one dual simplex iteration; the optimal basis is degenerate since s₂ = 0.

Examples and data to cite

Facts

Facts to remember

Sources used for the explanation

Write a timed answer in the app