Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions

被引：13
|
作者：
Agarwal, Ravi P. [1 ]
Ahmad, Izhar [1 ,3 ]
Jayswal, Anurag [2 ]
机构：
[1] King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi Arabia
[2] Birla Inst Technol, Dept Appl Math, Ranchi 835215, Bihar, India
[3] Aligarh Muslim Univ, Dept Math, Aligarh 202002, Uttar Pradesh, India
来源：
MATHEMATICAL AND COMPUTER MODELLING | 2010年 / 52卷 / 9-10期
关键词：
Multi-objectiveprogramming; K-F; -; convexity; Cone constraints; Efficiency; Duality theoems;
D O I：
10.1016/j.mcm.2010.06.030
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K-F-convexity assumptions. Our results generalize several known results in the literature. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1644 / 1650
页数：7
相关论文
共 50 条
12345