Abstract
This paper investigates minimal solutions of fuzzy relation inequalities with addition-min composition. It first shows the conditions that an element is a minimal solution of the inequalities, and presents the conditions that the inequalities have a unique minimal solution. It then proves that every solution of the inequalities has a minimal one and proposes an algorithm to searching for a minimal solution with computational complexity O (n2) where n is the number of unknown variables of the inequalities. This paper finally describes all minimal solutions of the inequalities.
Get full access to this article
View all access options for this article.
