Consider the following Linear Programming Problem (LPP): Maximize Z = 3x₁ + 2x₂ Subject to x₁ ≤ 4 x₂ ≤ 6 3x₁ + 2x₂ ≤ 18
The trick is solving fully: apply relevant formula, put numbers, compute. Result comes as The LPP has multiple optimal solutions. Easy verification shows it satisfies condition.
Ref: NCERT Mathematics Class XII — Linear Programming
