Max-Min Decomposition Problem of a Fuzzy Relation in Linear Lattices
In this Ch., we solve a decomposition problem, more complicated than the problem mentioned in Sec.6.5, and precisely, we present a numerical algorithm, illustrated by a flowchart, which assures the existence of a fuzzy relation Z∈F(X×X) such that Z⊙Z=R, where R∈F(X×X) is an assigned fuzzy relation defined on a referential set X and assuming values in a linear lattice L with universal bounds 0 and 1. Connections with results already existing in recent literature are also given.
KeywordsFuzzy Relation Maximal Solution Decomposition Problem Algebraic Characterization Arbitrary Index
Unable to display preview. Download preview PDF.