17 research outputs found
When Lift-and-Project Cuts are Different
In this paper, we present a method to determine if a lift-and-project cut for
a mixed-integer linear program is irregular, in which case the cut is not
equivalent to any intersection cut from the bases of the linear relaxation.
This is an important question due to the intense research activity for the past
decade on cuts from multiple rows of simplex tableau as well as on
lift-and-project cuts from non-split disjunctions. While it is known since
Balas and Perregaard (2003) that lift-and-project cuts from split disjunctions
are always equivalent to intersection cuts and consequently to such multi-row
cuts, Balas and Kis (2016) have recently shown that there is a necessary and
sufficient condition in the case of arbitrary disjunctions: a lift-and-project
cut is regular if, and only if, it corresponds to a regular basic solution of
the Cut Generating Linear Program (CGLP). This paper has four contributions.
First, we state a result that simplifies the verification of regularity for
basic CGLP solutions from Balas and Kis (2016). Second, we provide a
mixed-integer formulation that checks whether there is a regular CGLP solution
for a given cut that is regular in a broader sense, which also encompasses
irregular cuts that are implied by the regular cut closure. Third, we describe
a numerical procedure based on such formulation that identifies irregular
lift-and-project cuts. Finally, we use this method to evaluate how often
lift-and-project cuts from simple -branch split disjunctions are irregular,
and thus not equivalent to multi-row cuts, on 74 instances of the MIPLIB
benchmarks.Comment: INFORMS Journal on Computing (to appear
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
Computational Experiments with Cross and Crooked Cross Cuts
In this paper, we study whether cuts obtained from two simplex tableau rows at a time can strengthen the bounds obtained by Gomory mixed-integer (GMI) cuts based on single tableau rows. We also study whether cross and crooked cross cuts, which generalize split cuts, can be separated in an effective manner for practical mixed-integer programs (MIPs) and can yield a nontrivial improvement over the bounds obtained by split cuts. We give positive answers to both these questions for MIPLIB 3.0 problems. Cross cuts are a special case of the t-branch split cuts studied by Li and Richard [Li Y, Richard J-PP (2008) Cook, Kannan and Schrijvers's example revisited. Discrete Optim. 5:724–734]. Split cuts are 1-branch split cuts, and cross cuts are 2-branch split cuts. Crooked cross cuts were introduced by Dash, Günlük, and Lodi [Dash S, Günlük O, Lodi A (2010) MIR closures of polyhedral sets. Math Programming 121:33–60] and were shown to dominate cross cuts by Dash, Günlük, and Molinaro [Dash S, Günlük O, Molinaro M (2012b) On the relative strength of different generalizations of split cuts. IBM Technical Report RC25326, IBM, Yorktown Heights, NY].United States. Office of Naval Research (Grant N000141110724
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
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, Louveaux, Weismantel and Wolsey (2007)
and Cornuejols and Margot (2008) 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, Kannan and Schrijver
(1990), 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 a 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.Comment: 39 pages and 13 figure