On some convexity properties of the Least Squares Method for pairwise comparisons matrices without the reciprocity condition

J. Fülöp (), W. Koczkodaj () and S. Szarek ()

Journal of Global Optimization, 2012, vol. 54, issue 4, 689-706

Abstract: The relaxation of the reciprocity condition for pairwise comparisons is revisited from the optimization point of view. We show that some special but not extreme cases of the Least Squares Method are easy to solve as convex optimization problems after suitable nonlinear change of variables. We also give some other, less restrictive conditions under which the convexity of a modified problem can be assured, and the global optimal solution of the original problem found by using local search methods. Mathematical and psychological justifications for the relaxation of the reciprocity condition as well as numerical examples are provided. Copyright Springer Science+Business Media, LLC. 2012

Keywords: Pairwise comparisons; Convexity properties (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-011-9785-z (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:54:y:2012:i:4:p:689-706

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-011-9785-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().