Logarithm Compatibility of Interval Multiplicative Preference Relations with an Application to Determining the Optimal Weights of Experts in the Group Decision Making |
| |
Authors: | Yulan Wang Huayou Chen Ligang Zhou |
| |
Affiliation: | 1. Department of Finance, Anhui Economic Management Institute, Hefei, 230059, China 2. Department of Mathematics, SUNY Canton, Canton, NY, 13617, USA 3. School of Mathematical Sciences, Anhui University, Hefei, 230601, Anhui, China
|
| |
Abstract: | We propose the new compatibility of interval multiplicative preference relations (IMPRs) in the group decision making (GDM) and apply it to determine the weights of experts. Firstly, we introduce the operation of interval numbers and define the new conception of logarithm compatibility degree of two interval multiplicative preference relations. Then, we prove the properties of logarithm compatibility of IMPR. It is pointed that if IMPR provided by every expert and its characteristic matrix are of acceptable compatibility, then the synthetic preference relation and the synthetic characteristic matrix are also of acceptable compatibility. Furthermore, we construct a mathematical programming model to determine the optimal weights of experts by minimizing the square logarithm compatibility in the GDM with IMPR and discuss the solution to the model. Finally, a numerical example is illustrated to show that the model is feasible. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|