广义B-次凸多目标规划的最优性条件

The optimality conditions of the multi objective programming under generation B-subconvex functions

在B-凸函数和广义次凸函数的基础上引进了一类新的函数广义B-次凸函数,研究了这类函数的性质,证明了择一定理,并在此基础上得到了鞍点最优性条件.

Based on B-vex and generalized subconvex function, a new class of generalized B-subconvex function is introduced. The properties are studied, the alternative theory is proved, and the saddle-point type optimality criteria is proved.