Constructing a strict total order for alternatives characterized by multiple criteria: An extension |
| |
Authors: | Akram Dehnokhalaji Pekka J. Korhonen Murat Köksalan Nasim Nasrabadi Diclehan Tezcaner Öztürk Jyrki Wallenius |
| |
Affiliation: | 1. Department of Information and Service Economy, Aalto University, School of Business, , 00076 Aalto Helsinki, Finland;2. Department of Computer Science, Kharazmi University, , Tehran, Iran;3. Department of Industrial Engineering, Middle East Technical University, , Ankara, Turkey;4. Department of Mathematics, Birjand University, , Birjand, Iran |
| |
Abstract: | 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 |
| |
Keywords: | strict total order discrete alternative convex cone multiple criteria transitivity |
|
|