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

求群体多目标决策问题的一种可行方向交互算法
引用本文:秦志林. 求群体多目标决策问题的一种可行方向交互算法[J]. 经济数学, 2002, 19(4): 20-29
作者姓名:秦志林
作者单位:南通工学院应用数学系,南通,226007
基金项目:Project Supported by The National Nature Science Foundation of China(70 0 71 0 2 6)
摘    要:对于群体多目标决策问题,决策者可以各自的关于目标之间的权衡比表达其偏爱信息并进行决策.当个体权衡比具有加性性质时可得群体权衡比.本文以此构造一种求解群体非线性规划问题的交互算法.迭代中基于求解决非线性规划的Topkis-Veinott方法构造可行方向.在一定的条件下,算法收敛于所讨论问题的群体满意解.

关 键 词:多目标规划  群体决策  交互算法

A FEASIBLE DIRECTION INTERACTIVE ALGORITHM FOR MULTIOBJECTIVE GROUP DECISION-MAKING PROBLEMS
Abstract. A FEASIBLE DIRECTION INTERACTIVE ALGORITHM FOR MULTIOBJECTIVE GROUP DECISION-MAKING PROBLEMS[J]. Mathematics in Economics, 2002, 19(4): 20-29
Authors:Abstract
Abstract:For a multiobjective group decision-making problem,decsison-makers may make dccisions with respective preferences by trade-off ratios amongst objectives.As these ratios are subject to a joint assessment by these deciston-makers,a group trade-off ratio may be obtained.Successfully,an interactive algorithm is developed for solving multiobjective nonlinear programming pro blems with a grou pof decision-makers in this paper.The feasible direction in iteration step of algorithm is constructed on the basis of Topkis-Veinott method for solving nonlinear programming problems.Under certain conditions,the alhorithm converges to a group satisfactory solution of discusse dproblem.
Keywords:Multiobjective programming  group decision-making  interactive algorithm.
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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