Abstract
Abstract Pairwise comparison matrices are of key importance in multi-attribute decision analysis. A matrix is incomplete if some of the elements are missing. The eigenvector method, to derive the weights of criteria, can be generalized for the incomplete case by using the least inconsistent completion of the matrix. If inconsistency is indexed by CR, defined by Saaty, it leads to the minimization of the Perron eigenvalue. This problem can be transformed to a convex optimization problem. The paper presents a method based on the Newton iteration, univariate and multivariate. Numerical examples are also given.
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.
