Skip to main content
SpringerLink
Log in
Book cover

Linear Programming pp 13–27Cite as

The Simplex Method

  • Chapter

  • 2375 Accesses

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

Abstract

In this chapter we present the simplex method as it applies to linear programming problems in standard form.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  • The simplex method was invented by G.B. Dantzig in 1949. His monograph (Dantzig 1963) is the classical reference. Most texts describe the simplex method as a sequence of pivots on a table of numbers called the simplex tableau. Following Chvâtal (1983), we have developed the algorithm using the more memorable dictionary notation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Operations Research & Financial Engineering, Princeton University, USA

    Robert J. Vanderbei

Authors
  1. Robert J. Vanderbei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Robert J. Vanderbei

About this chapter

Cite this chapter

Vanderbei, R.J. (2001). The Simplex Method. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5662-3_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-5664-7

  • Online ISBN: 978-1-4757-5662-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation