A method for approximating pairwise comparison matrices by consistent matrices
From MaRDI portal
Publication:956601
DOI10.1007/S10898-008-9303-0zbMATH Open1191.90044OpenAlexW1964607439MaRDI QIDQ956601FDOQ956601
Authors: János Fülöp
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
Recommendations
- Weights from the least squares approximation of pairwise comparison matrices
- scientific article; zbMATH DE number 6026955
- On pairwise comparison matrices that can be made consistent by the modification of a few elements
- An orthogonal basis for computing a consistent approximation to a pairwise comparison matrix
- An exact global optimization method for deriving weights from pairwise comparison matrices
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- A note on the analysis of subjective judgement matrices
- A scaling method for priorities in hierarchical structures
- Title not available (Why is that?)
- A Goal Programming Method for Generating Priority Vectors
- Data perturbations of matrices of pairwise comparisons
- Convex analysis and global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- On the optimal consistent approximation to pairwise comparison matrices
- A common framework for deriving preference values from pairwise comparison matrices
- A fuzzy programming method for deriving priorities in the analytic hierarchy process
- A statistical approach to Saaty's scaling method for priorities
- A multicriteria evaluation of methods for obtaining weights from ratio- scale matrices
- A method for solving LSM problems of small size in the AHP
- 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
- Weights from the least squares approximation of pairwise comparison matrices
- Consistency adjustments for pairwise comparison matrices
- Deriving weights in multiple-criteria decision making with support vector machines
- Approaches to consistency adjustment
- A comparison of two methods for determining the weights of belonging to fuzzy sets
- Title not available (Why is that?)
- Singular value decomposition in AHP.
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Title not available (Why is that?)
Cited In (27)
- Title not available (Why is that?)
- A general unified framework for interval pairwise comparison matrices
- Deriving priorities from inconsistent PCM using network algorithms
- Checking and adjusting order-consistency of linguistic pairwise comparison matrices for getting transitive preference relations
- An orthogonal basis for computing a consistent approximation to a pairwise comparison matrix
- Title not available (Why is that?)
- An \(NC^ 2\) algorithm for testing similarity of matrices
- Consistent clustering of entries in large pairwise comparison matrices
- Consistency adjustments for pairwise comparison matrices
- On pairwise comparison matrices that can be made consistent by the modification of a few elements
- On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures
- Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
- Transitive approximation to pairwise comparison matrices by using interval goal programming
- Solution of the least squares method problem of pairwise comparison matrices
- On the optimal consistent approximation to pairwise comparison matrices
- Efficient weight vectors from pairwise comparison matrices
- Weights from the least squares approximation of pairwise comparison matrices
- Computing a consistent approximation to a generalized pairwise comparisons matrix
- Efficient vectors for simple perturbed consistent matrices
- Deriving consistent pairwise comparison matrices in decision making methodologies based on linear programming method
- Efficiency of the principal eigenvector of some triple perturbed consistent matrices
- AHP based on scenarios and the optimism coefficient for new and risky projects: case of independent criteria
- Consistency and consensus improving methods for pairwise comparison matrices based on abelian linearly ordered group
- On the spectrum of pairwise comparison matrices
- An exact global optimization method for deriving weights from pairwise comparison matrices
- Title not available (Why is that?)
- On some convexity properties of the least squares method for pairwise comparisons matrices without the reciprocity condition
Uses Software
This page was built for publication: A method for approximating pairwise comparison matrices by consistent matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q956601)