数学毕业论文-浅谈多目标规划及解法_数学毕业论文_毕业论文网 关键词: 多目标规划；解决方法；弱有效解；算法 [gap=719]Keywords： multi-objective programming; solution; weak efficient solution; algorithm
基于56个网页-相关网页
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点)是弱有效解的等价条件。
参考来源 - 函数的广义凸性及其在数学规划中的应用Finally, in linear space, the conscepts of F-J saddle point and K-T saddle point are defined, the relations between them and weak efficient solution of vector extremum problems with generalized inequality constraint are discussed.
然后,在序线性空间中引入F-J鞍点、K-T鞍点,讨论了它们与带广义不等式约束的向量极值问题的弱有效解之间的关系。
参考来源 - 抽象空间中向量极值问题的最优性条件和Lagrange对偶·2,447,543篇论文数据，部分数据来源于NoteExpress
把拟凹推广到锥拟凹，证明了锥弱有效解集仍是连通的。
The quasiconcave was extended to the cone-quasiconcave, and the cone weak efficient solution set was still connected.
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
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.
系统地讨论了集函数多目标分式规划的弱有效解、有效解和真有效解的基本定理。
Systematically discusses the fundamental theorems of weak efficient solution, efficient solution and properly efficient solution for multiobjective fractional programming problems with set functions.
应用推荐