.png){kind=icon}
返回
Efficient weight vectors from pairwise comparison matrices
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2017.06.033.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and strictly better in at least one position. A weight vector is weakly efficient if the pairwise ratios cannot be improved in all non-diagonal positions. We show that the principal eigenvector is always weakly efficient, but numerical examples show that it can be inefficient. The linear programs proposed test whether a given weight vector is (weakly) efficient, and in case of (strong) inefficiency, an efficient (strongly) dominating weight vector is calculated. The proposed algorithms are implemented in Pairwise Comparison Matrix Calculator, available at pcmc.online. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Multiple criteria analysis
Pairwise comparison matrix
Pareto optimality
Efficiency
Linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
On the priority vector associated with a reciprocal relation and a pairwise comparison matrix.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容