Premium
Constructing a strict total order for alternatives characterized by multiple criteria: An extension
Author(s) -
Dehnokhalaji Akram,
Korhonen Pekka J.,
Köksalan Murat,
Nasrabadi Nasim,
Tezcaner Öztürk Diclehan,
Wallenius Jyrki
Publication year - 2014
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21573
Subject(s) - pairwise comparison , merge (version control) , extension (predicate logic) , transitive relation , preference , mathematics , mathematical optimization , integer programming , ranking (information retrieval) , finite set , order (exchange) , set (abstract data type) , computer science , combinatorics , statistics , artificial intelligence , information retrieval , mathematical analysis , finance , economics , programming language
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014