Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
