一类广义凸函数非光滑规划问题的混合对偶  

The Mixed Dual for a Class of Nonsmooth Invex Programming Problems

作　　者：王晓佳[1] 

机构地区：[1]重庆师范大学,重庆401331

出　　处：《重庆科技学院学报（自然科学版）》2012年第4期157-159,共3页Journal of Chongqing University of Science and Technology：Natural Sciences Edition

基　　金：国家自然科学基金项目(11001289);重庆市教委科研项目(KJ100608)

摘　　要：在目标函数和约束函数是正则弱Lipschitz的情况下,构建一类多目标规划问题的混合对偶模型,并得到该模型的弱对偶定理、强对偶定理和逆对偶定理。In this paper,a class of nonsmooth invex multiobjective programming with equality and inequality constraints is considered, on the condition that the objective function and constraint function are regular weak Lipschitz functions. And the weak dual theorem ,strong dual theorem and converse dual theorem are obtained.

关 键 词：凸函数 非光滑规划 混和对偶 

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