Abstract

Many authors considered the computational aspect of sup-min convolution when applied to weighted average operations. They used a computational algorithm based on a-cut representation of fuzzy sets, nonlinear programming implementation of the extension principle, and interval analysis. It is well known that <TEX>$T_W$</TEX>(the weakest t-norm)-based addition and multiplication preserve the shape of L-R type fuzzy numbers. In this paper, we consider the computational aspect of the extension principle by the use of <TEX>$T_W$</TEX> when the principle is applied to fuzzy weighted average operations. We give the exact solution for the case where variables and coefficients are L-L fuzzy numbers without programming or the aid of computer resources.

Full Text
Published version (Free)

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 call