Abstract
In this chapter we shall describe how to implement the simplex algorithm on a computer. As stated earlier, this algorithm requires the solution of a sequence of linear systems of equations. We devote considerable space to explaining how to solve such systems in a computationally efficient way. In the last section we discuss the construction of a basic solution with which one can start the simplex algorithm.
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
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Glashoff, K., Gustafson, SÅ. (1983). Numerical Realization of the Simplex Algorithm. In: Linear Optimization and Approximation. Applied Mathematical Sciences, vol 45. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1142-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1142-6_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90857-1
Online ISBN: 978-1-4612-1142-6
eBook Packages: Springer Book Archive