For the linear programming problem: Maximize z = 3x1 +

Home » Industrial Engineering » Industrial Engineering Miscellaneous » Question

For the linear programming problem:
Maximize z = 3x₁ + 2x₂
Subject to –2x₁ + 3x₂ ≤ 9
x₁ – 5x₂ ≥ – 20
x₁, x₂ ≥ 0
The above problem has

1. unbounded solution
2. infeasible solution
3. alternative optimum solution
4. degenerate solution

Correct Option: C

Maximize Z = 3X₁ + 2X₂
Subject to
– 2X₁ + 3X₂ ≤ 9
X₁ – 5X₂ ≥ 20
X₁, X₂ ≥ 0