Abstract
In this paper we are concerned with characterizing minimal representation of feasible regions defined by both linear and convex analytic constraints. We say that a representation is minimal if every other representation has either more analytic (nonlinear) constraints, or has the same number of analytic constraints and at least as many linear constraints. We prove necessary and sufficient conditions for the representation to be minimal. These are expressed in terms of the redundant constraints, pseudo-analytic constraints, and implicit equality constraints. In order to prove the minimal representation theorem, we present results on the facets of the convex regions defined by analytic constraints. Finally, we outline the steps of the procedure that could be used to determine a minimal representation.
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.
