Abstract
In this chapter, we present the simplex algorithm, an effective method for solving the canonical maximization and canonical minimization linear programming problems of 1§2. The simplex algorithm was developed in the 1940’s by George B. Dantzig. We will employ certain refinements in Dantzig’s original technique developed in the 1960’s by A.W. Tucker. In particular, we will record our linear programming problems in what is called a Tucker tableau, a more compact version of the original Dantzig tableau and considerably easier to use.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Strayer, J.K. (1989). The Simplex Algorithm. In: Linear Programming and Its Applications. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1009-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1009-2_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6982-3
Online ISBN: 978-1-4612-1009-2
eBook Packages: Springer Book Archive