%0 Journal Article
%T A Method for Solving Group Multiobjective Decision Problems<br>求解群体多目标决策问题的一种方法
%A MENG Zhi-qing
%A Hu Yu-da
%A HU Qi-ying
%A <br>孟志青
%A 胡毓达
%A 胡奇英
%J 系统工程理论与实践
%D 2006
%I 
%X This paper introduces a new concept called s-optimal coalition solutions for group multiobjective 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 programming.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 giving-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.
%K group decision
%K group multiobjective decisions
%K s-coalition solution
%K s-optimal coalition solution<br>群体决策
%K 群体多目标决策
%K s-平衡解
%K s-最优平衡解
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=7D84130F47A1D195&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=CB423C9A71560A74&eid=67969BA850333433&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=1&reference_num=22