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

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

作者机构：Department of Mathematics Chongqing Normal University Department of Applied Mathematics The Hong Kong Polytechnic University Department of Logistics and Maritime Studies The Hong Kong Polytechnic University Department of Mathematics and Statistics Curtin UniversityW.A. 6845 Australia 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2013年第56卷第11期

页      面：2389-2392页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

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

主　　题：multiobjective programming higher order Mond-Weir dual model converse duality theorem cones 

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