On Dominance and Dispersion of a Class of Weighting Lists
The class of weighting lists with a prefixed minimum and maximum values is studied. It is introduced the concept of degree of Dominance of a weighting list as a generalization of the degree of Orness. It is proved that, with good conditions, there always exist two unique lists with minimum and maximum dominance respectively. From the concepts of dominance and dispersion, it is solved the problem of obtaining the weighting list in the class considered here of maximum dispersion with a given degree of dominance.
KeywordsAggregation Operator Ordered Weighted Average Mathematical Programming Problem Weighted Average Ordered Weighted Average Operator
Unable to display preview. Download preview PDF.
- 2.O’Hagan, M. (1990) Using maximum entropy-ordered averaging operator to construct a fuzzy neuron. Proceedings 24th Annual IEEE Asilomar Conf. on Signals, Systems and Computers. Pacific Grove. CA, 618–623Google Scholar