Abstract
Lexicographic methods to rank fuzzy numbers present the advantages of simplicity, consistency with human intuition, and power of discrimination. In this paper, we tackle the problem of finding the conditions for these methods to produce a rank in specific steps. Our main results are twofold. First, we prove that a necessary and sufficient condition for a ranking function to be a total order is that this function is either injective, surjective, or bijective. Second, we provide further insight into the required steps for a lexicographic order to rank same-type and different-type fuzzy numbers. A counterexample refutes a conjecture in the literature about the maximum number of steps needed to rank different-type fuzzy numbers.
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.
