Consider the Following Linear Programming Model
This Linear Programming Model

Multiple Choice

Consider the following linear programming model
This linear programming model has:
$$\begin{array} { l l } \operatorname { Min } & 2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \\\text { Subject to: } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}$$

A) unique optimal solution
B) unbounded solution
C) infeasible solution
D) alternate optimal solution
E) redundant constraints