An Algorithm for Finding a Minimal Solution to Fuzzy Relation Inequalities with Addition-Min Composition

Abstract

We first show a sufficient and necessary condition that a solution of fuzzy relation inequalities with addition-min composition is a minimal one. We then prove that for every solution of the fuzzy relation inequalities there exists a minimal solution that is less than or equal to the solution in a very different way. We finally give an algorithm to find a minimal solution for a given solution, which is illustrated by numerical examples.