The aim of this work is to investigate when a weighted sum, or in other words, a linear combination, of two or more aggregation operators leads to a new aggregation operator. For weights belonging to the real unit interval, we obtain a convex combination and the answer is known to be always positive. However, we will show that also other weights can be used, depending upon the aggregation operators involved. A first set of suitable weights is obtained by a general method based on the variation of the partial derivatives of the aggregation operators. When considering the combination of OWA operators only, all suitable weights can be determined. These results are described explicitly for the case of two aggregation operators, and also for the case of two and three OWA operators.
@article{urn:eudml:doc:39140,
title = {Weighted sums of aggregation operators.},
journal = {Mathware and Soft Computing},
volume = {6},
year = {1999},
pages = {33-47},
zbl = {0955.03058},
mrnumber = {MR1724322},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39140}
}
Calvo, Tomasa; De Baets, Bernard; Mesiar, Radko. Weighted sums of aggregation operators.. Mathware and Soft Computing, Tome 6 (1999) pp. 33-47. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39140/