Pareto weakly efficient solution Pareto弱有效解
weakly efficient solution sets 弱有效解集
K-weakly efficient solution 锥弱有效解
local weakly efficient solution 局部弱有效解
cone weakly efficient solution 锥弱有效解
Generalized weakly efficient solution 广义弱有效解
joint cone weakly efficient solution 联合锥弱有效解
Similar results were generalized to multiobjective programming in Ref.37, and the equivalent conditions that every stationary point or Kuhn-Tucker point is a weakly efficient solution were also obtained.
文献37将类似的结果推广到多目标规划，并且获得了每个驻点(或K-T点)是弱有效解的等价条件。
参考来源 - 函数的广义凸性及其在数学规划中的应用·2,447,543篇论文数据，部分数据来源于NoteExpress
In this paper, we mainly consider the existence of the generalized weakly efficient solution for Vector Optimization Problem.
利用此定理，得到了带广义不等式约束的向量优化问题的最优性必要条件和充分条件。
Sub-weakly major efficient solution of multiobjective programming is introduced on the basis of weakly major efficient solution.
在多目标规划的 弱较多有效解的基础上，引进了它的次 弱较多有效解概念。
应用推荐