首页 | 本学科首页   官方微博 | 高级检索  
     

几何加权法求解多目标规划问题
引用本文:乔辰,张国立. 几何加权法求解多目标规划问题[J]. 华北电力大学学报(自然科学版), 2011, 38(6): 107-110
作者姓名:乔辰  张国立
作者单位:华北电力大学数理学院,河北保定,071003
摘    要:多目标规划的目标函数相互冲突,一般不存在最优解,因此求其非劣解具有重要意义.采用几何加权法提出了一种新的评价函数,通过这种评价函数将多目标规划的目标函数转化为单目标函数,并证明了该方法得到的最优解是多目标规划问题的非劣解.通过算例,比较了线性加权法,极大极小法,几何加权法.结果表明,几何加权法是可行的;通过几何加权法能...

关 键 词:多目标规划  评价函数  几何加权法  非劣解

Geometric weighting method for solving multi-objective programming problems
QIAO Chen , ZHANG Guo-li. Geometric weighting method for solving multi-objective programming problems[J]. Journal of North China Electric Power University, 2011, 38(6): 107-110
Authors:QIAO Chen    ZHANG Guo-li
Abstract:The objective functions of multi-objective programming are conflict,there is generally has no optimized solution,so how to get its non-inferior solutions is of great importance.Using geometric weighting method proposed a new evaluation function,with this evaluation function can turn the multi-objective programming to the single objective programming,and It has proved that the solution obtained on geometric weighting method is non-inferior solution on multi-objective programming.Comparing three methods,that the linear weighting method,min-max method and the geometric weighting method,through an example.The results show that geometric weighting method is feasible and using geometric weighting method can obtain non-inferior solutions of the original problem,and when the weights change,the geometric weighting results more practical than the linear weighting method.
Keywords:multi-objective programming  evaluate function  geometric weighting method  non-inferior solutions
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号