Abstract
The study of orders is a constantly evolving topic, not only for its interest from a theoretical point of view, but also for its possible applications. Recently, one of the hot lines of research has been the construction of admissible orders in different frameworks. Following this direction, this paper presents a new representation theorem in the field of discrete fuzzy numbers that enables the construction of two families of admissible orders in the set of discrete fuzzy numbers whose support is a closed interval of a finite chain, leading to the first admissible orders introduced in this framework.
Highlights
IntroductionIt is well-established in the scientific community that the traditional scheme for the solution of a linguistic decision analysis in a Multi-criteria Decision Making Problem (MCDM) consists of three parts [1]: 2
In this paper, the main goal will be the construction of two different families of admissible orders in the set of discrete fuzzy numbers whose support is a closed interval of a finite chain Ln which are not based on any index function
D A,B ( β) may be used to define an equivalence relation ∼ as follows: A ∼ B if D A,B ( β) = 0 but, this means that we can not properly distinguish those fuzzy numbers which belong to the same equivalence class. These total orders based on ranking indices are not able to discriminate between discrete fuzzy numbers which are very different in terms of core or support
Summary
It is well-established in the scientific community that the traditional scheme for the solution of a linguistic decision analysis in a Multi-criteria Decision Making Problem (MCDM) consists of three parts [1]: 2. In this paper, the main goal will be the construction of two different families of admissible orders in the set of discrete fuzzy numbers whose support is a closed interval of a finite chain Ln which are not based on any index function. The last section is devoted to some conclusions and possible lines of future work
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have