论文信息 - Characterization of efficient solutions of multi-objective E-convex programming problems

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.

Ebrahim A. Youness

[1] M. A. Hanson,et al. Convex Transformable Programming Problems and Invexity , 1987 .

[2] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .

[3] Ebrahim A. Youness. Optimality criteria in E-convex programming , 2001 .

[4] Xiaoqi Yang,et al. Convex composite multi-objective nonsmooth programming , 1993, Math. Program..

[5] Hoang Xuan Phu,et al. Six Kinds of Roughly Convex Functions , 1997 .

[6] M. A. Hanson. On sufficiency of the Kuhn-Tucker conditions , 1981 .

[7] S. Bolintinéanu,et al. Necessary conditions for nonlinear suboptimization over the weakly-efficient set , 1993 .

[8] E. Youness. E-Convex Sets, E-Convex Functions, and E-Convex Programming , 1999 .