一类不可微多目标规划的Kuhu-Tucker充分条件

On Kuhn-Tucker Sufficient Conditions for a Class of Nonsmooth Multiobjective Programing

本文对于不可微的多目标规划问题利用广义方向导数、广义梯度、半凸函数和正则拟凸函数的概念及理论,给出并证明了(MP)的有效解的Kuhn-Tucker充分条件及其推论。

This paper discusses the sufficient condition for a class of multiobjective programing. The authors propose and prove Kuhn-Tucher sufficient condition and its inference with conception: generalized gradient, semi-convex and regular guasiconvex.