In a Linear Programming Problem, the Inequalities, X + 2Y

Multiple Choice

In a linear programming problem, the inequalities, X + 2Y ≤ 12 and 3X + 4Y ≥ 28, hold as binding constraints. The problem's optimal solution would be:

A) X = 4, and Y = -4.
B) X = 4, and Y = 8.
C) X = 4, and Y = 4.
D) X = 8, and Y = 4.
E) X = 12, Y = 0.