An optimization problem with a linear objective function subject to a system of fuzzy relation equations using maxproduct composition is considered. Since the feasible domain is non-convex, traditional linear programming methods cannot be applied. We study this problem and capture some special chara
Solution algorithms for fuzzy relational equations with max-product composition
โ Scribed by Mary M. Bourke; D.Grant Fisher
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 555 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
โฆ Synopsis
The conditions for the existence of an inverse solution to the max-rain composition of fuzzy relational equations have been well documented since the original work by Sanchez . These same existence theorems have been extended to the t-norm composition of relational equations, in which the max-product composition is a member . Several studies 33, have shown that the max-min operator may not always be the most desirable fuzzy relational composition and in fact the max-product operator was superior in these instances. This paper reviews the algorithms necessary to determine the complete solution of the inverse for fuzzy relational equations with max-product composition. (d;
๐ SIMILAR VOLUMES
T-and aT-compositions , i.e., composite operations of sup-T and inf--aT, and relationships among ~-, etT-operators and t-norm are considered. It is shown that, if a composite fuzzy relational equation by T-composition has solutions, then a greatest one exists, and that if a similar equation by etr-c
On complete Brouwerian lattices, an inf-ฮฑ composite fuzzy relational equation and its equation system are investigated. In finite domains, a necessary and sufficient solvability condition is proposed for the equation, then all its maximal solutions and the whole solution set are determined. Subseque