Abstract
In this study, a Tchebycheff utility function based approach is proposed for multiple criteria sorting problems in order to classify alternatives into ordered categories, such as A, B, C, etc. Since the Tchebycheff function has the ability to reach efficient alternatives located even in the non-convex part of the efficient frontier, it is used in the proposed sorting approach to prevent such alternatives being disadvantages. If the preferences of the DM are not exactly known, each alternative selects its own favorable weights for a weighted Tchebycheff distance function. Then, each alternative is compared with the reference alternatives of a class to compute its strength over them. The average strengths are later used to categorize the alternatives. The experimental analysis results on the performance of the algorithm are presented.
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.
