Question

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 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 
Choose the correct answer from the options given below:
 

• A. (A), (B), (C), (D)
• B. (D), (A), (B), (C)
• C. (B), (A), (C), (D)
• D. (C), (B), (A), (D)

Hint:

Linear programming is an essential method for optimizing resource allocation and achieving specific objectives in business and economics.

Answer 1

The Correct Option is B

 

Step 1: Sequence of steps for solving linear programming problems. 
To solve a linear programming problem, certain steps must be followed in sequence.

Step 2: Proper Order of Steps: 
- (D) Construct a graph, placing decision variables on the axes. 

- (A) Graph each constraint as though it were binding, i.e., held with strict equality. 

- (B) Find the feasible region that satisfies all constraints. 

- (C) Superimpose contours of the objective function to determine the optimal corner of the region.

Step 3: Correct Order. 
Thus, the correct sequence is: - First, construct the graph (D). - Then, graph each constraint (A). - Followed by finding the feasible region (B). - Finally, superimpose the contours to find the optimal solution (C).

Step 4: Conclusion. 
The correct sequence is (D), (A), (B), (C), so the correct answer is (2).