数学毕业论文-浅谈多目标规划及解法_数学毕业论文_毕业论文网 关键词: 多目标规划；解决方法；弱有效解；算法 [gap=719]Keywords： multi-objective programming; solution; weak efficient solution; algorithm
基于42个网页-相关网页
cone-weak efficient solution 锥弱有效解
cone weak efficient solution 锥弱有效解
joint weak efficient solution 联合弱有效解
weak pareto efficient solution 弱pareto有效解
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.
把拟凹推广到锥拟凹，证明了锥弱有效解集仍是连通的。
An optimal boundary sequence method is introduced to find the weak efficient solution to a multi objective optimization problem.
引进了求解一类多目标优化问题弱有效解的优界数列方法，给出了这种优界数列的构造法及相应的算法。
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.
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
应用推荐