Certificates of linear mixed integer infeasibility

Authors:
Kent Andersen;Quentin Louveaux;Robert Weismantel
Affiliations:
Department of Mathematical Sciences, University of Copenhagen, Denmark;Montefiore Institute, University of Liège, Belgium;Department of Mathematics/IMO, Otto-von-Guericke-University of Magdeburg, Germany
Venue:
Operations Research Letters
Year:
2008

Citing 1
Cited 2

Theory of linear and integer programming

Theory of linear and integer programming

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets

Mathematics of Operations Research
Zero-Coefficient cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a certificate of integral infeasibility for linear systems with equations and inequalities by generating algebraically an outer description of a lattice point free polyhedron that contains the given integer infeasible system. The extension to the mixed integer setting is also derived.