On Nondifferentiable Higher-Order Symmetric Duality in Multiobjective Programming Involving Cones  

作　　者：Xin Min Yang Jin Yang Tsz Leung Yip 

机构地区：[1]Department of Mathematics,Chongqing Normal University,Chongqing 400047,China [2]Department of Applied Mathematics,The Hong Kong Polytechnic University,Hung Hom,Kowloon,Hong Kong,China [3]Department of Logistics and Maritime Studies,The Hong Kong Polytechnic University,Hung Hom,Kowloon,Hong Kong,China

出　　处：《Journal of the Operations Research Society of China》2013年第4期453-465,共13页中国运筹学会会刊（英文）

基　　金：This work was partially supported by the National Natural Science Foundation of China(Nos.11271391 and 10831009);d the Natural Science Foundation of Chongqing(CSTC,No.2011BA0030).

摘　　要：In this paper,we point out some deficiencies in a recent paper(Lee and Kim in J.Nonlinear Convex Anal.13:599–614,2012),and we establish strong duality and converse duality theorems for two types of nondifferentiable higher-order symmetric duals multiobjective programming involving cones.

关 键 词：Multiobjective programming Higher-order Mond-Weir symmetric dual model Higher-order Wolfe symmetric dual model Strong duality theorems Converse duality theorems Nondifferentiability 

分 类 号：O17[理学—数学]