On the solvability of interval max-min matrix equations (Q2174484)

Max-min algebra is a triple \((\mathcal{I}, \oplus, \otimes),\) where \(\mathcal{I}=[O, I]\) is a linearly ordered set with the least element \(O\) and the greatest element \(I\) and \(\oplus, \otimes\) are binary operations defined for two elements with \(\max\) and \(\min\). These binary operations are extended to matrices and vectors as in classical algebra. The authors denote the set of all \(m \times n\) matrices over \(\mathcal{I}\) and the set of all column \(n\)-vectors over \(\mathcal{I}\) by \(\mathcal{I}(m, n)\) and \(\mathcal{I}(n)\), respectively. They consider the ordering \(\leq\) on the sets \(\mathcal{I}(m, n)\) and \(\mathcal{I}(n)\) as follows: \begin{itemize} \item[\(\bullet\)] for \(A,C \in \mathcal{I}(m, n): A \leq C\) if \(a_{i j} \leq c_{i j}\) for each \(i \in M\) and for each \(j \in N\) \item[\(\bullet\)] for \(x, y \in \mathcal{I}(n): x \leq y\) if \(x_{j} \leq y_{j}\) for each \(j \in N\). \end{itemize} Hence, they define interval matrices \(\boldsymbol{A}\) as follows: \[ \boldsymbol{A}=[\underline{A}, \overline{A}]=\{A \in \mathcal{I}(m, n) : \underline{A} \leq A \leq\overline{A}\} \] and introduce an interval max-min matrix equation \(\boldsymbol{A} \otimes X \otimes \boldsymbol{C}=\boldsymbol{B}\), where \(\boldsymbol{A}, \boldsymbol{B},\) and \(\boldsymbol{C}\) are given interval matrices. They investigate the solvability of interval matrix equations in max-min algebra and they discuss three types of solvability of interval max-min matrix equations.