凸多目标规划弱有效解的几个充要条件

Several Sufficient and Necessary Conditionsabout the Weak Efficient Solution forConvex Multiobjective Programming

在无约束规定的条件下,利用向量值函数的泰勒公式、择一定理,证明了约束多目标规划弱有效解满足的几个充要条件。将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。

The paper introduced the use of the Taylor formula of the vector-valued function and Gordan Selection principle to prove several sufficient and necessary conditions about the weak efficient solution for convex multiobjective programming. The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution.