Page 231 -

Chapter 5

Linear Programming: The Simplex

Method

5.1 An Algebraic Overview of the Simplex Method 5.6 Tableau Form: the General Case
Algebraic Properties of the Simplex Method Greater-Than-or-Equal-to Constraints ( )
Determining a Basic Solution Equality Constraints
Basic Feasible Solution Eliminating Negative Right-Hand Side Values
Summary of the Steps to Create Tableau Form
5.2 Tableau Form
5.7 Solving a Minimization Problem
5.3 Setting Up the Initial Simplex Tableau
5.8 Special Cases
5.4 Improving the Solution
Infeasibility
5.5 Calculating the Next Tableau Unbounded Problems
Interpreting the Results of an Iteration Alternative Optimal Solutions
Moving Toward a Better Solution Degeneracy
Interpreting the Optimal Solution
Summary of the Simplex Method

Learning objectives By the end of this chapter you will be able to:

l Formulate an LP problem using the Simplex method

l Calculate the Simplex tableau

l Find the optimum solution using the Simplex method
l Interpret the information in a Simplex tableau

211

Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.