On First Order Optimality Conditions for Vector Optimization
- First Online:
- 126 Downloads
We develop first order optimality conditions for constrained vector optimization. The partial orders for the objective and the constraints are induced by closed and convex cones with nonempty interior. After presenting some well known existence results for these problems, based on a scalarization approach, we establish necessity of the optimality conditions under a Slater-like constraint qualification, and then sufficiency for the K-convex case. We present two alternative sets of optimality conditions, with the same properties in connection with necessity and sufficiency, but which are different with respect to the dimension of the spaces to which the dual multipliers belong. We introduce a duality scheme, with a point-to-set dual objective, for which strong duality holds. Some examples and open problems for future research are also presented.
KeywordsCone constraints vector optimization Pareto minimization first order optimality conditions convex programming duality
2000 MR Subject Classification90C25 90C30
Unable to display preview. Download preview PDF.
- 1.Avriel, M. Nonlinear programming: analysis and methods. Prentice Hall, New Jersey, 1976Google Scholar
- 4.Clarke, F.H. Optimization and nonsmooth analysis. John Wiley, New York, 1983Google Scholar
- 7.Flores–Bazán, F. Ideal, weakly efficient solutions for convex vector optimization problems. Technical Report, 99–26, Facultad de Ciencias Físicas y Matemáticas, Universidad de Concepción, Concepción, Chile, 1999Google Scholar
- 11.Hiriart–Urruty, J.–B., Lemaréchal, C. Convex analysis and minimization algorithms. Springer, Berlin, 1993Google Scholar
- 14.Luc, T.D. Theory of vector optimization. Lecture Notes in Economics and Mathematical Systems, 319, Springer, 1989Google Scholar
- 17.Rockafellar, R.T. Convex analysis. Princeton University Press, New Jersey, 1970Google Scholar
- 21.Sundaram, R.K. A first course in optimization theory. Cambridge University Press, Cambridge, 1996Google Scholar
- 23.Vanderberghe, L., Boyd, S. Positive–definite programmming. In: Mathematical Programming: state of the art (Birge, J.R., Murty, K.G.M. edit), University of Michigan, Ann Arbor, 276–308 (1994)Google Scholar