Use graphical method to solve the linear programming problem. Maximize $Z = 3x_1 + 2x_2$ subject to $$x_1 - x_2 \geqslant 1,$$ $$x_1 + x_3 \geqslant 3$$ and $$x_1, x_2, x_3 \geqslant 0$$
Aryan Yadav, AIR 31, 2025
[a hand-drawn graph with $x_1$ horizontal and $x_2$ vertical, the lines $x_1 - x_2 = 1$ and $x_1 + x_3 = 2$ drawn, points $(1,0,0)$, $(3,0,0)$ and $(0,6,3)$ marked, and the unbounded feasible region hatched]
Clearly feasible region is unbounded & we can take arbitrarily large values of $x_1, x_2$
(for any $M \in R$ chose $x_1 = M$, $x_2 = M - 1$)
Hence solution is Unbounded