The robustness of interval fuzzy matrices (Q1947097): Difference between revisions

Matrices in \((\max , \min)\)-algebra (fuzzy matrices, the addition and the multiplication are formally replaced by operations of maximum and minimum) are useful for modelling applications of fuzzy discrete dynamic systems, graph theory, scheduling, knowledge engineering, fuzzy logic programs, etc. The robustness of a fuzzy matrix can be checked using the layered primitivity of the corresponding digraph, i.e., for each entry of a matrix verify the primitivity of the digraph consisting of the edges whose weight is greater or equal to the given value. In this paper, the authors try to describe the robustness of fuzzy matrices with inexact data (interval matrices) and also they try to find polynomial algorithms for verifying the corresponding properties of interval fuzzy matrices and interval circulant matrices. Moreover, the authors prove the necessary and sufficient conditions for an interval matrix to be universally and possibly robust. They also introduce more efficient algorithms for checking the robustness of interval circulant matrices.