摘要
本文提出了一种求解多目标规划问题的思路,其综合运用下包络点、帕雷托 拟合率等知识,去搜寻多目标规划问题的一组有效点且可逼近全部的有效点.
The paper combines the theories of multiple objective programming, Lower envelope point and Pareto fitnessvalue smoothly. It raises an idea for sieving multiple objective-programming to find a group of efficient points and to approach the whole of the efficient points.
出处
《应用数学与计算数学学报》
2004年第1期33-40,共8页
Communication on Applied Mathematics and Computation
关键词
多目标规划
下包络点
拟合率
帕雷托拟合率
multiple objective programming, efficient point, lower envelope point, pareto fitness value
