Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem

Pairwise comparison matrices (PCMs) have been a long standing technique for comparing alternatives/criteria and their role has been pivotal in the development of modern decision making methods. In order to obtain general results, suitable for several kinds of PCMs proposed in the literature, we focu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 75; číslo 1; s. 143 - 161
Hlavný autor: Cavallo, Bice
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.09.2019
Springer
Springer Nature B.V
Predmet:
Coherence
Comparative analysis
Computer Science
Decision analysis
Decision making
Integer programming
Isomorphism
Linear programming
Mathematical analysis
Mathematical programming
Mathematics
Mathematics and Statistics
Matrix methods
Multiple criterion
Operations Research/Decision Theory
Optimization
Real Functions
Mixed-integer linear programming problem
Isomorphism
Coherent weights
Pairwise comparison matrix
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Pairwise comparison matrices (PCMs) have been a long standing technique for comparing alternatives/criteria and their role has been pivotal in the development of modern decision making methods. In order to obtain general results, suitable for several kinds of PCMs proposed in the literature, we focus on PCMs defined over a general unifying framework, that is an Abelian linearly ordered group. The paper deals with a crucial step in multi-criteria decision analysis, that is to obtain coherent weights for alternatives/criteria that are compared by means of a PCM. Firstly, we provide a condition ensuring coherent weights. Then, we provide and solve a mixed-integer linear programming problem in order to obtain the closest PCM, to a given PCM, having coherent weights. Isomorphisms and the mixed-integer linear programming problem allow us to solve an infinity of optimization problems, among them optimization problems concerning additive, multiplicative and fuzzy PCMs.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-019-00797-8