Higher-order Mond-Weir converse duality in multiobjective programming involving cones  

作　　者：YANG XinMin YANG Jin YIP Tsz Leung TEO Kok Lay 

机构地区：[1]Department of Mathematics, Chongqing Normal University [2]Department of Applied Mathematics, The Hong Kong Polytechnic University [3]Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University [4]Department of Mathematics and Statistics, Curtin University,W.A. 6845, Australia

出　　处：《Science China Mathematics》2013年第11期2389-2392,共4页中国科学：数学（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.10831009 and 11271391);the Natural Science Foundation of Chongqing(Grant No.CSTC2011BA0030)

摘　　要：In this work, we established a converse duality theorem for higher-order Mond-Weir type multiob- jective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in inultiobjective programming with cone constraints. Optimization, 2010, 59： 29-43].In this work,we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones.This flls some gap in recently work of Kim et al.[Kim D S,Kang H S,Lee Y J,et al.Higher order duality in multiobjective programming with cone constraints.Optimization,2010,59:29–43].

关 键 词：multiobjective programming higher order Mond-Weir dual model converse duality theorem CONES 

分 类 号：O221.6[理学—运筹学与控制论]