Abstract
After this “tour de force” in abstract duality theory, the reader — if there still is any — will probably be glad to learn that we are now coming back to Kn, in order to have a short break there and solve our optimization problems from Chapter 4. Our main object however will be to show that linear programming essentially is an oriented matroid problem.
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
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bachem, A., Kern, W. (1992). Linear Programming Duality. In: Linear Programming Duality. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58152-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-58152-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55417-2
Online ISBN: 978-3-642-58152-6
eBook Packages: Springer Book Archive