Abstract
The problem of finding the smallest box enclosing the united solution set of a linear interval system, also known as the "interval hull" problem, was proven to be NP-hard. However, Hansen, Bliek, and others subsequently, have provided a polynomial-time solution in the case of systems preconditioned by the midpoint inverse matrix. Based upon a similar approach, this paper deals with the interval hull problem in the context of AE-solution sets, where parameters may be given different quantifiers. A polynomial-time algorithm is proposed for computing the hull of AE-solution sets where parameters involved in the matrix are constrained to be existentially quantified. Such AE-solution sets are called right-quantified solution sets. They have recently been shown to be of practical interest.
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.
