Abstract
In this paper, we are interested in deriving the sufficient and necessary conditions for an optimal solution of special classes of programming problems. These classes involve generalized
E
-
[
0
,
1
]
convex functions. The characterization of efficient solutions for
E
-
[
0
,
1
]
convex multi-objective programming problems is obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are derived.