Year: 2015
Type: article
Abstract: In this paper, we are interested in deriving the sufficient and necessary conditions for an optimal solution of special classes of programming problems. These classes involve generalized $E\mbox{-}[0,1]$ convex functions. The characterization of efficient solutions for $E\mbox{-}[0,1]$ convex multi-objective programming problems is obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are derived.
Author: Tarek Emam
Institutions: Suez University, University of Ha'il
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,190
OpenAlex ID: W2157019285