A goal programming model for incomplete interval multiplicative preference relations and its application in group decision-making

被引:97
|
作者
Liu, Fang [1 ,2 ]
Zhang, Wei-Guo [1 ]
Wang, Zhong-Xing [2 ]
机构
[1] S China Univ Technol, Sch Business Adm, Guangzhou 510641, Guangdong, Peoples R China
[2] Guangxi Univ, Sch Math & Informat Sci, Nanning 530004, Guangxi, Peoples R China
关键词
Goal programming model; Consistency; Group decision-making; Incomplete interval multiplicative preference relation; IWGA operator; ANALYTIC HIERARCHY PROCESS; COMPARISON MATRICES; ADDITIVE CONSISTENCY; PRIORITY DERIVATION; CONSENSUS MODEL; INFORMATION; WEIGHTS; ARTICULATION; OPTIMIZATION; JUDGMENTS;
D O I
10.1016/j.ejor.2011.11.042
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In decision making problems, there may be the cases where the decision makers express their judgements by using preference relations with incomplete information. Then one of the key issues is how to estimate the missing preference values. In this paper, we introduce an incomplete interval multiplicative preference relation and give the definitions of consistent and acceptable incomplete ones, respectively. Based on the consistency property of interval multiplicative preference relations, a goal programming model is proposed to complement the acceptable incomplete one. A new algorithm of obtaining the priority vector from incomplete interval multiplicative preference relations is given. The goal programming model is further applied to group decision-making (GDM) where the experts evaluate their preferences as acceptable incomplete interval multiplicative preference relations. An interval weighted geometric averaging (IWGA) operator is proposed to aggregate individual preference relations into a social one. Furthermore, the social interval multiplicative preference relation owns acceptable consistency when every individual one is acceptably consistent. Two numerical examples are carried out to show the efficiency of the proposed goal programming model and the algorithms. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:747 / 754
页数:8
相关论文
共 50 条