Q.A farmer wants his crop to receive at least 10 units of nitrogen and at least 15 units of phosphorus. Fertiliser costs ₹4 per bag and supplies 1 unit of nitrogen and 3 units of phosphorus; fertiliser costs ₹6 per bag and supplies 2 units of nitrogen and 1 unit of phosphorus. Formulate this as an LPP and solve it graphically to find the minimum cost.
Formulation. Let = bags of fertiliser , = bags of fertiliser . Minimise . Nitrogen: . Phosphorus: . Non-negativity: .
Corner points. On the x-axis (): ; . The larger governs: (checking ✓).
On the y-axis (): ; . The larger governs: (checking ✓).
Intersection of the two lines. Solving and : from the second, ; substituting, — the third corner point, .
Evaluating .
| Corner | |
|---|---|
The smallest value is at . Since both constraints push the feasible region away from the origin in the direction that increases , no feasible point beyond can give a smaller cost — is genuinely the minimum.
Independent check. Substitute into both constraints: ✓ (exactly meets nitrogen); ✓ (exactly meets phosphorus) — both requirements exactly satisfied, confirming a genuine corner point.
Minimum cost , using bags of and bags of .
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.