Quantitative Analysis for Management, 13/e

Module 7 Linear Programming: The Simplex Method

Learning Objectives

After completing this module, students will be able to:

1. M7.1 Convert LP constraints to equalities with slack, surplus, and artificial variables.

2. M7.2 Set up and solve LP maximization problems with simplex tableaus.

3. M7.3 Interpret the meaning of every number in a simplex tableau.

4. M7.4 Set up and solve LP minimization problems with simplex tableaus.

5. M7.5 Recognize special cases such as infeasibility, unboundedness and degeneracy.

6. M7.6 Use the simplex tables to conduct sensitivity analysis.

7. M7.7 Construct the dual problem from the primal problem.

8. M7.8 Understand the importance of Karmarkar’s Algorithm to the field of LP.

In Chapter 7, we looked at examples of linear ...