Abstract
Pairwise comparison matrices (PCMs) are frequently used in different multicriteria decision making problems. A weight vector is said to be efficient if no other weight vector is at least as good in estimating the elements of the PCM, and strictly better in at least one position. Understanding the efficient weight vectors is crucial to determine the appropriate weight calculation technique for a given problem. In this paper we study the set of efficient weight vectors for three and four dimensions (alternatives) from a geometric viewpoint, which is a complementary to the algebraic approach used in the literature. Besides providing well-interpretable demonstrations, we also draw attention to the particular role of weight vectors calculated from spanning trees. Weight vectors corresponding to line graphs are vertices of the (polyhedral, but usually nonconvex) set of efficient weight vectors, while weight vectors corresponding to other spanning trees are also on the boundary.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
