arXiv · 1505.01903
An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections
Abstract
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is the required consistent approximation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
W. W. Koczkodaj, M. Orlowski. 2015-05-08. An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections. https://doi.org/10.1016/s0898-1221(97)00205-8
Cite the original work for its findings. Save a collection to share your selection of sources.