Integer programming and convex analysis: Intersection cuts from outer polars |
| |
Authors: | Egon Balas |
| |
Institution: | (1) Carnegie-Mellon University, Pittsburgh, Pa., USA |
| |
Abstract: | Recently a new, geometrically motivated approach was proposed 1] for integer programming, based on generating intersection cuts from some convex setS whose interior contains the linear programming optimum
but no feasible integer point. Larger sets tend to produce stronger cuts, and in this paper convex analysis is used to construct sets as large as possible within the above requirements. Information is generated from all problem constraints within a unit cubeK containing
The key concept is that of outer polars, viewed as maximal convex extensions of the ballB circumscribingK, relative to the problem constraints. The outer polarF
* of the feasible setF overB is shown to be a convex set whose boundary contains all feasible vertices ofK, and whose interior contains no feasible integer point. The existence of a dual correspondence betweenF andF
*, and the fact that polarity is inclusion-reversing, leads to a dualization of operations onF. As one possible procedure based on this approach, we construct a generalized intersection cut, that can be strengthened whenever some vertex ofF is cut off. This makes it possible to fruitfully combine intersection cuts with implicit enumeration or branch-and-bound. While valid for arbitrary integer programs, the theory developed here is relevant primarily to (pure or mixed-integer) 0–1 problems. Other topics discussed include: generalized polars, intersection cuts from related problems, connections with asymptotic theory.This paper was presented at the 7th Mathematical Programming Symposium, 1970, The Hague, The Netherlands.The research underlying this paper was partially supported by the National Science Foundation under grant GP-31699 and by the Office of Naval Research under contract N00014-67-A-0314-0007 NR 047-048. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|