Cutting planes from two rows of simplex tableau
|
|
- Opal Bryan
- 5 years ago
- Views:
Transcription
1 Cutting planes from two rows of simplex tableau Based on talk by Andersen et al, IPCO-2007 Ashutosh Mahajan 1 1 Lehigh University Department of Industrial and Systems Engineering Cor@l Seminar Series - August 28, 2007
2 Split Cuts Subsume MIR, GMI, Lift and Project,... Effectively used in branch-and-cut algorithms Let (π, π 0 ) Z (n+1). Any valid inequality for P {x πx π 0 } and P {x πx π 0 + 1} is valid for P Split cuts alone are NOT sufficient to solve a general MIP problem Need of stronger classes of cuts How to split on multiple disjunctions? Also see: Mixing mixed integer inequalities by Günluk and Pochet (and Cor@l talk by Kumar Abhishek) Today s focus Cutting planes from two rows of a simplex tableau AndLouWeiWol-2may.pdf
3 Cook, Kannan and Schrijver s example x 3 min x 3 s.t. (0,0,0) (0.67,0.67,0.67) (0,2,0) x 2 x 3 x 1 x 3 x 2 x 1 + x 2 + x 3 2 (2,0,0) x 1 x 1, x 2 Z x 3 R + x 3 0 is a valid cut for the above polytope. Proof:...
4 Cook, Kannan and Schrijver s example x 3 min x 3 s.t. (0,0,0) (0.67,0.67,0.67) (0,2,0) x 2 x 3 x 1 x 3 x 2 x 1 + x 2 + x 3 2 (2,0,0) x 1 x 1, x 2 Z x 3 R + x 3 0 is a valid cut for the above polytope. Proof:... x 3 0 is not a split inequality. See Cook et al.
5 The simplex tableau I: set of integer variables, C: set of continuous variables B: set of basic variables, N: set of non-basic variables rows in simplex tableau: x i = f i + j N r j x j, i B If f i Z i B I, current solution is feasible if f i / Z then cuts may be derived from this row (MIR, GMI) Lets consider two rows (with change of notation) now: x 1 = f 1 + r j 1 s j j N x 2 = f 2 + r j 2 s j j N or x = f + j N rj s j x, f, r j are vectors in two dimensions
6 The simplex tableau I: set of integer variables, C: set of continuous variables B: set of basic variables, N: set of non-basic variables rows in simplex tableau: x i = f i + j N r j x j, i B If f i Z i B I, current solution is feasible if f i / Z then cuts may be derived from this row (MIR, GMI) Lets consider two rows (with change of notation) now: x 1 = f 1 + r j 1 s j j N x 2 = f 2 + r j 2 s j j N or x = f + j N rj s j x, f, r j are vectors in two dimensions
7 First steps P I = {(x, s) Z 2 R n + : x = f + r j s j } j N P LP = {(x, s) R 2 R n + : x = f + r j s j } j N r j : also called a ray, as in an LP P I may be empty. (Never so for 1-row case.) e.g. x 1 = s 1 + 4s 2 x 2 = s 1 + 4s 2 Lemma: P I is empty if and only if 1. All rays {r j } are parallel, and 2. The lines {f + r j s j : s j R} for j N do not contain any integer points
8 First steps P I = {(x, s) Z 2 R n + : x = f + r j s j } j N P LP = {(x, s) R 2 R n + : x = f + r j s j } j N r j : also called a ray, as in an LP P I may be empty. (Never so for 1-row case.) e.g. x 1 = s 1 + 4s 2 x 2 = s 1 + 4s 2 Lemma: P I is empty if and only if 1. All rays {r j } are parallel, and 2. The lines {f + r j s j : s j R} for j N do not contain any integer points
9 Structure of conv(p I ) (2,3) 5x 1 + 3x 2 1 x 1 5x 2 2 x 1, x 2 Z (0.5,0.5) P LP (3,1) 5x 1 + 3x 2 + s 1 = 1 x 1 5x 2 + s 2 = 2 x 1, x 2 Z s 1, s 2 R + (0,0) (2,3) conv(p ) I (3,1) (0.5,0.5) (0,0)
10 conv(p I ) (Not empty) Let P I = {(x, s) Z 2 R n + : x = f + j N r j s j } Lemma: 1. The extreme rays of conv(p I ) are (r j, e j ) for j N 2. The dimension of conv(p I ) is n(= N ) 3. The vertices (x I, s I ) of conv(p I ) take either of two forms: 3.1 (x I, s I ) = (x I, e j s I j), where x I = f + r j s I j Z 2 and j N. (integer point on ray {f + r j s j : s j 0) 3.2 (x I, s I ) = (x I, e j s I j + e k s I k ), where xi = f + r j s I j + r k s I k Z2 and j, k N. (integer point in the set f + cone({r j, r k }). Proof:... (Not all points satisfying above properties are vertices.) Corollary: Every non-trivial valid inequality for P I that is tight at a point ( x, s) P I can be written in the form α j s j 1, j N where α j 0 for all j N.
11 conv(p I ) (Not empty) Let P I = {(x, s) Z 2 R n + : x = f + j N r j s j } Lemma: 1. The extreme rays of conv(p I ) are (r j, e j ) for j N 2. The dimension of conv(p I ) is n(= N ) 3. The vertices (x I, s I ) of conv(p I ) take either of two forms: 3.1 (x I, s I ) = (x I, e j s I j), where x I = f + r j s I j Z 2 and j N. (integer point on ray {f + r j s j : s j 0) 3.2 (x I, s I ) = (x I, e j s I j + e k s I k ), where xi = f + r j s I j + r k s I k Z2 and j, k N. (integer point in the set f + cone({r j, r k }). Proof:... (Not all points satisfying above properties are vertices.) Corollary: Every non-trivial valid inequality for P I that is tight at a point ( x, s) P I can be written in the form α j s j 1, j N where α j 0 for all j N.
12 Valid inequality for conv(p I ) Let j N α js j 1 be a valid inequality for conv(p I ) that is tight for P I. Let L α = {x R 2 : s R n + s.t.(x, s) P LP and j n α j s j 1} Lemma: Let v j = f + 1 α j r j, j N\N 0 α, then 1. interior(l α ) P I = φ 2. if interior(l α ) φ, then f interior(l α ) 3. L α = conv({f } {v j } j N\N 0 α ) + cone({r j } j N 0 α )} Proof:... Let X α = {x Z 2 : s R n +s.t.(x, s) P LP and α j s j = 1} j N = L α Z 2 φ when α j s j = 1 is a facet j N not neccessarily true for faces or other valid inequalities
13 Split cuts Lemma: If, for a facet defining inequality j N α js j 1 for conv(p I ), N 0 α φ then (π, π 0 ) Z 2 Z s.t. L α {(x 1, x 2 ) : π 0 π 1 x 1 + π 2 x 2 π 0 + 1}. Proof: 1. Let k N 0 α. Then the line {f + µr k : µ R} does not pass through any integer points in R 2 2. All rays {r j } j N 0 α are parallel 3. Let π = ( r k 2, rk 1 ), π 0 = π f. Then, {f + µr k : µ R} = {x π x = π 0 } 4. Let π 1 0 = max{π 1x 1 π 2x 2 π 0, x Z 2 } π 2 0 = min{π 1x 1 π 2x 2 π 0, x Z 2 } S π = {x R 2 : π 1 0 π 1x 1 + π 2x 2 π 2 0} 5. L α S π 6. S π = {x R 2 : π 0 π 1 x 1 + π 2 x 2 π 0 + 1} for some (π, π 0 ) Z 2 Z.
14 When N 0 α = φ
15 When N 0 α = φ Stay tuned
16 Recap P I = {(x, s) Z 2 R n + : x = f + j N r j s j } P LP = {(x, s) R 2 R n + : x = f + j N r j s j } Basic solution: (f, 0) Objective: Find facet defining inequality(ies) for conv(p I ). Some of these inequalities may not be split cuts (of any rank). P LP is a cone. dim(conv(p I )) = n = N For any ( x, s) P I, either: 1. x = f + s j e j (ray point) or, 2. x = f + s j e j + s k e k
17 Recap Every non-trivial valid inequality for P I that is tight at a point ( x, s) P I can be written in form: α j s j 1, j N where α j 0, j N.
18 Recap Every non-trivial valid inequality for P I that is tight at a point ( x, s) P I can be written in form: α j s j 1, j N where α j 0, j N. s 2 = 0 P LP s 1 = 0
19 Example x 3 min x 3 s.t. (0,0,0) (0.67,0.67,0.67) (0,2,0) x 2 x 3 x 1 x 3 x 2 x 1 + x 2 + x 3 2 (2,0,0) x 1 x 1, x 2 Z x 3 R + P LP : x 1 = s s s 3 x 2 = s s s 3 facet definining inequality: x s s s 3 1
20 Split Cuts Let j N α js j 0 be a valid inequality for conv(p I ). Then: 1. Let N 0 α = {j : α j = 0}, 2. L α = {x R n s R n +s.t.(x, s) P LP and j N α js j 1} 3. X α = L α Z 2 Lemma: If, for a facet defining inequality j N α js j 1 for conv(p I ), N 0 α φ then (π, π 0 ) Z 2 Z s.t. L α {(x 1, x 2 ) : π 0 π 1 x 1 + π 2 x 2 π 0 + 1}. e.g. previous example. Converse is not true.
21 When N 0 α φ Main results of this paper: Every facet is derivable from at most four non-basic variables With every facet, one can associate three or four particular vertices of conv(p I ). These facets can be classified into: 1. Split Cuts 2. Dissection Cuts 3. Lifted two-variable cuts Dissection cuts are not split cuts Lifted two-variable cuts are not split cuts
22 conv(x α ) 1. Recall, X α = L α Z 2 2. conv(x α ) R 2 3. Extreme points of conv(x α ) are integers 4. How many such polygons exist? Which one is Cook s example?
23 conv(x α ) 1. Recall, X α = L α Z 2 2. conv(x α ) R 2 3. Extreme points of conv(x α ) are integers 4. How many such polygons exist? Which one is Cook s example?
24 conv(x α ) 1. Recall, X α = L α Z 2 2. conv(x α ) R 2 3. Extreme points of conv(x α ) are integers 4. How many such polygons exist? Which one is Cook s example?
25 What about L α The main theorem Let j N α js j 1 be a facet defining inequality that satisfies α j > 0 for all j N. Then L α is a polygon with at most four vertices. Proof: Follows from six lemmas. Also, there exists a set S N such that S 4 and j S α js j 1 is facet defining for conv(p I (S)) where, P I (S) = {(x, s) Z n R S + : x = f + s j r j } j S Find this inequality and do simultaneous lifting of coefficients for N\S to get the desire cut.
26 What about L α The main theorem Let j N α js j 1 be a facet defining inequality that satisfies α j > 0 for all j N. Then L α is a polygon with at most four vertices. Proof: Follows from six lemmas. Also, there exists a set S N such that S 4 and j S α js j 1 is facet defining for conv(p I (S)) where, P I (S) = {(x, s) Z n R S + : x = f + s j r j } j S Find this inequality and do simultaneous lifting of coefficients for N\S to get the desire cut.
27 What about L α The main theorem Let j N α js j 1 be a facet defining inequality that satisfies α j > 0 for all j N. Then L α is a polygon with at most four vertices. Proof: Follows from six lemmas. Also, there exists a set S N such that S 4 and j S α js j 1 is facet defining for conv(p I (S)) where, P I (S) = {(x, s) Z n R S + : x = f + s j r j } j S Find this inequality and do simultaneous lifting of coefficients for N\S to get the desire cut.
28 More notation Let k 4 denote the number of vertices of conv(x α ). K = {1,..., k}. Let the set {x ν } ν K denote vertices of conv(x α ). if x X α, is not a ray point, then x = f + s j1 r j1 + s j2 r j2, s j1, s j2 > 0, unique Such a pair (j 1, j 2 ) is said to give a representation of x. Additionally if α j1 s j1 + α j2 s j2, then (j 1, j 2 ) is said to give a tight representaion. If cone({r i1, r i2 }) cone({r j1, r j2 }), then the pair (i 1, i 2 ) is a sub-cone of (j 1, j 2 ). T α ( x) = {(j 1, j 2 ) : (j 1, j 2 ) gives a tight representation of x} Lemma: There exists a unique maximal representation of (j x 1, j x 2 ) T α( x) (One tight representation of x can be used).
29 Where does this lead to? Suppose j N α js j = 1 is a facet of conv(p I ). Then, There exist n affinely independent points in P I that satisfy this equality, Substituting values of s j and solving for α j should give this equality as the unique solution Project these n points on to plane of (x 1, x 2 ). These projections are either vertices of conv(x α ), or they lie on edges of conv(x α ). So...
30 Where does this lead to? After a lot of hand waving, we get: There is a set S, such that S 4 and j α α js j 1 is facet defining for P I (S) L α = conv({f } {ν j } j S )
31 Classification of cuts if each vertex of conv(x α ) belongs to a different L α : Dissection cut if exactly one facet of L α contains two vertices of conv(x α ): Lifted 2-variable cut two facets of L α contain 2 vertices of conv(x α ) each: split cuts What kind of cut is Cook s example?
Cutting planes from two rows of a simplex tableau
Cutting planes from two rows of a simplex tableau K. Andersen Q. Louveaux R. Weismantel L. Wolsey May, 6 Abstract Introduction In this paper a basic geometric object is investigated that allows us to derive
More informationA Lower Bound on the Split Rank of Intersection Cuts
A Lower Bound on the Split Rank of Intersection Cuts Santanu S. Dey H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. 200 Outline Introduction: split rank,
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com October 27, 2016 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationProjected Chvátal-Gomory cuts for Mixed Integer Linear Programs. Pierre Bonami CMU, USA. Gerard Cornuéjols CMU, USA and LIF Marseille, France
Projected Chvátal-Gomory cuts for Mixed Integer Linear Programs Pierre Bonami CMU, USA Gerard Cornuéjols CMU, USA and LIF Marseille, France Sanjeeb Dash IBM T.J. Watson, USA Matteo Fischetti University
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com April 10, 2017 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationSplit Rank of Triangle and Quadrilateral Inequalities
Split Rank of Triangle and Quadrilateral Inequalities Santanu Dey 1 Quentin Louveaux 2 June 4, 2009 Abstract A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two
More informationA Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Juan Pablo Vielma
A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program Juan Pablo Vielma June 26, 2006 Review: MIP and Relaxation We study the MIP feasible region P I := {x P R n : x j
More information1 Maximal Lattice-free Convex Sets
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationOn mixed-integer sets with two integer variables
On mixed-integer sets with two integer variables Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Santanu S. Dey Georgia Inst. Tech. santanu.dey@isye.gatech.edu September 8, 2010 Oktay Günlük IBM Research
More informationSome Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets
Some Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets Sanjeeb Dash a Santanu S. Dey b Oktay Günlük a a Business Analytics and Mathematical Sciences Department, IBM T. J. Watson
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Pierre Bonami Gérard Cornuéjols François Margot Abstract Integer programs defined by two equations with two free integer
More informationThe strength of multi-row models 1
The strength of multi-row models 1 Quentin Louveaux 2 Laurent Poirrier 3 Domenico Salvagnin 4 October 6, 2014 Abstract We develop a method for computing facet-defining valid inequalities for any mixed-integer
More informationMulti-Row Cuts in Integer Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Multi-Row Cuts in Integer Programming Gérard Cornuéjols Tepper School o Business Carnegie Mellon University, Pittsburgh March 2011 Mixed Integer Linear Programming min s.t. cx Ax = b x j Z or j = 1,...,
More informationThe Strength of Multi-Row Relaxations
The Strength of Multi-Row Relaxations Quentin Louveaux 1 Laurent Poirrier 1 Domenico Salvagnin 2 1 Université de Liège 2 Università degli studi di Padova August 2012 Motivations Cuts viewed as facets of
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationOn the Chvatál-Complexity of Binary Knapsack Problems. Gergely Kovács 1 Béla Vizvári College for Modern Business Studies, Hungary
On the Chvatál-Complexity of Binary Knapsack Problems Gergely Kovács 1 Béla Vizvári 2 1 College for Modern Business Studies, Hungary 2 Eastern Mediterranean University, TRNC 2009. 1 Chvátal Cut and Complexity
More informationCorner Polyhedron and Intersection Cuts
Corner Polyhedron and Intersection Cuts Michele Conforti 1,5, Gérard Cornuéjols 2,4 Giacomo Zambelli 3,5 August 2010 Revised March 2011 Abstract Four decades ago, Gomory introduced the corner polyhedron
More informationLinear Algebra Review: Linear Independence. IE418 Integer Programming. Linear Algebra Review: Subspaces. Linear Algebra Review: Affine Independence
Linear Algebra Review: Linear Independence IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 21st March 2005 A finite collection of vectors x 1,..., x k R n
More informationComputational Experiments with Cross and Crooked Cross Cuts
Submitted to INFORMS Journal on Computing manuscript (Please, provide the mansucript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes
More informationCutting Plane Separators in SCIP
Cutting Plane Separators in SCIP Kati Wolter Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies 1 / 36 General Cutting Plane Method MIP min{c T x : x X MIP }, X MIP := {x
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationMinimal Valid Inequalities for Integer Constraints
Minimal Valid Inequalities for Integer Constraints Valentin Borozan LIF, Faculté des Sciences de Luminy, Université de Marseille, France borozan.valentin@gmail.com and Gérard Cornuéjols Tepper School of
More informationDescription of 2-integer continuous knapsack polyhedra
Discrete Optimization 3 (006) 95 0 www.elsevier.com/locate/disopt Description of -integer continuous knapsack polyhedra A. Agra a,, M. Constantino b a Department of Mathematics and CEOC, University of
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationTHE MIXING SET WITH FLOWS
THE MIXING SET WITH FLOWS MICHELE CONFORTI, MARCO DI SUMMA, AND LAURENCE A. WOLSEY Abstract. We consider the mixing set with flows: s + x t b t, x t y t for 1 t n; s R 1 +, x Rn +, y Zn +. It models a
More informationIntersection cuts for single row corner relaxations
Math. Prog. Comp. 28 :423 455 https://doi.org/.7/s2532-8-32-y FULL LENGTH PAPER Intersection cuts for single row corner relaxations Ricardo Fukasawa Laurent Poirrier Álinson S. Xavier Received: 4 May 26
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationOn the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times
CORE DISCUSSION PAPER 2000/52 On the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times Andrew J. Miller 1, George L. Nemhauser 2, and Martin W.P. Savelsbergh 2 November 2000
More informationMarch 2002, December Introduction. We investigate the facial structure of the convex hull of the mixed integer knapsack set
ON THE FACETS OF THE MIXED INTEGER KNAPSACK POLYHEDRON ALPER ATAMTÜRK Abstract. We study the mixed integer knapsack polyhedron, that is, the convex hull of the mixed integer set defined by an arbitrary
More informationMonoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctions and Complementarity Constraints
Monoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctions and Complementarity Constraints Tobias Fischer and Marc E. Pfetsch Department of Mathematics, TU Darmstadt, Germany {tfischer,pfetsch}@opt.tu-darmstadt.de
More informationCutting Planes in SCIP
Cutting Planes in SCIP Kati Wolter Zuse-Institute Berlin Department Optimization Berlin, 6th June 2007 Outline 1 Cutting Planes in SCIP 2 Cutting Planes for the 0-1 Knapsack Problem 2.1 Cover Cuts 2.2
More informationInteger Programming ISE 418. Lecture 13b. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13b Dr. Ted Ralphs ISE 418 Lecture 13b 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationA Note on the MIR closure
A Note on the MIR closure Pierre Bonami Tepper School of Business, Carnegie Mellon University, Pittsburgh PA 53, USA. Gérard Cornuéjols Tepper School of Business, Carnegie Mellon University, Pittsburgh
More informationNon-Recursive Cut Generation
Non-Recursive Cut Generation Aleksandr M. Kazachkov Spring 2018 Tepper School of Business Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Egon Balas (Chair) Daniel Bienstock Gérard Cornuéjols
More informationKey words. Integer nonlinear programming, Cutting planes, Maximal lattice-free convex sets
ON MAXIMAL S-FREE CONVEX SETS DIEGO A. MORÁN R. AND SANTANU S. DEY Abstract. Let S Z n satisfy the property that conv(s) Z n = S. Then a convex set K is called an S-free convex set if int(k) S =. A maximal
More informationThe continuous knapsack set
The continuous knapsack set Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com December 18, 2014 Laurence Wolsey Core laurence.wolsey@uclouvain.be Abstract We study
More informationThe Triangle Closure is a Polyhedron
The Triangle Closure is a Polyhedron Amitabh Basu Robert Hildebrand Matthias Köppe January 8, 23 Abstract Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively
More informationA geometric perspective on lifting
A geometric perspective on lifting Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols Carnegie Mellon University and Université d Aix-Marseille, gc0v@andrew.cmu.edu Giacomo
More informationCombinatorial Optimization
Combinatorial Optimization Lecture notes, WS 2010/11, TU Munich Prof. Dr. Raymond Hemmecke Version of February 9, 2011 Contents 1 The knapsack problem 1 1.1 Complete enumeration..................................
More informationComputational Experiments with Cross and Crooked Cross Cuts
Computational Experiments with Cross and Crooked Cross Cuts Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com Juan Pablo Vielma Massachusetts Institute of Technology
More informationLecture 2. Split Inequalities and Gomory Mixed Integer Cuts. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 2 Split Inequalities and Gomory Mixed Integer Cuts Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh Mixed Integer Cuts Gomory 1963 Consider a single constraint
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More informationThe Triangle Closure is a Polyhedron
The Triangle Closure is a Polyhedron Amitabh Basu Robert Hildebrand Matthias Köppe November 7, 21 Abstract Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 53 abasu@andrew.cmu.edu Pierre Bonami LIF, Faculté
More informationDuality in Linear Programming
Duality in Linear Programming Gary D. Knott Civilized Software Inc. 1219 Heritage Park Circle Silver Spring MD 296 phone:31-962-3711 email:knott@civilized.com URL:www.civilized.com May 1, 213.1 Duality
More informationThe continuous knapsack set
The continuous knapsack set Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com January 31, 2014 Laurence Wolsey Core laurence.wolsey@uclouvain.be Abstract We study
More informationMixing Inequalities and Maximal Lattice-Free Triangles
Mixing Inequalities and Maximal Lattice-Free Triangles Santanu S. Dey Laurence A. Wolsey Georgia Institute of Technology; Center for Operations Research and Econometrics, UCL, Belgium. 2 Outline Mixing
More informationComputing with multi-row Gomory cuts
Computing with multi-row Gomory cuts Daniel G. Espinoza Departamento de Ingeniería Industrial, Universidad de Chile, Av. República 71, Santiago, 837-439, Chile Abstract Recent advances on the understanding
More informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More informationSplit closure and intersection cuts
Math. Program., Ser. A 102: 457 493 (2005) Digital Object Identifier (DOI) 10.1007/s10107-004-0558-z Kent Andersen Gérard Cornuéjols Yanjun Li Split closure and intersection cuts Received: February 4,
More informationThe Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs Santanu S. Dey 1, Andres Iroume 1, and Guanyi Wang 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology
More informationA probabilistic comparison of split and type 1 triangle cuts for two row mixed-integer programs
A probabilistic comparison of split and type 1 triangle cuts for two row mixed-integer programs Qie He, Shabbir Ahmed, George L. Nemhauser H. Milton Stewart School of Industrial & Systems Engineering Georgia
More informationDisjunctive Cuts for Cross-Sections of the Second-Order Cone
Disjunctive Cuts for Cross-Sections of the Second-Order Cone Sercan Yıldız Gérard Cornuéjols June 10, 2014 Abstract In this paper we provide a unified treatment of general two-term disjunctions on crosssections
More informationSequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities Yongpei Guan, Shabbir Ahmed, George L. Nemhauser School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta,
More informationOn the Rank of Cutting-Plane Proof Systems
On the Rank of Cutting-Plane Proof Systems Sebastian Pokutta 1 and Andreas S. Schulz 2 1 H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA. Email:
More informationIBM Research Report. Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming
RC25212 (W1109-107) September 21, 2011 Mathematics IBM Research Report Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz J. Nowicki,
More informationSupplementary lecture notes on linear programming. We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2016 Supplementary lecture notes on linear programming CS 6820: Algorithms 26 Sep 28 Sep 1 The Simplex Method We will present an algorithm to solve linear programs of the form
More informationCutting Planes and Elementary Closures for Non-linear Integer Programming
Cutting Planes and Elementary Closures for Non-linear Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute
More informationn-step mingling inequalities: new facets for the mixed-integer knapsack set
Math. Program., Ser. A (2012) 132:79 98 DOI 10.1007/s10107-010-0382-6 FULL LENGTH PAPER n-step mingling inequalities: new facets for the mixed-integer knapsack set Alper Atamtürk Kiavash Kianfar Received:
More informationMIP reformulations of some chance-constrained mathematical programs
MIP reformulations of some chance-constrained mathematical programs Ricardo Fukasawa Department of Combinatorics & Optimization University of Waterloo December 4th, 2012 FIELDS Industrial Optimization
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationHomework Assignment 4 Solutions
MTAT.03.86: Advanced Methods in Algorithms Homework Assignment 4 Solutions University of Tartu 1 Probabilistic algorithm Let S = {x 1, x,, x n } be a set of binary variables of size n 1, x i {0, 1}. Consider
More informationPolyhedral Approach to Integer Linear Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Polyhedral Approach to Integer Linear Programming Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh 1 / 30 Brief history First Algorithms Polynomial Algorithms Solving
More informationCO350 Linear Programming Chapter 6: The Simplex Method
CO50 Linear Programming Chapter 6: The Simplex Method rd June 2005 Chapter 6: The Simplex Method 1 Recap Suppose A is an m-by-n matrix with rank m. max. c T x (P ) s.t. Ax = b x 0 On Wednesday, we learned
More informationTRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN. School of Mathematics
JS and SS Mathematics JS and SS TSM Mathematics TRINITY COLLEGE DUBLIN THE UNIVERSITY OF DUBLIN School of Mathematics MA3484 Methods of Mathematical Economics Trinity Term 2015 Saturday GOLDHALL 09.30
More informationChange in the State of the Art of (Mixed) Integer Programming
Change in the State of the Art of (Mixed) Integer Programming 1977 Vancouver Advanced Research Institute 24 papers 16 reports 1 paper computational, 4 small instances Report on computational aspects: only
More informationA packing integer program arising in two-layer network design
A packing integer program arising in two-layer network design Christian Raack Arie M.C.A Koster Zuse Institute Berlin Takustr. 7, D-14195 Berlin Centre for Discrete Mathematics and its Applications (DIMAP)
More informationLagrangian Relaxation in MIP
Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationconstraints Ax+Gy» b (thus any valid inequalityforp is of the form u(ax+gy)» ub for u 2 R m + ). In [13], Gomory introduced a family of valid inequali
On the Rank of Mixed 0,1 Polyhedra Λ Gérard Cornuéjols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA (corresponding author: gc0v@andrew.cmu.edu) February
More information3.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationComputing with Multi-Row Intersection Cuts
Computing with Multi-Row Intersection Cuts by Álinson Santos Xavier A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics
More informationLOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA
LOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA Friedrich-Alexander-University of Erlangen-Nürnberg Am Weichselgarten 9 91058 Erlangen Germany ABSTRACT. Valid inequalities or cutting
More informationSome Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets Santanu S. Dey and Diego A. Morán R. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute
More informationOn the Rational Polytopes with Chvátal Rank 1
On the Rational Polytopes with Chvátal Rank 1 Gérard Cornuéjols Dabeen Lee Yanjun Li December 2016, revised May 2018 Abstract We study the following problem: given a rational polytope with Chvátal rank
More informationOn the separation of split cuts and related inequalities
Math. Program., Ser. B 94: 279 294 (2003) Digital Object Identifier (DOI) 10.1007/s10107-002-0320-3 Alberto Caprara Adam N. Letchford On the separation of split cuts and related inequalities Received:
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 53 abasu@andrew.cmu.edu Pierre Bonami LIF, Faculté
More informationCO350 Linear Programming Chapter 5: Basic Solutions
CO350 Linear Programming Chapter 5: Basic Solutions 1st June 2005 Chapter 5: Basic Solutions 1 On Monday, we learned Recap Theorem 5.3 Consider an LP in SEF with rank(a) = # rows. Then x is bfs x is extreme
More informationInformation Theory + Polyhedral Combinatorics
Information Theory + Polyhedral Combinatorics Sebastian Pokutta Georgia Institute of Technology ISyE, ARC Joint work Gábor Braun Information Theory in Complexity Theory and Combinatorics Simons Institute
More informationDiscrete Optimization 2010 Lecture 7 Introduction to Integer Programming
Discrete Optimization 2010 Lecture 7 Introduction to Integer Programming Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Intro: The Matching
More informationLesson 27 Linear Programming; The Simplex Method
Lesson Linear Programming; The Simplex Method Math 0 April 9, 006 Setup A standard linear programming problem is to maximize the quantity c x + c x +... c n x n = c T x subject to constraints a x + a x
More informationOn Counting Lattice Points and Chvátal-Gomory Cutting Planes
On Counting Lattice Points and Chvátal-Gomory Cutting Planes Andrea Lodi 1, Gilles Pesant 2, and Louis-Martin Rousseau 2 1 DEIS, Università di Bologna - andrea.lodi@unibo.it 2 CIRRELT, École Polytechnique
More informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Ricardo Fukasawa University of Waterloo rfukasaw@math.uwaterloo.ca September 16, 2010 Oktay Günlük IBM Research
More informationTRISTRAM BOGART AND REKHA R. THOMAS
SMALL CHVÁTAL RANK TRISTRAM BOGART AND REKHA R. THOMAS Abstract. We introduce a new measure of complexity of integer hulls of rational polyhedra called the small Chvátal rank (SCR). The SCR of an integer
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
More informationComputational Experiments with Cross and Crooked Cross Cuts
Computational Experiments with Cross and Crooked Cross Cuts Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com June 22, 2011 Juan Pablo Vielma University of Pittsburgh
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationStrengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Merve Bodur 1, Sanjeeb Dash 2, Otay Günlü 2, and James Luedte 3 1 Department of Mechanical and Industrial Engineering,
More informationProperties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationLifting Integer Variables in Minimal Inequalities Corresponding To Lattice-Free Triangles
Lifting Integer Variables in Minimal Inequalities Corresponding To Lattice-Free Triangles Santanu S. Dey and Laurence A. Wolsey 2 CORE, 2 CORE and INMA, University Catholique de Louvain, 34, Voie du Roman
More informationKey Things We Learned Last Time. IE418 Integer Programming. Proving Facets Way #2 Indirect. A More Abstract Example
Key Things We Learned Last Time IE48: Integer Programming Department of Industrial and Systems Engineering Lehigh University 8th March 5 A face F is said to be a facet of P if dim(f ) = dim(p ). All facets
More informationMIR Closures of Polyhedral Sets
MIR Closures of Polyhedral Sets Sanjeeb Dash IBM Research Oktay Günlük IBM Research Andrea Lodi Univ. Bologna February 28, 2007 Abstract We study the mixed-integer rounding (MIR) closures of polyhedral
More information