Exams › GATE › Technical
Maximize $Z = 15X_1 + 20X_2$ subject to $12X_1 + 4X_2 \ge 36$, $12X_1 - 6X_2 \le 24$, $X_1, X_2 \ge 0$. The above linear programming problem has
- infeasible solution
- unbounded solution
- alternative optimum solutions
- degenerate solution
Correct answer: alternative optimum solutions
Solution
The feasible region formed by the constraints allows the objective function to attain the same maximum value along an edge rather than at a single point. This indicates multiple optimal solutions. Hence, the problem has alternative optimum solutions.
Related GATE Technical questions
⚔️ Practice GATE Technical free + battle 1v1 →