Universal solvability of interval max-plus matrix equations.

This paper deals with the solvability of interval matrix equations in max-plus algebra. Max-plus algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗ , where a ⊕ b = max { a , b } and a ⊗ b = a + b . The notation A ⊗ X ⊗ C = B , where A , B , and C are given interval matrices, represents an interval max-plus matrix equation. We define three types of solvability of interval max-plus matrix equations, namely the strong universal , universal , and weak universal solvability. We derive the necessary and sufficient conditions which can be verified in polynomial times. [ABSTRACT FROM AUTHOR]