Abstract
In this paper we address the problem of the infeasibility of systems defined by quadratic convex inequality constraints. In particular, we investigate properties of irreducible infeasible sets and provide an algorithm that identifies a set of all constraints ( K ) that may affect the feasibility status of the system after some perturbation of the right-hand sides. We show that all irreducible sets, as well as infeasibility sets, are subsets of the set K , and that every infeasible system contains an inconsistent subsystem of cardinality not greater than the number of variables plus one. The results presented in this paper are also applicable to linear systems.
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.
