Consider the Following Linear Programming Problem:
Minimize $5 x _ { 1 } + 6 x _ { 2 }$

Consider the following linear programming problem:
Minimize $5 x _ { 1 } + 6 x _ { 2 }$
Subject to $x _ { 1 } + 2 x _ { 2 } \geq 12$
$3 x _ { 1 } + 2 x _ { 2 } \geq 24$
$3 x _ { 1 } + x _ { 2 } \geq 15$
$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