Abstract
In this brief chapter, we introduce some fundamental concepts in linear programming: bases, basic solutions, canonical form associated with a given basis, feasible basis, optimal basis. These notions are a key to the understanding of the simplex algorithm.
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). Bases and Basic Solutions of Linear Programs. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4106-3_4
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