January 2017
Beginner to intermediate
280 pages
217h 11m
English
After completing this module, students will be able to:
M7.1 Convert LP constraints to equalities with slack, surplus, and artificial variables.
M7.2 Set up and solve LP maximization problems with simplex tableaus.
M7.3 Interpret the meaning of every number in a simplex tableau.
M7.4 Set up and solve LP minimization problems with simplex tableaus.
M7.5 Recognize special cases such as infeasibility, unboundedness and degeneracy.
M7.6 Use the simplex tables to conduct sensitivity analysis.
M7.8 Understand the importance of Karmarkar’s Algorithm to the field of LP.
In Chapter 7, we looked at examples of linear ...