Abstract
This paper establishes an intrinsic complexity for the integer-programming problem that goes well beyond the computational complexities of linear programming. To this end, it describes a procedure with the following property: given any two independent linear constraints in two dimensions and any number N however large, the procedure determines two other linear constraints (with integer coefficients) arbitrarily “close” to the given constraints such that the two new constraints have at least N faces in their integer hull. It is possible for the integer-programming optimum to occur at any extreme point of this hull, and the number of extreme points is one less than the number of faces. In contrast, the linear-programming problem consisting of two inequalities in the plane is a triviality. The paper has an expository style and illustrates its highly geometrical arguments with figures.
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.
