Mathematical Programming Computation, Volume 11, Issue 2, June 2019

Font Size:  Small  Medium  Large

The (not so) trivial lifting in two dimensions

Ricardo Fukasawa, Laurent Poirrier, Alinson S. Xavier

Abstract


When generating cutting-planes for mixed-integer programs from multiple rows of the simplex tableau, the usual approach has been to relax the integrality of the non-basic variables, compute an intersection cut, then strengthen the cut coefficients corresponding to integral non-basic variables using the so-called trivial lifting procedure. Although of polynomial-time complexity in theory, this lifting procedure can be computationally costly in practice. For the case of two-row relaxations, we present a practical algorithm that computes trivial lifting coefficients in constant time, for arbitrary maximal lattice-free sets. Computational experiments confirm that the algorithm works well in practice.

Full Text: PDF

mpc footer
© MPS 2008-2019