Open AccessOptimality for E-[0,1] convex multi-objective programming
Author(s) -
Tarek Emama
Publication year - 2017
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1703529e
Subject(s) - mathematics , mathematical optimization , convex optimization , regular polygon , characterization (materials science) , convex function , proper convex function , convex analysis , materials science , geometry , nanotechnology
In this paper, we interest with deriving the sufficient 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.