Strong Kuhn–Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
Tóm tắt
We consider a Pareto multiobjective optimization problem with a feasible set defined by inequality and equality constraints and a set constraint, where the objective and inequality constraints are locally Lipschitz, and the equality constraints are Fréchet differentiable. We study several constraint qualifications in the line of Maeda (J. Optim. Theory Appl. 80: 483–500, 1994) and, under the weakest ones, we establish strong Kuhn–Tucker necessary optimality conditions in terms of Clarke subdifferentials so that the multipliers of the objective functions are all positive.
Tài liệu tham khảo
Bigi G, Pappalardo M (1999) Regularity conditions in vector optimization. J Optim Theory Appl 102:83–96
Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York
Giorgi G, Jiménez B, Novo V (2004) On constraint qualification in directionally differentiable multiobjective optimization problems. RAIRO Oper Res 38:255–274
Hiriart-Urruty JB, Lemaréchal C (1996) Convex analysis and minimization algorithms I. Springer, Berlin
Ishizuka Y (1992) Optimality conditions for directionally differentiable multiobjective programming problems. J Optim Theory Appl 72:91–111
Jiménez B, Novo V (1999) Cualificaciones de restricciones en problemas de optimización vectorial diferenciables. Actas XVI C.E.D.Y.A./VI C.M. A, vol I, Universidad de Las Palmas de Gran Canaria, Spain, pp 727–734
Jiménez B, Novo V (2002) Alternative theorems and necessary optimality conditions for directionally differentiable multiobjective programs. J Convex Anal 9:97–116
Jourani A (1994) Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems. J Optim Theory Appl 81:533–548
Li XF (2000) Constraint qualifications in nonsmooth multiobjective optimization. J Optim Theory Appl 106:373–398
Li XF, Zhang JZ (2005) Stronger Kuhn–Tucker type conditions in nonsmooth multiobjective optimization: locally Lipschitz case. J Optim Theory Appl 127:367–388
Luu DV (2007) On constraint qualifications and optimality conditions in locally Lipschitz multiobjective programming problems. Hanoi Institute of Mathematics, Preprint 2007/04/01. From the website http://www.math.ac.vn
Luu DV, Nguyen MH (2006) On alternative theorems and necessary conditions for efficiency. Cahiers de la Maison des Sciences Économiques. From http://mse.univ-paris1.fr/Publicat.htm
Maeda T (1994) Constraint qualifications in multiobjective optimization problems: differentiable case. J Optim Theory Appl 80:483–500
Mangasarian OL (1969) Nonlinear programming. McGraw–Hill, New York
Preda V, Chitescu I (1999) On constraint qualification in multiobjective optimization problems: semidifferentiable case. J Optim Theory Appl 100:417–433
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Sawaragi Y, Nakayama H, Tanino T (1985) Theory of multiobjective optimization. Academic, Orlando
Yuan D, Chinchuluun A, Liu X, Pardalos PM (2007) Optimality conditions and duality for multiobjective programming involving (C,α,ρ,d) type-I functions. In: Konnov IV, Luc DT, Rubinov AM (eds) Generalized convexity and related topics. Lecture Notes in Econom and Math Systems, vol 583. Springer, Berlin, pp 73–87