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