In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
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...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].展开更多
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
基金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 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].