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 paper,we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems.Three new classes of functions,namelyε-pseudoconvex functions of type I and type II andε-quasico...In this paper,we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems.Three new classes of functions,namelyε-pseudoconvex functions of type I and type II andε-quasiconvex functions are introduced,respectively.By utilizing these new concepts,sufficient optimality conditions of approximate solutions for the nonsmooth semi-infinite programming problem are established.Some examples are also presented.The results obtained in this paper improve the corresponding results of Son et al.(J Optim Theory Appl 141:389–409,2009).展开更多
文摘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.
基金This work was partially supported by the National Natural Science Foundation of China(Nos.11471059 and 11671282)the Chongqing Research Program of Basic Research and Frontier Technology(Nos.cstc2014jcyjA00037,cstc2015jcyjB00001 and cstc2014jcyjA00033)+2 种基金the Education Committee Project Research Foundation of Chongqing(Nos.KJ1400618 and KJ1400630)the Program for University Innovation Team of Chongqing(No.CXTDX201601026)the Education Committee Project Foundation of Bayu Scholar.
文摘In this paper,we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems.Three new classes of functions,namelyε-pseudoconvex functions of type I and type II andε-quasiconvex functions are introduced,respectively.By utilizing these new concepts,sufficient optimality conditions of approximate solutions for the nonsmooth semi-infinite programming problem are established.Some examples are also presented.The results obtained in this paper improve the corresponding results of Son et al.(J Optim Theory Appl 141:389–409,2009).
