{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:13:52Z","timestamp":1771697632852,"version":"3.50.1"},"reference-count":64,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/a14080222","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:07:40Z","timestamp":1626998860000},"page":"222","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Constrained Eigenvalue Minimization of Incomplete Pairwise Comparison Matrices by Nelder-Mead Algorithm"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9284-7799","authenticated-orcid":false,"given":"Hailemariam Abebe","family":"Tekile","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, University of Trento, 38123 Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5925-6674","authenticated-orcid":false,"given":"Michele","family":"Fedrizzi","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Trento, 38123 Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4291-2150","authenticated-orcid":false,"given":"Matteo","family":"Brunelli","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Trento, 38123 Trento, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"ref_1","unstructured":"Hammond, J.S., Keeney, R.L., and Raiffa, H. (1999). Smart Choices: A Practical Guide to Making Better Decisions, Harvard Business School Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0022-2496(77)90033-5","article-title":"A scaling method for priorities in hierarchical structures","volume":"15","author":"Saaty","year":"1977","journal-title":"J. Math. Psychol."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Saaty, T.L. (1980). The Analytic Hierarchy Process, McGraw-Hill.","DOI":"10.21236\/ADA214804"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TSMC.1979.4310245","article-title":"Decisions with Multiple Objectives: Preferences and Value Trade-Offs","volume":"9","author":"Keeney","year":"1979","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.omega.2014.11.009","article-title":"Best-worst multi-criteria decision-making method","volume":"53","author":"Rezaei","year":"1977","journal-title":"Omega"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Figueira, J.R., Mousseau, V., and Roy, B. (2016). ELECTRE methods. Multiple Criteria Decis. Anal., 155\u2013185.","DOI":"10.1007\/978-1-4939-3094-4_5"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"11419","DOI":"10.1007\/s00500-019-04109-w","article-title":"PROMETHEE for prioritized criteria","volume":"23","author":"Qi","year":"2019","journal-title":"Soft Comput."},{"key":"ref_8","unstructured":"Figueira, J., Greco, S., and Ehrgott, M. (2005). On the Mathematical Foundations of MACBETH in Multiple Criteria Decision Analysis: State of the Art Surveys, The London School of Economics and Political Science."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/mcda.428","article-title":"A new method for scoring additive multi-attribute value models using pairwise rankings of alternatives","volume":"15","author":"Hansen","year":"2008","journal-title":"J. Multiple Criteria Decis. Anal."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.ejor.2005.09.022","article-title":"A revised framework for deriving preference values from pairwise comparison matrices","volume":"176","author":"Lin","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/0270-0255(87)90503-3","article-title":"Incomplete pairwise comparisons in the Analytic Hierarchy Process","volume":"9","author":"Harker","year":"1987","journal-title":"Math. Model."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.5109\/13511","article-title":"On a maximization problem arising from a positive reciprocal matrix in AHP","volume":"34","author":"Shiraishi","year":"2002","journal-title":"Bull. Inform. Cybern."},{"key":"ref_13","first-page":"404","article-title":"Properties of a positive reciprocal matrix and their application to AHP","volume":"41","author":"Shiraishi","year":"1998","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1515\/ausi-2015-0012","article-title":"Minimization of the Perron eigenvalue of incomplete pairwise comparison matrices by Newton iteration","volume":"7","year":"2015","journal-title":"Acta Univ. Sapientiae Inform."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.mcm.2010.02.047","article-title":"On optimal completion of incomplete pairwise comparison matrices","volume":"52","year":"2010","journal-title":"Math. Comput. Model."},{"key":"ref_16","first-page":"137","article-title":"Gradient Descent Method for Perron Eigenvalue Minimization of Incomplete Pairwise Comparison Matrices","volume":"7","author":"Tekile","year":"2019","journal-title":"Int. J. Math. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1080\/03081079.2018.1523156","article-title":"A survey of inconsistency indices for pairwise comparisons","volume":"47","author":"Brunelli","year":"2015","journal-title":"Int. J. Gen. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ejor.2006.09.065","article-title":"Incomplete pairwise comparison and consistency optimization","volume":"183","author":"Fedrizzi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.cam.2015.05.023","article-title":"Consistent completion of incomplete judgments in decision making using AHP","volume":"290","author":"Izquierdo","year":"2015","journal-title":"J. Comput. Appl. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.apm.2015.04.047","article-title":"Estimating the missing values for the incomplete decision matrix and consistency optimization in emergency management","volume":"40","author":"Ergu","year":"2016","journal-title":"Appl. Math. Model."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1007\/s10479-018-2769-3","article-title":"A DEMATEL-based completion method for incomplete pairwise comparison matrix in AHP","volume":"271","author":"Zhou","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ku\u0142akowski, K. (2020). On the geometric mean method for incomplete pairwise comparisons. Mathematics, 8.","DOI":"10.3390\/math8111873"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.5267\/j.dsl.2019.1.002","article-title":"Incomplete pairwise comparative judgments: Recent developments and a proposed method","volume":"8","author":"Alrasheedi","year":"2019","journal-title":"Decis. Sci. Lett."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Brunelli, M., Fedrizzi, M., and Giove, S. (2007). Reconstruction methods for incomplete fuzzy preference relations: A numerical comparison. Int. Workshop Fuzzy Log. Appl., 86\u201393.","DOI":"10.1007\/978-3-540-73400-0_11"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0270-0255(87)90492-1","article-title":"Alternative modes of questioning in the Analytic Hierarchy process","volume":"9","author":"Harker","year":"1987","journal-title":"Math. Model."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ins.2014.12.061","article-title":"Managing incomplete preference relations in decision making: A review and future trends","volume":"302","author":"Chiclana","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(93)90164-I","article-title":"Preference simulation and preference programming: Robustness issues in priority derivation","volume":"69","author":"Arbel","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0377-2217(87)90275-X","article-title":"Uncertainty and rank order in the Analytic Hierarchy Process","volume":"32","author":"Saaty","year":"1987","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1287\/opre.40.6.1053","article-title":"Preference assessment by imprecise ratio statements","volume":"40","author":"Salo","year":"1992","journal-title":"Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.cie.2021.107215","article-title":"Eigenvector driven interval priority derivation and acceptability checking for interval multiplicative pairwise comparison matrices","volume":"156","author":"Wang","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Obata, T., and Shunsuke, S. (2021). Computational study of characteristic polynomial of 4th order PCM in AHP. Bull. Inform. Cybern., 1\u201312.","DOI":"10.5109\/4372243"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S0218488506004114","article-title":"Consistency in the Analytic Hierarchy Process: A new approach","volume":"14","author":"Alonso","year":"2006","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","article-title":"A simplex method for function minimization","volume":"7","author":"Nelder","year":"1965","journal-title":"Comput. J."},{"key":"ref_34","unstructured":"D\u2019Errico, J. (2021, February 16). Fminsearchbnd, Fminsearchcon File Exchange\u2014MATLAB Central. Available online: https:\/\/it.mathworks.com\/matlabcentral\/fileexchange\/8277-fminsearchbnd-fminsearchcon."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/0305215X.2011.598520","article-title":"A constrained optimization algorithm based on the simplex search method","volume":"44","author":"Mehta","year":"2012","journal-title":"Eng. Optim."},{"key":"ref_36","unstructured":"Oldenhuis, R. (2021, May 16). Optimize. MathWorks File Exchange. Available online: https:\/\/it.mathworks.com\/matlabcentral\/fileexchange\/24298-minimize."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Murray, W., and Wright, M.H. (2019). Practical Optimization, SIAM.","DOI":"10.1137\/1.9781611975604"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Tepljakov, A. (2017). Fractional-Order Modeling and Control of Dynamic Systems, Springer.","DOI":"10.1007\/978-3-319-52950-9"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","article-title":"Convergence properties of the Nelder-Mead simplex method in low dimensions","volume":"9","author":"Lagarias","year":"1998","journal-title":"SIAM J. Optim."},{"key":"ref_40","unstructured":"Nocedal, J., and Wright, S. (2006). Numerical Optimization, Springer Science & Business Media. [2nd ed.]."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"2928","DOI":"10.4249\/scholarpedia.2928","article-title":"Nelder-Mead algorithm","volume":"4","author":"Singer","year":"2009","journal-title":"Scholarpedia"},{"key":"ref_42","unstructured":"Wright, M. (1996). Direct search methods: Once scorned, now respectable. Numerical Analysis: Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, Addison-Wesley."},{"key":"ref_43","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. (1992). Numerical Recipes in C: The Art of Scientific Computing, University of Cambridge. [2nd ed.]."},{"key":"ref_44","unstructured":"The MathWorks, Inc. (2021, May 16). MATLAB\u2019s Fminsearch Documentation. Available online: https:\/\/it.mathworks.com\/help\/optim\/ug\/fminsearch-algorithm.html."},{"key":"ref_45","unstructured":"Kochenderfer, M.J., and Wheeler, T.A. (2019). Algorithms for Optimization, MIT Press."},{"key":"ref_46","unstructured":"Weisstein, E.W. (2021, July 16). \u201cNelder-Mead Method.\u201d From MathWorld\u2014A Wolfram Web Resource. Available online: https:\/\/mathworld.wolfram.com\/Nelder-MeadMethod.html."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/S1052623497315203","article-title":"Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition","volume":"10","author":"Kelley","year":"1999","journal-title":"SIAM J. Optim."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","article-title":"Implementing the Nelder-Mead simplex algorithm with adaptive parameters","volume":"51","author":"Gao","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1137\/110830150","article-title":"Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions","volume":"22","author":"Lagarias","year":"2012","journal-title":"SIAM J. Optim."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/S1052623496303482","article-title":"Convergence of the Nelder-Mead Simplex method to a nonstationary Point","volume":"176","author":"McKinnon","year":"1998","journal-title":"SIAM J. Optim."},{"key":"ref_51","unstructured":"Singer, S., and Singer, S. Complexity analysis of Nelder-Mead search iterations. Proceedings of the 1. Conference on Applied Mathematics and Computation."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1002\/anac.200410015","article-title":"Efficient implementation of the Nelder-Mead search algorithm","volume":"1","author":"Singer","year":"2004","journal-title":"Appl. Numer. Anal. Comput. Math."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TEVC.2005.850256","article-title":"Constrained optimization by applying the \u03b1 constrained method to the nonlinear simplex method with mutations","volume":"9","author":"Takahama","year":"2005","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000, January 5\u20139). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the International Conference on Parallel Problem Solving from Nature, Leiden, The Netherlands.","DOI":"10.1007\/3-540-45356-3_83"},{"key":"ref_55","unstructured":"Pham, D., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., and Zaidi, M. (2005). The Bees Algorithm, Manufacturing Engineering Centre, Cardiff University. Technical Note."},{"key":"ref_56","unstructured":"Baudin, M., and Nelder-Mead User\u2019s Manual (2020, October 15). Consortium Scilab-Digiteo. Available online: http:\/\/forge.scilab.org\/upload\/docneldermead\/files\/neldermead.pdf."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Kelley, C.T. (1999). Iterative Methods for Optimization, SIAM.","DOI":"10.1137\/1.9781611970920"},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5109\/4362571","article-title":"Some remarks on the maximum eigenvalue of 3rd order pairwise comparison matrices in AHP","volume":"53","author":"Shiraishi","year":"2021","journal-title":"Obata Bull. Inform. Cybern."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"4449","DOI":"10.1016\/j.apm.2011.03.013","article-title":"Achieving matrix consistency in AHP through linearization","volume":"35","author":"Izquierdo","year":"2011","journal-title":"Appl. Math. Model."},{"key":"ref_60","unstructured":"Byatt, D. (2000). Convergent Variants of the Nelder-Mead Algorithm. [Master\u2019s Thesis, University of Canterbury]."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1014849028575","article-title":"A convergent variant of the Nelder-Mead algorithm","volume":"113","author":"Price","year":"2002","journal-title":"J. Optim. Theory Appl."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Forbes, C., Evans, M., Hastings, N., and Peacock, B. (2011). Statistical Distributions, John Wiley & Sons, Inc.. [4th ed.].","DOI":"10.1002\/9780470627242"},{"key":"ref_63","unstructured":"\u00c1goston, K.C., and Csat\u00f3, L. (2021). Extension of Saaty\u2019s inconsistency index to incomplete comparisons: Approximated thresholds. arXiv."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF03325094","article-title":"Managing null entries in pairwise comparisons","volume":"1","author":"Koczkodaj","year":"1999","journal-title":"Knowl. Inf. Syst."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/222\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:33:40Z","timestamp":1760164420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":64,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["a14080222"],"URL":"https:\/\/doi.org\/10.3390\/a14080222","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]}}}