In this puper, on the basis of notions of d-p-（η, θ）-invex function, type I function and univex function, we present new classes of generalized d-p-（η, θ）-type I univex functions. By using these new concepts, ...In this puper, on the basis of notions of d-p-（η, θ）-invex function, type I function and univex function, we present new classes of generalized d-p-（η, θ）-type I univex functions. By using these new concepts, we obtain several sufficient optimality conditions for a feasible solution to be an efficient solution, and derive some Mond-Weir type duality results.展开更多
In this paper, nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudounivex functions are introduced. By utilizing these new concepts, sufficient optimality conditions for a weakly efficient solution of the non...In this paper, nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudounivex functions are introduced. By utilizing these new concepts, sufficient optimality conditions for a weakly efficient solution of the nonsmooth multiobjective programming problem are established. Weak and strong duality theorems axe also derived for Mond-Weir type multiobjective dual programs.展开更多
基金Supported by the National Natural Science Foundation of China (Grant No.60674108)the Fundamental Research Funds for the Central Universities (Grant Nos.K50510700004JY10000970006)
文摘In this puper, on the basis of notions of d-p-（η, θ）-invex function, type I function and univex function, we present new classes of generalized d-p-（η, θ）-type I univex functions. By using these new concepts, we obtain several sufficient optimality conditions for a feasible solution to be an efficient solution, and derive some Mond-Weir type duality results.
基金supported by the National Natural Science Foundation of China under Grant No.11001287the Natural Science Foundation Project of Chongqing(CSTC 2010BB9254)the Education Committee Project Research Foundation of Chongqing under Grant No.KJ100711
文摘In this paper, nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudounivex functions are introduced. By utilizing these new concepts, sufficient optimality conditions for a weakly efficient solution of the nonsmooth multiobjective programming problem are established. Weak and strong duality theorems axe also derived for Mond-Weir type multiobjective dual programs.
