A method for approximating pairwise comparison matrices by consistent matrices
From MaRDI portal
Publication:956601
DOI10.1007/s10898-008-9303-0zbMath1191.90044OpenAlexW1964607439MaRDI QIDQ956601
Publication date: 25 November 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9303-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (9)
On some convexity properties of the least squares method for pairwise comparisons matrices without the reciprocity condition ⋮ Efficient weight vectors from pairwise comparison matrices ⋮ Deriving priorities from inconsistent PCM using network algorithms ⋮ On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures ⋮ Checking and adjusting order-consistency of linguistic pairwise comparison matrices for getting transitive preference relations ⋮ Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem ⋮ Solution of the least squares method problem of pairwise comparison matrices ⋮ Efficient vectors for simple perturbed consistent matrices ⋮ Efficiency of the principal eigenvector of some triple perturbed consistent matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deriving weights in multiple-criteria decision making with support vector machines
- A statistical approach to Saaty's scaling method for priorities
- A note on the analysis of subjective judgement matrices
- Approaches to consistency adjustment
- A scaling method for priorities in hierarchical structures
- A comparison of two methods for determining the weights of belonging to fuzzy sets
- A multicriteria evaluation of methods for obtaining weights from ratio- scale matrices
- On the optimal consistent approximation to pairwise comparison matrices
- Singular value decomposition in AHP.
- A method for solving LSM problems of small size in the AHP
- A common framework for deriving preference values from pairwise comparison matrices
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An exact global optimization method for deriving weights from pairwise comparison matrices
- Solving the least squares method problem in the AHP for \(3 \times 3\) and \(4\times 4\) matrices
- A fuzzy programming method for deriving priorities in the analytic hierarchy process
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- A Goal Programming Method for Generating Priority Vectors
- Consistency adjustments for pairwise comparison matrices
- Convex analysis and global optimization
- Data perturbations of matrices of pairwise comparisons
This page was built for publication: A method for approximating pairwise comparison matrices by consistent matrices
