.png){kind=icon}
返回
Efficient vectors for simple perturbed consistent matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2021.09.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the Analytic Hierarchy process, a method used in Decision Making, it may be important to approximate a pairwise comparison matrix (PC matrix) by a consistent one. In this context, the notion of efficient vector for a PC matrix arises. In this paper we describe all efficient vectors for an n x n comparison pairwise matrix obtained from a consistent one by perturbing one entry above the main diagonal, and the corresponding reciprocal entry. As a consequence, we give a simple proof of the result obtained by K. Abele-Nagy and S. Bozoki (2016) that states that the principal eigenvector of a simple perturbed consistent matrix is efficient. In addition, we consider a set of non-efficient vectors associated with the simple perturbed consistent matrix and describe all the efficient vectors that dominate each vector in that set. (C) 2021 Elsevier Inc. All rights reserved.
Keyword:
Decision-making
Consistent matrix
Pairwise comparison matrix
Vector efficiency
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
Synthesis and Magnetic Behavior of Nickel Zinc Ferrite Nanoparticles Coated Onto Carbon Microcoils
PREAI
分享收藏
查看更多内容