یک مدل برنامه نویسی آرمانی برای روابط ترجیح ضرب فاصله ناقص و کاربرد آن در تصمیم گیری گروهی ☆
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|78497||2012||8 صفحه PDF||سفارش دهید||6986 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : European Journal of Operational Research, Volume 218, Issue 3, 1 May 2012, Pages 747–754
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.