In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse dual...In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse duality theorem, are established under higher-order (strongly) cone pseudoinvexity assumptions.展开更多
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.展开更多
基金Supported by the National Natural Science Foundation of China(No.11431004,11271391 and 11201511)the Natural Science Foundation of Chongqing(CSTC2014pt-sy00001,CSTC2015jcyj A00005)the Education Committee Project Research Foundation of Chongqing(KJ1500309,KJ1400519)
文摘In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse duality theorem, are established under higher-order (strongly) cone pseudoinvexity assumptions.
文摘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.