In Order for a Linear Programming Problem to Have a Unique

Multiple Choice

In order for a linear programming problem to have a unique solution, the solution must exist

A) at the intersection of the non-negativity constraints.
B) at the intersection of a non-negativity constraint and a resource constraint.
C) at the intersection of the objective function and a constraint.
D) at the intersection of two or more constraints.