摘要
给出了一个由分层解法得到的最优解一定是弱Pareto最优解,并且可以通过修改分层解法得到 的最优集得到一个Pareto最优解集.
The optimum solution obtained from hierarchical solution must be a weak pareto optimum solution. An optimum set is obtained from modified hierarchical solution, and from it a pareto optimum solution set is obtained.
出处
《吉林化工学院学报》
CAS
2003年第4期112-113,共2页
Journal of Jilin Institute of Chemical Technology
关键词
多目标规划
分层解法
PARETO最优解
动态规划
hierarchical solution
pareto optimum solution
dynamic programming
multi-objective programming
