Consider the Following Linear Programming Problem:
Maximize $2 x _ { 1 } + 2 x _ { 2 }$

Multiple Choice

Consider the following linear programming problem:
Maximize $2 x _ { 1 } + 2 x _ { 2 }$
Subject to $4 x _ { 1 } + 3 x _ { 2 } \geq 12$
$- 2 x _ { 1 } - 3 x _ { 2 } \leq 6$
$x _ { 2 } \geq 2$
$x _ { 1 } , x _ { 2 } \geq 0$
The above linear programming problem:

A) has only one optimal solution
B) has more than one optimal solution
C) exhibits infeasibility
D) exhibits unboundedness