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 ...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 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...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.展开更多
基金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].
基金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.
