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

作     者：Agarwal, Ravi P. Ahmad, Izhar Jayswal, Anurag 

作者机构：King Fahd Univ Petr & Minerals Dept Math & Stat Dhahran 31261 Saudi Arabia Birla Inst Technol Dept Appl Math Ranchi 835215 Bihar India Aligarh Muslim Univ Dept Math Aligarh 202002 Uttar Pradesh India 

出 版 物：《MATHEMATICAL AND COMPUTER MODELLING》 (数学与计算机模型建立)

年 卷 期：2010年第52卷第9-10期

页      面：1644-1650页

核心收录：

学科分类：07[理学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 070101[理学-基础数学] 

主　　题：Multi-objectiveprogramming K-F - convexity Cone constraints Efficiency Duality theoems 

摘      要：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.