Abstract
Linear programming models possess the interesting property of forming pairs of symmetrical problems. To any maximization problem corresponds a minimization problem involving the same data, and there is a close correspondence between their optimal solutions. The two problems are said to be “duals” of each other.
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
© 1974 Springer-Verlag/Wien
About this chapter
Cite this chapter
Danø, S. (1974). Duality in Linear Programming. In: Linear Programming in Industry. Springer, Vienna. https://doi.org/10.1007/978-3-7091-8346-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-8346-5_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81189-4
Online ISBN: 978-3-7091-8346-5
eBook Packages: Springer Book Archive