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

The Mixed Dual for a Class of Nonsmooth Invex Programming Problems

在目标函数和约束函数是正则弱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.