论文信息 - Optimally Conditions for Pareto Nonsmooth Nonconvex Programming in Banach Spaces

Optimally Conditions for Pareto Nonsmooth Nonconvex Programming in Banach Spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush–Kuhn–Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

M. A. Rojas-Medar | A. J. V. Brandão | G. N. Silva

[1] R. N. Mukherjee,et al. On generalised convex multi-objective nonsmooth programming , 1996, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[2] S. K. Mishra,et al. Multiobjective Programming with Semilocally Convex Functions , 1996 .

[3] M. Minami. Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space , 1983 .

[4] B. Craven. Nonsmooth multiobjective programming , 1989 .

[5] Luis Coladas,et al. Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces , 1994, Bulletin of the Australian Mathematical Society.

[6] L. Thibault,et al. Lagrange multiplers for pareto nonsmooth programming problems in banach spaces , 1992 .

[7] Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization , 1994 .

[8] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .

[9] Nguyen Dong Yen,et al. Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function , 1995 .

[10] A. Zaffaroni,et al. Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization , 1996 .