Question

Consider the following Linear Programming problem (LPP)         

Maximize : Z = 3x₁ + 2x₂

Subject to x₁ $\leq$ 4

      3x₁ + 2x₂ $\leq$ 18

      x₁ $\geq$ 0, x₂ $\geq$ 0

      (a) The LPP has a unique optimal solution

      (b) The LPP is infeasible

      (c) The LPP is unbounded

      (d) The LPP has multiple optimal solutions