Improved integer programming bounds using intersections of corner polyhedra (original) (raw)

Abstract

Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP basis for which the associated relaxation is stronger. These criteria may be successively applied to obtain either an optimal IP solution or a lower bound on the cost of such a solution. Conditions are given for equality of the convex hull of feasible IP solutions and the intersection of all corner polyhedra.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

1. H.P. Crowder and E.L. Johnson, “Use of cyclic group methods in branch and bound”, Mathematical Sciences Department, IBM Watson Research Center, Yorktown Heights, New York (November, 1972).
   Google Scholar
2. M.L. Fisher and J.F. Shapiro, “Constructive duality in integer programming”,SIAM Journal of Applied Mathematics 27 (1974) 31–52.
   Google Scholar
3. M.L. Fisher, W.D. Northrup and J.F. Shapiro, “Using duality to solve discrete optimization problems: theory and computational experience”,Mathematical Programming, to appear.
4. R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
   Google Scholar
5. R.E. Gomory, “Some polyhedra related to combinatorial problems”,Linear Algebra and Its Applications 2 (1969) 451–558.
   Google Scholar
6. R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedra”,Mathematical Programming 3 (1972) 23–85.
   Google Scholar
7. G.A. Gorry and J.F. Shapiro, “An adaptive group-theoretic algorithm for integer programming problems”,Management science 17 (1971) 285–306.
   Google Scholar
8. E.L. Johnson, “Cyclic Groups, Cutting Planes, and Shortest Paths,” Mathematical Sciences Department, IBM Watson Research Center, Yorktown Heights, New York (August, 1972).
   Google Scholar
9. D.S. Rubin, “On the unlimited number of faces in integer hulls of linear programs with a single constraint”,Operations Research 18 (1970) 940–946.
   Google Scholar
10. L.A. Wolsey, “Extensions of the group theoretic approach in integer programming”,Management Science 18 (1971) 74–83.
    Google Scholar

Download references

Author information

Authors and Affiliations

1. International Institute for Applied Systems Analysis, Vienna, Austria
   David E. Bell
2. Graduate School of Bussiness, University of Chicago, USA
   Marshall L. Fisher

Authors

1. David E. Bell
2. Marshall L. Fisher

Rights and permissions

About this article

Cite this article

Bell, D.E., Fisher, M.L. Improved integer programming bounds using intersections of corner polyhedra.Mathematical Programming 8, 345–368 (1975). https://doi.org/10.1007/BF01580451

Download citation

• Received: 30 October 1973
• Revised: 08 January 1975
• Issue date: December 1975
• DOI: https://doi.org/10.1007/BF01580451

Keywords