In a Linear Programming Problem Involving Two Decision Variables, a Change

Multiple Choice

In a linear programming problem involving two decision variables, a change in one of their coefficients in the objective function will:

A) always change the optimal solution.
B) change the feasible region.
C) never change the optimal solution because the other coefficient is still fixed.
D) change the optimal solution only if the slope of the objective function's contour changes significantly.
E) necessarily change all shadow prices.