In a Linear Programming Problem, Multiple Optimal Solutions Are Possible

Multiple Choice

In a linear programming problem, multiple optimal solutions are possible if:

A) the contour of objective function touches one corner of the feasible region.
B) there are more than two nonbinding constraints.
C) the objective function is non-linear.
D) the slope of the objective function equals the slope of a binding constraint.
E) the feasible region is unbounded.