Abstract
Associated with every linear programming problem is another such problem called its dual. Quite generally, duality theory addresses itself to the study of the connection between two related linear programming problems, where one of them, the primal, is a maximization (minimization) problem and the other, the dual, is a minimization (maximization) problem. Moreover, this association is such that the existence of an optimal solution to one of these problems guarantees an optimal solution to the other with the result that their extreme values are equal.
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
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Panik, M.J. (1996). Duality Theory. In: Panik, M.J. (eds) Linear Programming: Mathematics, Theory and Algorithms. Applied Optimization, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3434-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3434-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3436-1
Online ISBN: 978-1-4613-3434-7
eBook Packages: Springer Book Archive