Carnegie Mellon University
Valid Inequalities for Mixed Integer Linear Programs.pdf.pdf' (363.93 kB)
Download file

Valid Inequalities for Mixed Integer Linear Programs

Download (363.93 kB)
journal contribution
posted on 2004-09-01, 00:00 authored by Gerard CornuejolsGerard Cornuejols
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these families. The tutorial also discusses computational aspects of generating the cuts and their strength