摘要
本文拓广了多目标规划的最弱有效解,建立了最弱有效解的若干充分条件和必要条件;并利用最弱有效解对多目标数学规划解集之间的关系作了深入探讨,得到了实用范围更为广泛的一些结果。
This paper popularizes the weakest efficient solution to the multiobjective mathematical programming, sets up several new sufficient conditions and necessary conditions. Besides, this paper discusses the relation between solution sets for multiobjective mathematical solutions and gets some more practicable results.
关键词
有效解
数学规划
最弱有效解
efficient solution
weaker efficient solution
the weakest efficient solution
