Pairwise comparison matrices play a prominent role in multiple-criteria decision-making, particularly in the analytic hierarchy process (AHP). Another form of preference modeling, called an incomplete pairwise comparison matrix, is considered when one or more elements are missing. In this paper, an algorithm is proposed for the optimal completion of an incomplete matrix. Our intention is to numerically minimize a maximum eigenvalue function, which is difficult to write explicitly in terms of variables, subject to interval constraints. Numerical simulations are carried out in order to examine the performance of the algorithm. The results of our simulations show that the proposed algorithm has the ability to solve the minimization of the constrained eigenvalue problem. We provided illustrative examples to show the simplex procedures obtained by the proposed algorithm, and how well it fills in the given incomplete matrices.

Constrained eigenvalue minimization of incomplete pairwise comparison matrices by Nelder-Mead algorithm / Tekile, Hailemariam Abebe; Fedrizzi, Michele; Brunelli, Matteo. - In: ALGORITHMS. - ISSN 1999-4893. - 14:8(2021), pp. 222.1-222.20. [10.3390/a14080222]

Constrained eigenvalue minimization of incomplete pairwise comparison matrices by Nelder-Mead algorithm

Tekile, Hailemariam Abebe;Fedrizzi, Michele;Brunelli, Matteo
2021

Abstract

Pairwise comparison matrices play a prominent role in multiple-criteria decision-making, particularly in the analytic hierarchy process (AHP). Another form of preference modeling, called an incomplete pairwise comparison matrix, is considered when one or more elements are missing. In this paper, an algorithm is proposed for the optimal completion of an incomplete matrix. Our intention is to numerically minimize a maximum eigenvalue function, which is difficult to write explicitly in terms of variables, subject to interval constraints. Numerical simulations are carried out in order to examine the performance of the algorithm. The results of our simulations show that the proposed algorithm has the ability to solve the minimization of the constrained eigenvalue problem. We provided illustrative examples to show the simplex procedures obtained by the proposed algorithm, and how well it fills in the given incomplete matrices.
8
Tekile, Hailemariam Abebe; Fedrizzi, Michele; Brunelli, Matteo
Constrained eigenvalue minimization of incomplete pairwise comparison matrices by Nelder-Mead algorithm / Tekile, Hailemariam Abebe; Fedrizzi, Michele; Brunelli, Matteo. - In: ALGORITHMS. - ISSN 1999-4893. - 14:8(2021), pp. 222.1-222.20. [10.3390/a14080222]
File in questo prodotto:
File Dimensione Formato  
Constrained Eigenvalue Minimization of Incomplete Pairwise.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Creative commons
Dimensione 416.04 kB
Formato Adobe PDF
416.04 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11572/313843
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact