Journal
APPLIED SOFT COMPUTING
Volume 80, Issue -, Pages 712-722Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2019.04.036
Keywords
Probabilistic linguistic preference relation; Multiple stakeholders; Large-scale group decision making; Expected multiplicative consistency; Mathematical programming
Categories
Funding
- National Natural Science Foundation of China [71601032]
Ask authors/readers for more resources
A large number of stakeholders take part in the process of decision making, namely, large-scale group decision making (LGDM) problems. Every stakeholder utilises a linguistic preference relation (LPR) to represent her/his preference information for alternatives. Then, a probabilistic LPR (PLPR) is established to represent the group preference. However, some stakeholders may only provide partial preference information about the alternatives. Thus, a PLPR with incomplete probabilities can be used to manage LGDM problems in complex environments. Based on the defined expected multiplicative consistency of PLPR, a probability computation model is established by mathematical programming to derive the missing probabilities of PLPR. In addition, an iterative algorithm to improve the consistency is proposed to obtain the PLPR with satisfactory consistency. Finally, a real-world investment decision-making problem with multiple stakeholders is solved to demonstrate the effectiveness of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available