| Abstrakt: |
In this paper, a new concept of generalized convexity is introduced for not necessarily differentiable multiobjective programming problems with E -differentiable functions. Namely, the concept of E -type Ⅰ functions is defined for E -differentiable multiobjective programming problem. Based on the introduced concept of generalized convexity, the sufficiency of the so-called E -Karush–Kuhn–Tucker optimality conditions are established for a feasible point to be an E -efficient or a weakly E -efficient solution. Further, the so-called vector Mond-Weir E -dual problem is defined for the considered E -differentiable multiobjective programming problem and several E -duality theorems in the sense of Mond-Weir are derived under appropriate generalized E -type Ⅰ functions. [ABSTRACT FROM AUTHOR] |
