SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY

Abstract

We are concerned with nonlinear multiobjective programming problem with inequality constraints. We introduce some classes of nonconvex functions by relaxing the definitions of invex and preinvex functions. Examples are given to shows relationship between them. Various first and second order sufficient optimality theorems are obtained. Moreover, we prove duality and converse duality results for Mond-Weir type dual.

Keywords:

• Multiobjective programming
• Pareto minimal solutions
• Sufficient conditions
• Convexity
• Invexity
• Duality
• Converse duality

Acknowledgments