Inverse Gram Matrix Methods for Prioritization in Analytic Hierarchy Process: Explainability of Weighted Least Squares Optimization Method

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Yuen, Kevin Kam Fung
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913183054168064
author Yuen, Kevin Kam Fung
author_facet Yuen, Kevin Kam Fung
contents This paper proposes Inverse Gram Matrix (IGM) methods to prioritize the Pairwise Reciprocal Matrix (PRM) in the Analytic Hierarchy Process. The IGM methods include Pseudo-IGM, Normalized-IGM, and Lagrange-IGM. Interestingly, the proposed IGM methods achieves the least error of Weighted Least Squares (WLS). Since clarity, explainability, usability and verification for the close-form solutions of WLS appears to be incomplete in the literature, the comprehensive mathematical proofs, detail computational demonstration, and intensive simulation verification to extend the prior studies are offered in this study. After a simulation of 1,000,000 random PRM instances is performed to verify equivalent results of several IGM methods, another simulation of 10,000 random PRM instances are performed to verify that a IGM method is the exact closed-form solution of WLS optimization method. The proposed IGM methods on top of the WLS method may be the promising alternatives of Saaty's Eigen system method to apply to the AHP.
format Preprint
id arxiv_https___arxiv_org_abs_2401_01190
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Inverse Gram Matrix Methods for Prioritization in Analytic Hierarchy Process: Explainability of Weighted Least Squares Optimization Method
Yuen, Kevin Kam Fung
Optimization and Control
This paper proposes Inverse Gram Matrix (IGM) methods to prioritize the Pairwise Reciprocal Matrix (PRM) in the Analytic Hierarchy Process. The IGM methods include Pseudo-IGM, Normalized-IGM, and Lagrange-IGM. Interestingly, the proposed IGM methods achieves the least error of Weighted Least Squares (WLS). Since clarity, explainability, usability and verification for the close-form solutions of WLS appears to be incomplete in the literature, the comprehensive mathematical proofs, detail computational demonstration, and intensive simulation verification to extend the prior studies are offered in this study. After a simulation of 1,000,000 random PRM instances is performed to verify equivalent results of several IGM methods, another simulation of 10,000 random PRM instances are performed to verify that a IGM method is the exact closed-form solution of WLS optimization method. The proposed IGM methods on top of the WLS method may be the promising alternatives of Saaty's Eigen system method to apply to the AHP.
title Inverse Gram Matrix Methods for Prioritization in Analytic Hierarchy Process: Explainability of Weighted Least Squares Optimization Method
topic Optimization and Control
url https://arxiv.org/abs/2401.01190