Abstract
In linear programming associated with every maximization problem is a dual minimization problem whose feasible solutions yield upper bounds on the values of the former problem. This property is known as weak duality between the primal and dual problems. When the optimal values of the two problems are finite, they are equal, and so strong duality holds.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Luc, D.T. (2016). Duality. In: Multiobjective Linear Programming. Springer, Cham. https://doi.org/10.1007/978-3-319-21091-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-21091-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21090-2
Online ISBN: 978-3-319-21091-9
eBook Packages: Business and ManagementBusiness and Management (R0)