Characterization of efficient solutions of multi-objective E-convex programming problems

摘要

In this paper we shall interest with characterization of efficient solutions for special classes of problems. These classes are called E-convex programming Problems in which the decision spaces effected by an operator E. Duality gap, in multi-objective programming problems, can't be occur in our considered class. In the end of paper an illustrative example was presented.