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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call