(i) Explain the steps required for formulating a linear programming model.
(ii) Find out the solution for a store from the following data :
Maximize Z = 50x₁ + 60x₂
subject to
x₁ + 1·5x₂ ≤ 40
4x₁ + 4·5x₂ ≤ 150
x₁, x₂ ≥ 0
Profit is in ₹.
Draw graph to arrive at result. (Graph paper is enclosed)
15 marks · directive: Explain
The core of a good answer
Formulation needs decision variables, an objective function, constraints and non-negativity; graphically, the optimum is at the corner x₁ = 30, x₂ = 20/3 (about 6.67), where maximum profit Z = ₹1,900.
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
Part (i) (5 marks) wants the formulation steps in order; part (ii) (10 marks) wants the graphical method: plot each constraint as a line, shade the feasible region, find its corner points and evaluate Z at each (or use an iso-profit line).
Answer outline
Introduction
(i) A linear programming model optimises a linear objective subject to linear constraints. (ii) Given: maximise Z = 50x₁ + 60x₂ subject to x₁ + 1.5x₂ ≤ 40, 4x₁ + 4.5x₂ ≤ 150, x₁, x₂ ≥ 0.
Part (i): Steps in formulation
- 1. Understand the problem and identify the decision to be made.
- 2. Define decision variables (e.g. x₁, x₂ = units of each product) with units.
- 3. Write the objective function as a linear expression to maximise (profit) or minimise (cost).
- 4. Write each resource or requirement as a linear constraint (≤, ≥ or =) using technological coefficients and available amounts.
- 5. Add non-negativity restrictions x₁, x₂ ≥ 0.
Step 1: Plot the constraint lines
- x₁ + 1.5x₂ = 40 meets the axes at (40, 0) and (0, 26.67).
- 4x₁ + 4.5x₂ = 150 meets the axes at (37.5, 0) and (0, 33.33).
- Both are ≤ constraints, so the feasible side is towards the origin; x₁, x₂ ≥ 0 keeps it in the first quadrant.
Step 2: Corner points of the feasible region
- O (0, 0); A (37.5, 0) on the second line; C (0, 26.67) on the first line.
- Intersection B: from x₁ + 1.5x₂ = 40, multiply by 4: 4x₁ + 6x₂ = 160; subtract 4x₁ + 4.5x₂ = 150: 1.5x₂ = 10, so x₂ = 6.67 (20/3) and x₁ = 40 - 10 = 30.
Step 3: Evaluate Z at each corner
- O: Z = 0
- A (37.5, 0): Z = 50 × 37.5 = 1,875
- B (30, 6.67): Z = 1,500 + 400 = 1,900
- C (0, 26.67): Z = 60 × 26.67 = 1,600
Conclusion
Optimal solution: x₁ = 30, x₂ = 20/3 ≈ 6.67, maximum Z = ₹1,900; both constraints are binding. Check: the iso-profit slope (-50/60 = -0.83) lies between the slopes of the two constraints (-0.67 and -0.89), confirming B is optimal. If only whole units are allowed, the integer optimum must be found separately.
Examples and data to cite
- George Dantzig invented the simplex method in 1947.
Facts to remember
- Extreme point result: if the objective has a maximum on the feasible region, it has this value on at least one extreme point (vertex).
- Iso-profit line method: move the line 50x₁ + 60x₂ = k away from the origin until it last touches the feasible region.
- A binding constraint holds as an equality at the optimum and has zero slack.