Optimality for E-[0,1] convex Multi-objective Programming Problems

Abstract

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