On the handling of inconsistent systems of max-min fuzzy relational equations

Abstract

In this article, we study the inconsistency of systems of max-min fuzzy relational equations. We first compute by an explicit analytical formula the Chebyshev distance (defined by the L-infinity norm) between the second member of an inconsistent system and the set of second members of consistent systems defined with the same matrix: that of the inconsistent system. Then we study the set of Chebyshev approximations of the second member of the inconsistent system, which are the second members of the consistent systems defined with the same matrix as the inconsistent system, whose distance to the second member of the inconsistent system is equal to the computed Chebyshev distance. This set is non-empty and associated to the approximate solutions set of the inconsistent system in the following sense: an approximate solution is a solution vector of a consistent system defined with the same matrix as the inconsistent system, whose second member is a Chebyshev approximation of the second member of the inconsistent system. As main results, we describe both the structure of the approximate solutions set and that of the set of the Chebyshev approximations of the second member of the inconsistent system. As an application of our results, we show that our work can help to find approximate values for the rule parameters of a possibilistic rule-based system.