Abstract
Max-min algebra is defined as a linearly ordered set with two binary operations. Classical addition and multiplication are replaced by maximum and minimum, respectively. A square matrix is robust, if its eigenspace is achieved starting at arbitrary vector and it is X-robust if its eigenspace is achieved starting at each vector from a given interval vector X. The EA and AE robustness and X-robustness of interval circulant matrices over max-min algebra are defined. Polynomial algorithms for checking these types of robustness and X-robustness are given.
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.
