求解群体多目标决策问题的一种方法  

A Method for Solving Group Multiobjective Decision Problems

作　　者：孟志青[1] 胡毓达[2] 胡奇英[3] 

机构地区：[1]浙江工业大学经贸管理学院,浙江杭州310023 [2]温州大学数学与信息科学院,浙江温州325027 [3]上海大学国际工商与管理学院,上海201800

出　　处：《系统工程理论与实践》2006年第6期69-74,共6页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(70271021)

摘　　要：引进了群体多目标决策问题的一种新的最优解概念──s-最优平衡解,它的实际意义是对于每个决策者而言在每个目标下都给出一个让步值.证明了求解s-最优平衡解等价于求解一个对应的单目标优化问题,并在一定条件下s-最优平衡解总是存在的.讨论了具有不同让步值的s-最优平衡解.数值例子表明这个方法对解决群体多目标决策问题具有一定的有效性.This paper introduces a new concept called s-optimal coalition solutions for group mulfiobjecfive decision problems （GMDP）, where s is a nonnegative constant. Its practical meaning is to achieve the optimality within a same value in each objective for each decision maker. This value is called the giving-up value . We show that to solve s-optimal coalition solutions is equivalent to solve a single objective progrsmming. Based on this, we easily prove the existence of s-optimal coalition solutions under some conditions. We also discuss s-optimal coalition solutions when the givlng-up value is a vector, i.e., the value in each objective is different. Numerical examples illustrate that the method presented here is efficient for GMDP. This paper presents a new way to solve the group multiobjective decision problems.

关 键 词：群体决策 群体多目标决策 s-平衡解 s-最优平衡解 

分 类 号：C934[经济管理—管理学]