Abstract
For a linear integer programming problem, thelocal information contained at an optimal solution\(\bar x\) of the continuous linear programming extension stems from the theory of L.P. solutions. This paper proposes the use ofenvironmental information (of a global nature but pertaining to the discrete vicinity of\(\bar x\)), in order to isolate the set of integer solutions which may be considered as true candidates for the optimum. The concept ofenumerative inequalities is introduced and it is shown how it can be obtained in the context of the convex outer-domain theory of Balas, Young, et al.
Generally speaking, enumerative inequalities can be made arbitrarily strong (deep), but at the cost of an increasing amount of work (i.e. enumeration) for their construction. In particular cases, however, very little global information can produce enumerative inequalities stronger than anyvalid cut.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
E. Balas, “The intersection cut — A new cutting plane for integer programming”,Management Science Research Report No. 187 (1969), Carnegie-Mellon University.
E. Balas, “Intersection cuts from maximal extensions of the ball and the octahedron”, 7th Mathematical Programming Symposium, The Hague (1970),Mathematical Programming to be published.
C.-A. Burdet, “A class of cuts and related algorithms in integer programming”,Management Science Research Report No. 220 (1970) Carnegie-Mellon University.
C.-A. Burdet, “The method of enumerative cuts”, IBM, RC 3174 (1970) Watson Research Center, New York.
A. Geoffrion, “Integer programming by implicit enumeration and Balas' method”,SIAM Review 9 (1967) 178–190.
R. Gomory, “An algorithm for integer solutions to linear programs”, in:Recent advances in mathematical programming, Eds. R.L. Graves and P. Wolfe (McGraw-Hill, 1963).
F. Glover, “Convexity cuts”, University of Texas, Austin, Dec. 1969.Operations Research, (1971) to appear.
R. Gomory and E. Johnson, “Some continuous functions related to corner polyhedra”, 7th Mathematical Programming Symposium, The Hague (1970),Mathematical Programming to appear.
F. Hillier, “A bound-and-scan algorithm for pure integer linear programming with general variables”,Operations Research 17, No. 3 (1969).
Hoang Tuy, “Concave programming under linear constraints”,Soviet Mathematics (1964) 1437–40.
A. Land and A. Doig, “An automatic method of solving discrete programming problems”,Econometrica 28 (1960).
F. Glover, “Cut-search methods in integer programming”, 7th Mathematical Programming Symposium, The Hague (1970),Mathematical Programming to appear.
E. Balas, “Integer programming and convex analysis”, Management Science Report # 246 (April 1971), Carnegie-Mellon University.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burdet, CA. Enumerative inequalities in integer programming. Mathematical Programming 2, 32–64 (1972). https://doi.org/10.1007/BF01584536
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584536