A lexicographically optimal completion for pairwise comparison matrices with missing entries (Q6556106)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lexicographically optimal completion for pairwise comparison matrices with missing entries |
scientific article; zbMATH DE number 7865835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lexicographically optimal completion for pairwise comparison matrices with missing entries |
scientific article; zbMATH DE number 7865835 |
Statements
A lexicographically optimal completion for pairwise comparison matrices with missing entries (English)
0 references
17 June 2024
0 references
decision analysis
0 references
analytic hierarchy process (AHP)
0 references
inconsistency optimisation
0 references
incomplete pairwise comparisons
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0 references
