Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A number of theoretical results concerning the problem of outranking methods allowing one to rank order the elements of a finite set on the basis of a non-necessarily complete or transitive binary relation are reviewed.
Abstract
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite set on the basis of a non-necessarily complete or transitive binary relation. In the area of MCDM, such a problem occurs with outranking methods. We review a number of theoretical results concerning this problem and show how they may be useful in order to guide the choice of a particular technique. © 1997 John Wiley & Sons, Ltd.