Abstract
Polyhedrality is established for convex hulls of sets defined by systems of equations in nonnegative integer variables. This property is useful for certain existence, duality, and sensitivity results in integer programming. The structural theorems obtained also shed light on the relationship between the convex hull and the relaxation obtained by deleting integrality constraints.
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.
