Abstract
Previous work on Gomory's corner polyhedra is extended to generate valid inequalities for any mixed integer program. The theory of a corresponding asymptotic problem is developed. It is shown how faces previously generated and those given here can be used to give valid inequalities for any integer program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, New Jersey, 1963).
R.E. Gomory, “An algorithm for integer solutions to linear programs,” in:Recent advances in mathematical programming, eds. R.L. Graves and P. Wolfe (McGraw-Hill Book Company, Inc., New York, 1963) pp. 269–302.
R.E. Gomory, “Some polyhedra related to combinatorial problems,”Linear Algebra and Its Applications 2 (1969) 451–558.
R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedra II”, submitted toMathematical Programming.
T.S. Motzin, H. Raiffa, G.L. Thompson and R.M. Thrall, “The double description method,” in:Contributions to the theory of games, Vol. II, eds. H.W. Kuhn and A.W. Tucker, Annals of Mathematics Study No. 28 (Princeton University Press, Princeton, New Jersey, 1953) pp. 51–73.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gomory, R.E., Johnson, E.L. Some continuous functions related to corner polyhedra. Mathematical Programming 3, 23–85 (1972). https://doi.org/10.1007/BF01584976
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584976