Paper Info
Title
On some convexity properties of the Least Squares Method for pairwise comparisons matrices without the reciprocity condition.
Abstract
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.
Year
DOI
Venue
2012
10.1007/s10898-011-9785-z
Journal of Global Optimization
Keywords
DocType
Volume
Pairwise comparisons,Convexity properties
Journal
54
Issue
ISSN
Citations 
4
1573-2916
6
PageRank 
References 
Authors
0.58
13
3
Name
Order
Citations
PageRank
Jándor Fülöp160.58
Waldemar W. Koczkodaj2628100.50
Stanislaw J. Szarek3382.96