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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
