Question

Arrange the following steps for solving Simplex linear programming problems in the correct order:

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

Hint:

Simplex method = Slack → Initial solution → Tableau → Iterate until optimal.

Answer 1

The Correct Option is A

Step 1: Introduce slack variables.
- Transform inequalities to equalities → (A)
Step 2: Establish initial basic feasible solution.
- Determine a feasible solution → (B)
Step 3: Construct initial Simplex tableau and check for optimality.
- (C)
Step 4: Iterate and refine until optimal solution is found.
- (D)