For the linear programming problem:
Maximum Z = 3X1 + 2X2
Subject to
-2X1 + 3X2 ≤ 9
X1 – 5X2 ≥ - 20
X1, X2 ≥ 0
The above problem has
1
unbounded solution
2
infeasible solution
3
alternative optimum solution
4
degenerate solution
For the linear programming problem:
Maximum Z = 3X1 + 2X2
Subject to
-2X1 + 3X2 ≤ 9
X1 – 5X2 ≥ - 20
X1, X2 ≥ 0
The above problem has