Lifting for conic mixed-integer programming

Authors:
Alper Atamtürk;Vishnu Narayanan
Affiliations:
University of California, Industrial Engineering and Operations Research Department, 4141 Etcheverry Hall MC 1777, 94720-1777, Berkeley, CA, USA;Indian Institute of Technology Bombay, Industrial Engineering and Operations Research, Powai, 400076, Mumbai, India
Venue:
Mathematical Programming: Series A and B
Year:
2011

Citing 0
Cited 7

The Chvátal-Gomory Closure of a Strictly Convex Body

Mathematics of Operations Research
The split closure of a strictly convex body

Operations Research Letters
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems

Operations Research
Intersection cuts for mixed integer conic quadratic sets

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Facial structure and representation of integer hulls of convex sets

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

INFORMS Journal on Computing
A computational study for common network design in multi-commodity supply chains

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very effective in developing strong valid inequalities for linear integer programming and it has been successfully used to solve such problems with branch-and-cut algorithms. Here we generalize the theory of lifting to conic integer programming, i.e., integer programs with conic constraints. We show how to derive conic valid inequalities for a conic integer program from conic inequalities valid for its lower-dimensional restrictions. In order to simplify the computations, we also discuss sequence-independent lifting for conic integer programs. When the cones are restricted to nonnegative orthants, conic lifting reduces to the lifting for linear integer programming as one may expect.