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-produc
Optimization of fuzzy relation equations with max-product composition
β Scribed by Jiranut Loetamonphong; Shu-Cherng Fang
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 133 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
β¦ Synopsis
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 characteristics of its feasible domain and the optimal solutions. Some procedures for reducing the original problem are presented. The problem is transformed into a 0 -1 integer program which is then solved by the branch-and-bound method. For illustration purpose, an example of the procedures is provided.
π 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
An optimization model with a nonlinear objective function subject to a system of fuzzy relation equations is presented. Since the solution set of the fuzzy relation equations is in general a non-convex set, when it is not empty, conventional nonlinear programming methods are not ideal for solving su
In this paper we introduce some algorithms which have minimization properties about the fuzziness of solutions in the maxmin fuzzy relation equations.