Abstract
The simplex method was invented by Dantzig and was first published in 1951. It can be used to solve any linear programming problem, once it has been put into canonical form. Its name derives from the geometrical ‘simplex’, as one of the first problems to be solved by the method contained the constraint \(\sum\limits_{i = 1}^{n + 1} {{x_i} = 1} \) .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1971 Kathleen Trustrum
About this chapter
Cite this chapter
Trustrum, K. (1971). The Simplex Method. In: Linear Programming. Library of Mathematics. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-9462-7_4
Download citation
DOI: https://doi.org/10.1007/978-94-010-9462-7_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7100-6779-1
Online ISBN: 978-94-010-9462-7
eBook Packages: Springer Book Archive