In a Linear Programming Problem, There Are 3 Binding Constraints

Multiple Choice

In a linear programming problem, there are 3 binding constraints. Constraint A has slope -1.5, constraint B has slope -0.5, and constraint C has slope -0.2. The objective function's slope is -1.2. Where would the optimal solution lie?

A) At the intersection of constraints A and B
B) At the intersection of constraints B and C
C) At the intersection of constraint A and the horizontal axis
D) At the intersection of constraint C and the vertical axis
E) Anywhere along constraint A