The Simplex Method, Part 2

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 149)


This chapter completes this book’s introductory account of the simplex method. In this chapter, you will see:
  • How Phase I of the simplex method determines whether a linear program has a feasible solution and, if so, how it constructs a basic feasible tableau with which to initiate Phase II.

  • That the simplex method can “cycle” (fail to terminate finitely) and that it can be kept from doing so.

  • That the simplex method readily accommodates variables that are not required to be nonnegative.


Free Variable Simplex Method Basic Feasible Solution Ellipsoid Method Nonbasic Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Yale UniversityNew HavenUSA

Personalised recommendations