Efficient vectors for double perturbed consistent matrices
From MaRDI portal
Publication:6062855
DOI10.1080/02331934.2022.2070067zbMath1526.90022OpenAlexW4229037319WikidataQ114100898 ScholiaQ114100898MaRDI QIDQ6062855
Publication date: 6 November 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2070067
Decision theory (91B06) Management decision making, including multiple objectives (90B50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Inferring efficient weights from pairwise comparison matrices
- A scaling method for priorities in hierarchical structures
- A common framework for deriving preference values from pairwise comparison matrices
- Inconsistency of special cases of pairwise comparisons matrices
- Efficient weight vectors from pairwise comparison matrices
- Decision-making with the AHP: Why is the principal eigenvector necessary
- Transitive matrices and their applications
- Efficient vectors for simple perturbed consistent matrices
- Efficiency of the principal eigenvector of some triple perturbed consistent matrices
- Reciprocal matrices: properties and approximation by a transitive matrix
- Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency
- Efficiency Analysis of Simple Perturbed Pairwise Comparison Matrices
- EFFECTIVENESS ANALYSIS OF DERIVING PRIORITY VECTORS FROM RECIPROCAL PAIRWISE COMPARISON MATRICES
- Matrix Analysis
- Comparison of eigenvalue, logarithmic least squares and least squares methods in estimating ratios
- Consistency adjustments for pairwise comparison matrices
This page was built for publication: Efficient vectors for double perturbed consistent matrices