(G-V)不变凸多目标规划的最优性条件

Optimality Conditions for Multi-obejective Programming Problems with(G-V)Invex Function

最优性条件是最优性理论中的重要内容,利用局部Lipschitz函数,在(G-V)不变凸函数的基础上,定义了(G-V)不变拟凸函数、(G-V)不变伪凸函数,研究了涉及此类函数的非光滑多目标规划问题,得到了几个最优性充分条件,在更弱的凸性下推广了已有结论。

The optimality conditions is an important content in the Optimality theory.By the locally Lipschitz function,(G-V)quasi-invex function and(G-V)pseudo-invex function are defined on the basis of(G-V)invex function.The problem of nonsmooth multiobjective programming involving such functions are studieds.Several optimality sufficient conditions are obtained.The existing conclusions are generalized under weaker convexity.