Consider the following Linear Programming Problem (LPP). Maximise Z = x₁ + 2x₂ Subject to: x₁ ≤ 2 x₂ ≤ 2 x₁ + x₂ ≤ 2 x₁,
Look at it this way: complete solution: write formula, plug data, do arithmetic. Final value matches 0, 2. Simple and accurate.
Ref: NCERT Mathematics Class XII — Linear Programming