Arrange the following steps in the proper sequence concerning the solution of a linear programming problem: (A) Graph each constraint as though it were binding, i.e., as if it held with strict equality (B) Find the feasible region, the area of the graph that simultaneously satisfies all constraints (C) Superimpose contours of the objective function on the feasible region to determine the optimal corner of the region (D) Construct a graph, placing a decision variable on each axis
Tap an option to check your answer.