Abstract
It is well-known from scalar optimization that, under appropriateassumptions, a maximization problem can beassociated to a given minimization problem so that both problems have the same optimal values. Such a duality between a minimization and a maximization problem can also be formulated in vector optimization. In the first section we present a general duality principle for vector optimization problems. The following sections are devoted to a duality theory for abstract optimization problems. A generalization of the duality results known from linear programming is also given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jahn, J. (2011). Duality. In: Vector Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17005-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-17005-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17004-1
Online ISBN: 978-3-642-17005-8
eBook Packages: Business and EconomicsBusiness and Management (R0)