On the facets of mixed integer programs with two integer variables and two constraints

Authors:
Gérard Cornuéjols;François Margot
Affiliations:
Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA and Université de Marseille, LIF, Faculté des Sciences de Luminy, Marseille, France;Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA
Venue:
Mathematical Programming: Series A and B
Year:
2009

Citing 0
Cited 14

A Geometric Perspective on Lifting

Operations Research
A probabilistic analysis of the strength of the split and triangle closures

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study

INFORMS Journal on Computing
Split Rank of Triangle and Quadrilateral Inequalities

Mathematics of Operations Research
Experiments with Two-Row Cuts from Degenerate Tableaux

INFORMS Journal on Computing
Constrained Infinite Group Relaxations of MIPs

SIAM Journal on Optimization
On Maximal $S$-Free Convex Sets

SIAM Journal on Discrete Mathematics
Intersection Cuts with Infinite Split Rank

Mathematics of Operations Research
Zero-Coefficient cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Experiments with two row tableau cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Computing with multi-row Gomory cuts

Operations Research Letters
Stable sets, corner polyhedra and the Chvátal closure

Operations Research Letters
Strengthening lattice-free cuts using non-negativity

Discrete Optimization
Composite lifting of group inequalities and an application to two-row mixing inequalities

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program.