Pratidin
2026 · Mathematics Optional Paper II · 10 marksMainsQuestion 1e

Solve the dual problem of the following linear programming problem by the graphical method :
Minimize Y = 10y₁ + 6y₂ + 2y₃ + y₄
subject to the constraints :
y₁ + y₂ + y₃ + y₄ ≥ 2
2y₁ + y₂ - y₃ - 2y₄ ≥ 1
y₁, y₂, y₃, y₄ ≥ 0

10 marks · directive: Solve

Answer

The core of a good answer

The dual is Maximize W = 2x₁ + x₂ subject to x₁ + 2x₂ ≤ 10, x₁ + x₂ ≤ 6, x₁ - x₂ ≤ 2, x₁ - 2x₂ ≤ 1, x₁, x₂ ≥ 0; graphically its optimum is W = 10 at (x₁, x₂) = (4, 2), so the primal minimum is Y = 10, attained at y₁ = 0, y₂ = 3/2, y₃ = 1/2, y₄ = 0.

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

A four-variable minimisation cannot be drawn, but its dual has only two variables, so the method is: write the symmetric dual, plot its feasible region, evaluate the objective at the corner points, and then use the duality theorem (and complementary slackness) to read off the primal optimum.

Answer outline

Introduction

The primal is in canonical minimisation form (all constraints ≥, variables ≥ 0). Associate dual variables x₁ ≥ 0, x₂ ≥ 0 with the two constraints.

Step 1: Write the dual

Step 2: Plot the region

Step 3: Corner points

Step 4: Evaluate W

Step 5: Recover the primal (complementary slackness)

Conclusion

Dual optimum W = 10 at x₁ = 4, x₂ = 2; primal optimum Y = 10 at (0, 3/2, 1/2, 0). The equality Y = W = 10 confirms optimality by the strong duality theorem, and a separate LP solver run on the primal gives the same value.

Facts

Facts to remember

Sources used for the explanation

Write a timed answer in the app