Optimality conditions and duality for multiobjective programming involving (c, α, ρ, d) type-I functions

Abstract

In this chapter, we present a unified formulation of generalized convex functions. Based on these concepts, sufficient optimality conditions for a nondifferentiable multiobjective programming problem are presented. We also introduce a general Mond-Weir type dual problem of the problem and establish weak duality theorem under generalized convexity assumptions. Strong duality result is derived using a constraint qualification for nondifferentiable multiobjective programming problems. © 2006 Springer-Verlag Berlin Heidelberg.