Solve the following Linear Programming Problem Graphically.
Maximize Z = 5x + 8y,
Subject to constraints
2x + 3y ≥ 10
5x + 2y ≥ 14
x, y ≥ 0
For the LPP,
1
feasible region and the solution are bounded
2
feasible region and the solution are unbounded
3
feasible region is unbounded and solution is bounded
4
feasible region is bounded and solution is unbounded