Journal of inequalities and applications | |
Optimality and mixed duality in multiobjective E -convex programming | |
Guang-Ri Piao1  | |
关键词: E-convex function; mixed duality; multiobjective programming; optimality condition; 90C29; 90C30; 69K05; | |
DOI : 10.1186/s13660-015-0854-6 | |
学科分类:数学(综合) | |
来源: SpringerOpen | |
【 摘 要 】
In this paper, we consider a class of multiobjective E-convex programming problems with inequality constraints, where the objective and constraint functions are E-convex functions which were firstly introduced by Youness (J. Optim. Theory Appl. 102:439-450, 1999). Fritz-John and Kuhn-Tucker necessary and sufficient optimality theorems for the multiobjective E-convex programming are established under the weakened assumption of the theorems in Megahed et al. (J. Inequal. Appl. 2013:246, 2013) and Youness (Chaos Solitons Fractals 12:1737-1745, 2001). A mixed duality for the primal problem is formulated and weak and strong duality theorems between primal and dual problems are explored. Illustrative examples are given to explain the obtained results.
【 授权许可】
CC BY
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201902011079484ZK.pdf | 1621KB | download |