Question

For the linear programming problem:

Maximize Z = 3x₁ + 2x₂

Subject to –2x₁ + 3x₂ $\leq$ 9

                  x₁ – 5x₂ $\geq$ –20

                  x₁, x₂ $\geq$ 0

The above problem has                                                               

      (a) Unbounded solution

      (b) Infeasible solution

      (c) Alternative solution

      (d) Degenerate solution