摘要
对一般意义上的灰色多目标规划,提出客观确定子目标权重的方法及修正方法,利用子目标的权重引入各个子目标取最优值的白化权函数,构建灰色多目标规划有效解及其θ定位规划最优解的算法。文中的算例说明了算法的可行性与有效性。
This paper put forward an objective method to determine weights of sub-objectives and a modifying method for (grey) multi-objective programming. Using weights of sub-objects, it also introduced a whitenization weight function of those sub-objects to obtain their optimal values. As a result of this study, the paper constructed algorithms to obtain effective (solution) to grey multi-objective programming and optimal solution to the θ-positioned programming. Finally, a numerical (example) was given to show the feasibility and effectiveness of the algorithms.
出处
《系统工程》
CSCD
北大核心
2004年第6期12-15,共4页
Systems Engineering
基金
国家自然科学基金资助项目(10071074)
江苏省自然科学基金重点资助项目(BK2003211)
河南省教育厅科研基金资助项目(2003120012)
关键词
灰色多目标规划
算法
白化权函数
Grey Multiple Objective Programming
Algorithm
Whitenization Weight Function
