SUFFICIENCY AND DUALITY FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS INVOLVING GENERALIZED UNIVEX FUNCTIONS  

作　　者：LONG Xianjun 

机构地区：[1]College of Mathematics and Statistics,Chongqing Technology and Business University

出　　处：《Journal of Systems Science & Complexity》2013年第6期1002-1018,共17页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant No.11001287;the 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.

关 键 词：DUALITY multiobjective programming nonsmooth pseudounivexity nonsmooth quasiuni-vexity nonsmooth univexity sufficient optimality condition weakly efficient solution. 

分 类 号：O221.6[理学—运筹学与控制论]