Abstract
The simplex algorithm was discovered in 1947 by G. Dantzig as a tool to solve linear programs„ Simplex algorithm is central to this course on linear programming because it exemplifies the process of operations research described in the preface: it is not only a very efficient way (its efficiency is not yet completely understood) of solving practical problems, used innumerable times by engineers, industrialists, and military people, but it is also the basis of a mathematical theory that can be used to prove various results.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sakarovitch, M. (1983). The Simplex Algorithm. In: Thomas, J.B. (eds) Linear Programming. Springer Texts in Electrical Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4106-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4106-3_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90829-8
Online ISBN: 978-1-4757-4106-3
eBook Packages: Springer Book Archive