Abstract
In order to present the most important facts about linear optimization methods, we need to become familiar with the theory of convex polyhedra and the methods of linear and integer programming. We recommend the books by Cook, Cunningham, Pulleyblank and Schrijver [45], Martin [163], Nemhauser and Wosley [186], Schrijver [210] and Ziegler [250].
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
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bilbao, J.M. (2000). Linear optimization methods. In: Cooperative Games on Combinatorial Structures. Theory and Decision Library, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4393-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4393-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6976-9
Online ISBN: 978-1-4615-4393-0
eBook Packages: Springer Book Archive