329 research outputs found
A note on the split rank of intersection cuts
In this note, we present a simple geometric argument to determine a lower bound on the split rank of intersection cuts. As a first step of this argument, a polyhedral subset of the lattice-free convex set that is used to generate the intersection cut is constructed. We call this subset the restricted lattice-free set. It is then shown that ! log 2(l)mixed integer programming, split rank, intersection cuts.
An analysis of mixed integer linear sets based on lattice point free convex sets
Split cuts are cutting planes for mixed integer programs whose validity is
derived from maximal lattice point free polyhedra of the form called split sets. The set obtained by adding all
split cuts is called the split closure, and the split closure is known to be a
polyhedron. A split set has max-facet-width equal to one in the sense that
. In this paper
we consider using general lattice point free rational polyhedra to derive valid
cuts for mixed integer linear sets. We say that lattice point free polyhedra
with max-facet-width equal to have width size . A split cut of width
size is then a valid inequality whose validity follows from a lattice point
free rational polyhedron of width size . The -th split closure is the set
obtained by adding all valid inequalities of width size at most . Our main
result is a sufficient condition for the addition of a family of rational
inequalities to result in a polyhedral relaxation. We then show that a
corollary is that the -th split closure is a polyhedron. Given this result,
a natural question is which width size is required to design a finite
cutting plane proof for the validity of an inequality. Specifically, for this
value , a finite cutting plane proof exists that uses lattice point free
rational polyhedra of width size at most , but no finite cutting plane
proof that only uses lattice point free rational polyhedra of width size
smaller than . We characterize based on the faces of the linear
relaxation
Split rank of triangle and quadrilateral inequalities
A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [2] and Cornu´ejols and Margot [13] showed that the facet-defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. Through a result by Cook et al. [12], it is known that one particular class of facet- defining triangle inequality does not have a finite split rank. In this paper, we show that all other facet-defining triangle and quadrilateral inequalities have finite split rank. The proof is constructive and given a facet-defining triangle or quadrilateral inequality we present an explicit sequence of split inequalities that can be used to generate it.mixed integer programs, split rank, group relaxations
Constrained infinite group relaxations of MIPs
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to this stronger relaxation and characterize the extreme inequalities when there are two integer variables.
An algorithm for the separation of two-row cuts
peer reviewedWe consider the question of finding deep cuts from a model with two rows of the type PI = {(x,s) ∈ Z2 ×Rn+ : x = f +Rs}. To do that, we show how to reduce the complexity of setting up the polar of conv(PI ) from a quadratic number of integer hull computations to a linear number of integer hull computations. Furthermore, we present an algorithm that avoids computing all integer hulls. A polynomial running time is not guaranteed but computational results show that the algorithm runs quickly in practice
Relaxations of mixed integer sets from lattice-free polyhedra
This paper gives an introduction to a recently established link between the geometry of numbers and mixed integer optimization. The main focus is to provide a review of families of lattice-free polyhedra and their use in a disjunctive programming approach. The use of lattice-free polyhedra in the context of deriving and explaining cutting planes for mixed integer programs is not only mathematically interesting, but it leads to some fundamental new discoveries, such as an understanding under which conditions cutting planes algorithms converge finitel
- …