Multi-Row Cuts in Integer Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
|
|
- Curtis Wright
- 5 years ago
- Views:
Transcription
1 Multi-Row Cuts in Integer Programming Gérard Cornuéjols Tepper School o Business Carnegie Mellon University, Pittsburgh March 2011
2 Mixed Integer Linear Programming min s.t. cx Ax = b x j Z or j = 1,..., p x j 0 or j = 1,..., n. Common approach to solving MILP: First solve the LP relaxation. Basic optimal solution: x i = i + j N r j x j or i B. I i Z or some i B {1,..., p}, add cutting planes: Gomory 1963 Mixed Integer Cuts, Marchand and Wolsey 2001 MIR inequalities, Balas, Ceria and Cornuéjols 1993 lit-and-project cuts, or instance, are used in commercial codes.
3 Reerences This talk Borozan and Cornuéjols MOR 2009 Basu, Conorti, Cornuéjols and Zambelli SIDMA 2010 Basu, Conorti, Campelo, Cornuéjols and Zambelli IPCO 2010 Basu, Cornuéjols and Margot working paper 2010 Basu, Cornuéjols and Köppe working paper 2011 Related work Corner polyhedron Gomory LAA 1969 Gomory and Johnson MP 1972 Intersection cuts Balas OR 1971 The work that motivated me Andersen, Louveaux, Weismantel and Wolsey IPCO 2007 Dey and Richard MOR 2008 Dey and Wolsey IPCO 2008, SIOPT 2010
4 Corner Polyhedron Gomory 1969 Relax nonnegativity on basic variables x j. In our work, we make a urther relaxation, as suggested by Andersen, Louveaux, Weismantel and Wolsey 2007 Relax integrality on nonbasic variables. r 1 x = + k j=1 r j s j x Z q s 0 Example ) r 2 x1 Feasible set {( x 2 ( x1 x 2 Z 2 : ) = + r 1 s 1 + r 2 s 2 where s 1 0, s 2 0}
5 Formulas or Deriving Cutting Planes x = + k j=1 r j s j x Z q s 0 Every inequality cutting o the point ( x, s) = (, 0) can be expressed in terms o the nonbasic variables s only, in the orm k j=1 α js j 1. We are interested in ormulas or deriving such inequalities. More ormally, we are interested in unctions ψ : R q R such that the inequality k ψ(r j )s j 1 j=1 is valid or every choice o k and vectors r 1,..., r k R q. Such unctions ψ will be called valid unctions with respect to.
6 Intersection Cuts Balas 1971 Assume Z q. Want to cut o the basic solution s = 0, x =. r 2 S r 1 Any convex set S with int(s) with no integer point in int(s).
7 Intersection Cuts Balas 1971 Assume Z q. Want to cut o the basic solution s = 0, x =. r 2 S r 1 intersection cut Any convex set S with int(s) with no integer point in int(s). The gauge o S, i.e. ψ(r) = in {λ > 0 : 1 λ r S } is a valid unction. Intersection cut: ψ(r 1 )s 1 + ψ(r 2 )s 2 1.
8 Minimal Valid Functions Our main interest is in minimal valid unctions ψ : R q R, i.e. there is no valid unction ψ ψ where ψ (r) < ψ(r) or at least one r R q. r 2 S r 1 Bigger convex set
9 Minimal Valid Functions Our main interest is in minimal valid unctions ψ : R q R, i.e. there is no valid unction ψ ψ where ψ (r) < ψ(r) or at least one r R q. r 2 S r 1 intersection cut Bigger convex set Better cut: ψ(r 1 )s 1 + ψ(r 2 )s 2 1.
10 Theorem Borozan and Cornuéjols MOR 2009 On Q q (extension to R q due to Basu, Conorti, Cornuéjols, Zambelli) Let R q \ Z q. I ψ : R q R is a minimal valid unction, then ψ is nonnegative piecewise linear positively homogeneous and convex. Furthermore B ψ := {x R q : ψ(x ) 1} is a maximal Z q -ree convex set containing in its interior. Conversely, or any maximal Z q -ree convex set B containing in its interior, the gauge o B is a minimal valid unction ψ. DEFINITION A convex set is Z q -ree i it does not have any integral point in its interior. However, it may have integral points on its boundary.
11 Maximal Z q -Free Convex Sets...are polyhedra Lovász 1989 Z q -ree convex set contains no integral point in its interior Maximal: each edge contains an integral point in its relative interior.
12 Maximal Z q -Free Convex Sets...are polyhedra Lovász 1989 Z q -ree convex set contains no integral point in its interior Maximal: each edge contains an integral point in its relative interior.
13 Maximal Z q -Free Convex Sets...are polyhedra Lovász 1989 Z q -ree convex set contains no integral point in its interior Maximal: each edge contains an integral point in its relative interior. In the plane: it is a strip, a triangle or a quadrilateral.
14 Maximal Z q -Free Sets in the Plane Split, triangles and quadrilaterals generate split, triangle and quadrilateral inequalities ψ(r)s r 1, where the unction ψ is the gauge o S..
15 Maximal Z q -Free Sets in the Plane Split, triangles and quadrilaterals generate split, triangle and quadrilateral inequalities ψ(r)s r 1, where the unction ψ is the gauge o S. I S = {x R q : a i (x ) 1, i = 1,..., t}, then ψ = max i=1,...,t a i r.
16 Lovász Theorem THEOREM i and only i A set K R q is a maximal Z q -ree convex set either K is a polyhedron o the orm K = P + L where P is a polytope, L is a rational linear space, dim(p) + dim(l) = p, K does not contain any point o Z q in its interior and there is a point o Z q in the relative interior o each acet o K. or K is an irrational hyperplane. irrational hyperplane cylinder
17 Generalization o the Lovász and Borozan-Cornuéjols theorems Here, we consider a system o the orm x = + k j=1 r j s j x S s 0 where S = P Z q or some rational polyhedron P R q. This model has been studied in the 70s by Glover 1974, Balas 1972 and Johnson 1981, and recently by Dey and Wolsey 2009, and Günlük and Fukusawa Basu, Conorti, Cornuéjols and Zambelli generalize the Lovász and Borozan-Cornuéjols theorems to such systems SIDMA 2010.
18 Integer Liting Dey-Wolsey 2010 QUESTION: How should we deal with INTEGER nonbasic variables?
19 Integer Liting Here, we consider a system o the orm x = + k j=1 r j s j + l i=1 ρi y i x Z q s 0 y Z l. We are interested in unctions ψ : R q R and φ : R q R such that the inequality k ψ(r j )s j + j=1 l φ(ρ i )y i 1 i=1 is valid or every choice o integers k, l and vectors r 1,..., r k R q and ρ 1,..., ρ l R q.
20 Integer Liting Basu, Campelo, Conorti, Cornuéjols, Zambelli IPCO 2010 Starting rom a minimal valid unction ψ : R q R, what can we say about a minimal liting unction φ? Clearly, φ ψ. Are there regions R where we can guarantee that φ(r) = ψ(r) or all r R? THEOREM Let ψ be minimal. φ(r) = ψ(r) or r R = t R(x t) where the union is taken over all integral points x t on the boundary o the maximal Z q -ree convex set B ψ deining ψ. Conversely, i r R, there exists a minimal liting φ where φ(r) < ψ(r). x3 R(x3) R(x2) Bψ R(x1) x1 x2 THEOREM A minimal unction ψ has a unique minimal liting φ i and only i R + Z q covers R q.
21 Body with a Unique Liting Characterizing when the integer liting is unique. Example: Split inequalities, Gomory Mixed Integer Cuts. Another example:
22 Bodies with a Unique Liting Basu, Cornuéjols, Köppe 2011 THEOREM Let B be a maximal lattice-ree simplicial polytope in R n. Then B is either a body with a unique liting or all int(b), or a body with multiple litings or all int(b). THEOREM Let be a simplex in R n such that it is a maximal lattice-ree convex body and each acet o has exactly one integer point in its relative interior. Then is a body with a unique liting or all int(b) i and only i all the vertices o are integral, i.e., is an aine unimodular transormation o conv{0, ne 1,..., ne n }
23 Bodies with a Unique Liting Basu, Cornuéjols, Köppe 2011 THEOREM Let R n+1 be a maximal lattice-ree 2-partitionable simplex with hyperplanes H 1, H 2 such that H 1 deines a acet o and this is the only acet o with more than one lattice point in its relative interior. Then is a body with a unique liting or all int(b) i and only i H 2 is an aine unimodular transormation o conv{0, ne 1,..., ne n } THEOREM Let B R n be a maximal lattice-ree simplicial polytope and let int(b). Then the volume o the region R where the liting is unique is an aine unction o the coordinates o.
24 Split Inequalities Cook-Kannan-Schrijver 1990 Widely used in commercial solvers. QUESTION: Can we generate any intersection cut using a sequence o split inequalities?
25 Split Inequalities Cook-Kannan-Schrijver 1990 P := {x R n : Ax b} S := P (Z p R n p ). For π Z n such that π p+1 =... = π n = 0 and π 0 Z, deine πx π 0 πx π split inequality Π 1 := P {x : πx π 0 } Π 2 := P {x : πx π 0 + 1} Π 1 P Π 2 We call cx c 0 a split inequality i there exists (π, π 0 ) Z p Z such that cx c 0 is valid or Π 1 Π 2.
26 Split Inequalities Cook-Kannan-Schrijver 1990 P := {x R n : Ax b} S := P (Z p R n p ). For π Z n such that π p+1 =... = π n = 0 and π 0 Z, deine πx π 0 πx π split inequality Π 1 := P {x : πx π 0 } Π 2 := P {x : πx π 0 + 1} Π 1 P Π 2 We call cx c 0 a split inequality i there exists (π, π 0 ) Z p Z such that cx c 0 is valid or Π 1 Π 2. The split closure is the intersection o all split inequalities. THEOREM Cook, Kannan, Schrijver 1990 The split closure is a polyhedron.
27 Split Rank Cook-Kannan-Schrijver 1990 P := {x R n : Ax b} S := P (Z p R n p ). Let P 0 = P. For k 1, let P k denote the split closure o P k 1. Let αx β be a valid inequality or conv(s). The smallest k such that αx β is valid or P k is called the split rank o αx β, i such an integer k exists.
28 Split Rank Cook-Kannan-Schrijver 1990 Let P 0 = P. For k 1, let P k denote the split closure o P k 1. Let αx β be a valid inequality or conv(s). The smallest k such that αx β is valid or P k is called the split rank o αx β, i such an integer k exists. In the mixed integer case, inequalities may have ininite split rank, i.e. there is no inite k such that αx β is valid or P k, as shown by the ollowing example. O C B A P is a simplex with vertices O = (0, 0, 0), A = (2, 0, 0), B = (0, 2, 0) and C = ( 1 2, 1 2, 1 2 ). S := P (Z 2 R). Thus conv(s) = P {y 0}.
29 Split Rank Cook-Kannan-Schrijver 1990 In the mixed integer case, inequalities may have ininite split rank, i.e. there is no inite k such that αx β is valid or P k, as shown by the ollowing example. O C B A P is a simplex with vertices O = (0, 0, 0), A = (2, 0, 0), B = (0, 2, 0) and C = ( 1 2, 1 2, 1 2 ). S := P (Z 2 R). Thus conv(s) = P {y 0}. Consider a simplex P with vertices O, A, B and C = ( 1 2, 1 2, t) with t > 0. Let C 1 = C, let C 2 be the point on the edge AC with coordinate x 1 = 1 and C 3 the point on BC with x 2 = 1. Observe that no split disjunction removes all three points C 1, C 2, C 3. Thus ( 1 2, 1 2, t 3 ) P1. By induction, ( 1 2, 1 2, t 3 k ) P k. Thereore y 0 has ininite split rank.
30 The Andersen-Louveaux-Weismantel-Wolsey Model The Cook-Kannan-Schrijver example can be written as x 1 y, x 2 y, x 1 + x 2 + 2y 2. Introducing nonnegative slack variables, and eliminating y, we get Note that y 0 s 1 + s 2 + s 3 2 Remember the Andersen, Louveaux, Weismantel, Wolsey 2007 model: x 1 = s s s 3 x 2 = s s s 3 x i Z or i = 1, 2 s j 0 or j = 1, 2, 3. x 1 = 1 + n j=1 r j 1 s j x 2 = 2 + n j=1 r j 2 s j x i Z or i = 1, 2 s j 0 or j = 1,..., n.
31 The Cook-Kannan-Schrijver Example Continued (0,1) r 2 r 1 r 3 (0,0) (1,0) x 1 = s s s 3 x 2 = s s s 3 x i Z or i = 1, 2 s j 0 or j = 1, 2, 3. Recall: Inequality with ininite split rank is s 1 + s 2 + s 3 2 This is the intersection cut associated with the triangle (0,1) r 2 r 1 r 3 (0,0) (1,0)
32 The Dey-Louveaux Theorem 2009 Andersen, Louveaux, Weismantel, Wolsey 2007 model in R 2 : x 1 = 1 + n j=1 r j 1 s j x 2 = 2 + n j=1 r j 2 s j x i Z or i = 1, 2 s j 0 or j = 1,..., n. THEOREM Every intersection cut has a inite split rank, except or those generated rom a maximal Z 2 -ree triangle with integral vertices and rays pointing to the corners. (0,1) r 2 r 1 r 3 (0,0) (1,0)
33 A Property o the Triangles that Generate Intersection Cuts with Ininite Split Rank (0,1) r 2 (0,1) r 2 r 1 r 3 (0,0) (1,0) r 1 r 3 (0,0) (1,0) Not all integral points can it on the two parallel lines o a split. IMPRECISE DEFINITION I every integral point o K R q lies on the two parallel hyperplanes o a split, we say that K has the 2-hyperplane property.
34 Intersection Cuts with Finite Split Rank THEOREM Basu, Cornuéjols, Margot 2010 Let K be a rational lattice-ree polytope in R q containing in its interior and having rays going into its corners. The intersection cut arising rom K has inite split rank i and only i K has the 2-hyperplane property. PRECISE DEFINITION A set S o points in R q is 2-partitionable i either S 1 or there exists a partition o S into nonempty sets S 1, S 2 and a split such that S 1 is contained in one o its boundary hyperplanes and S 2 is contained in the other. A polytope is 2-partitionable i its integer points are 2-partitionable. Let K I be the convex hull o the integer points in K. We say that K has the 2-hyperplane property i every ace o K I that is not contained in a acet o K is 2-partitionable.
35 Idea o Proo I K does not have the 2-hyperplane property, it is not too hard to show that the intersection cut arising rom K has ininite split rank. The diicult part o the theorem is to show i K has the 2-hyperplane property, then the intersection cut arising rom K has inite split rank. Our proo is by induction on the dimension q. We deine the notions o intersecting split and englobing split, and we show that the theorem holds when there is a sequence o intersecting splits ollowed by an englobing split. We use Chvátal cuts to reduce K to K I. The theorem is proved by replacing each o the Chvátal cuts by a inite collection o intersecting splits or enlarged polytopes, and using the 2-hyperplane property or proving that a inal englobing split exists.
36 Thank you Papers available on
Polyhedral 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 informationUnique lifting of integer variables in minimal inequalities
Unique liting o integer variables in minimal inequalities Amitabh Basu 1, Manoel Campêlo 2,6, Michele Conorti 3,8, Gérard Cornuéjols 4,7, Giacomo Zambelli 5,8 December 6, 2011 Abstract This paper contributes
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 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 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 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 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 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 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 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 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 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 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 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 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 informationMaximal lattice-free convex sets in linear subspaces
Maximal lattice-free convex sets in linear subspaces Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols Carnegie
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 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 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 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 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 informationOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Yogesh Awate Tepper School of Business, Carnegie Mellon University, Pittsburgh,
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 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 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 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 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 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 informationSufficiency of Cut-Generating Functions
Sufficiency of Cut-Generating Functions Gérard Cornuéjols 1, Laurence Wolsey 2, and Sercan Yıldız 1 1 Tepper School of Business, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA 15213, United
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 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 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 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 informationConvex Sets and Minimal Sublinear Functions
Convex Sets and Minimal Sublinear Functions Amitabh Basu Gérard Cornuéjols Giacomo Zambelli April 2010 Abstract We show that, given a closed convex set K containing the origin in its interior, the support
More informationA geometric approach to cut-generating functions
A geometric approach to cut-generating functions Amitabh Basu Michele Conforti Marco Di Summa February 18, 2015 Abstract The cutting-plane approach to integer programming was initiated more that 40 years
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 informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
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 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 informationOPTIMA. Mathematical Programming Society Newsletter. 1 Steve Wright, MPS Chair s Column
OPTIMA Mathematical Programming Society Newsletter 80 Steve Wright MPS Chair s Column September 6, 2009. I m writing in the wake of ISMP 2009 in Chicago, which ended last weekend. All involved in the organization
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 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 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 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 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 informationOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Yogesh Awate Tepper School of Business, Carnegie Mellon University, Pittsburgh,
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 informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash Ricardo Fukasawa IBM Research February 17, 2009 Oktay Günlük Abstract The master equality polyhedron (MEP) is a canonical set that generalizes
More informationOn the knapsack closure of 0-1 Integer Linear Programs
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti 1 Dipartimento di Ingegneria dell Informazione University of Padova Padova, Italy Andrea Lodi 2 Dipartimento di Elettronica, Informatica
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 informationWhen the Gomory-Chvátal Closure Coincides with the Integer Hull
Date for Revised Manuscript: December 19, 2017 When the Gomory-Chvátal Closure Coincides with the Integer Hull Gérard Cornuéjols Yanjun Li Abstract Gomory-Chvátal cuts are prominent in integer programming.
More informationCutting Planes for Mixed-Integer Programming: Theory and Practice
Cutting Planes for Mixed-Integer Programming: Theory and Practice Oktay Günlük Math Sciences, IBM Research April 2018 ORF523, Princeton Mathematical optimization 1 A generic mathematical optimization problem:
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
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 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 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 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 informationStructure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University Joint work with Sercan Yıldız
More informationHow tight is the corner relaxation? Insights gained from the stable set problem
How tight is the corner relaxation? Insights gained from the stable set problem Gérard Cornuéjols a,1, Carla Michini b,,, Giacomo Nannicini c,3 a Tepper School of Business, Carnegie Mellon University,
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 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 informationConstant factor approximations with families of intersection cuts
Constant factor approximations with families of intersection cuts Gennadiy Averkov, Amitabh Basu 2,, and Joseph Paat 2, Institute of Mathematical Optimization, Faculty of Mathematics, University of Magdeburg,
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 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 informationCarnegie Mellon University, Pittsburgh, USA. April Abstract
Elementary Closures for Integer Programs Gerard Cornuejols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA April 2000 (revised October 2000) Abstract
More informationCutting planes from two rows of simplex tableau
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 -
More informationOn Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
On ome Polytopes Contained in the 0,1 Hypercube that Have a mall Chvátal Rank Gérard Cornuéjols Dabeen Lee April 2016, revised July 2017 Abstract In this paper, we consider polytopes P that are contained
More informationSplit Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed 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 of Technology University
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 informationMaximal S-free convex sets and the Helly number
Maximal S-free convex sets and the Helly number Michele Conforti Marco Di Summa Abstract Given a subset S of R d, the Helly number h(s) is the largest size of an inclusionwise minimal family of convex
More informationSplit cuts and extended formulations for Mixed Integer Conic Quadratic Programming
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.
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 informationMixed-integer linear representability, disjunctions, and variable elimination
Mixed-integer linear representability, disjunctions, and variable elimination Amitabh Basu Kipp Martin Christopher Thomas Ryan Guanyi Wang December 19, 2016 Abstract Jeroslow and Lowe gave an exact geometric
More informationThe structure of the infinite models in integer programming
The structure of the infinite models in integer programming January 10, 2017 Not Again! Well, Aussois is partly responsible... Some years ago: Not Again! Well, Aussois is partly responsible... Some years
More informationTheoretical challenges towards cutting-plane selection
Theoretical challenges towards cutting-plane selection Santanu S. Dey 1 and Marco Molinaro 2 1 School of Industrial and Systems Engineering, Georgia Institute of Technology 2 Computer Science Department,
More informationMixed-integer linear representability, disjunctions, and Chvátal functions modeling implications
1 2 3 4 Mixed-integer linear representability, disjunctions, and Chvátal functions modeling implications Amitabh Basu Kipp Martin Christopher Thomas Ryan Guanyi Wang October 26, 2017 5 6 7 8 9 10 11 12
More informationStructure of Valid Inequalities for Mixed Integer Conic Programs
Structure of Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University 18 th Combinatorial Optimization Workshop Aussois, France January
More informationarxiv: v1 [math.oc] 16 Sep 2018
When Lift-and-Project Cuts are Different arxiv:1809.05794v1 [math.oc] 16 Sep 2018 Egon Balas* Carnegie Mellon University, eb17@andrew.cmu.edu, https://www.cmu.edu/tepper/faculty-and-research/faculty-by-area/profiles/balas-egon.html
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 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 informationOn Sublinear Inequalities for Mixed Integer Conic Programs
Noname manuscript No. (will be inserted by the editor) On Sublinear Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Daniel E. Steffy Submitted: December 2014; Revised: July 7, 2015 Abstract
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
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 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 informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationOn Sublinear Inequalities for Mixed Integer Conic Programs
Noname manuscript No. (will be inserted by the editor) On Sublinear Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Daniel E. Steffy Submitted: December 2014; Revised: July 2015 Abstract
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 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 informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationOuter-Product-Free Sets for Polynomial Optimization and Oracle-Based Cuts
Outer-Product-Free Sets for Polynomial Optimization and Oracle-Based Cuts Daniel Bienstock 1, Chen Chen 1, and Gonzalo Muñoz 1 1 Industrial Engineering & Operations Research, Columbia University, New York,
More informationSome cut-generating functions for second-order conic sets
Some cut-generating functions for second-order conic sets Asteroide Santana 1 and Santanu S. Dey 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology June 1, 2016 Abstract
More informationBalas formulation for the union of polytopes is optimal
Balas formulation for the union of polytopes is optimal Michele Conforti, Marco Di Summa, Yuri Faenza October 26, 27 Abstract A celebrated theorem of Balas gives a linear mixed-integer formulation for
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationTwo-Term Disjunctions on the Second-Order Cone
Noname manuscript No. (will be inserted by the editor) Two-Term Disjunctions on the Second-Order Cone Fatma Kılınç-Karzan Sercan Yıldız the date of receipt and acceptance should be inserted later Abstract
More informationInteger programming, Barvinok s counting algorithm and Gomory relaxations
Integer programming, Barvinok s counting algorithm and Gomory relaxations Jean B. Lasserre LAAS-CNRS, Toulouse, France Abstract We propose an algorithm based on Barvinok s counting algorithm for P max{c
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 informationLifting properties of maximal lattice-free polyhedra
Lifting properties of maximal lattice-free polyhedra Gennadiy Averkov and Amitabh Basu January 16, 2015 Abstract We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal
More informationInteger Programming Duality
Integer Programming Duality M. Guzelsoy T. K. Ralphs July, 2010 1 Introduction This article describes what is known about duality for integer programs. It is perhaps surprising that many of the results
More informationA computational study of Gomory cut generators
A computational study of Gomory cut generators Gerard Cornuéjols 1, François Margot 1, Giacomo Nannicini 2 1. CMU Tepper School of Business, Pittsburgh, PA. 2. Singapore University of Technology and Design,
More information