Summary
We consider a general vector minimum optimization problem with convex objective functions and linear inequality constraints.
By means of linear scalarization and using the Fenchel-Rockafellar duality approach for the scalarized problem there is constructed a multiobjective dual maximum problem.
The investigations are devoted to weak and strong duality assertions. Moreover, optimality conditions are verified for properly efficient and efficient solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jahn, J., Duality in vector optimization. Math. Programming 25, 1983, 343–353.
Luc, D. T., Theory of Vector Optimization. Lecture Notes in Econom. and Math. Systems 319, Springer, Berlin, 1989.
Sawaragi, Y., Nakayama, H. and Tanino, T., Theory of Multiobjective Optimization. Academic Press, New York, 1985.
Song, W., Duality in set-valued optimization. Polish Academy of Science, Warsaw, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wanka, G., Bot, RI. (2000). Multiobjective Duality for Convex-Linear Problems. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-58300-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67094-0
Online ISBN: 978-3-642-58300-1
eBook Packages: Springer Book Archive