Abstract
We can State now an iterative procedure for the resolution of the linear programming problem (LP) in Standard form with descriptive “input data” m, n, A, b and c.
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
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alevras, D., Padberg, M.W. (2001). Simplex Algorithms. In: Linear Optimization and Extensions. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56628-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-56628-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41744-6
Online ISBN: 978-3-642-56628-8
eBook Packages: Springer Book Archive