Consider the following LPP: Maximize z = 60X₁ + 50X₂ Subject to X₁ + 2X₂ ≤ 40, 3X₁ + 2X₂ ≤ 60 where, X₁ and X₂ ≥ 0
Notice that complete solution: write formula, plug data, do arithmetic. Final value matches The LPP has a unique optimal solution. Simple and accurate.
Ref: NCERT Mathematics Class XII — Linear Programming
