LP Relaxations of Mixed Integer Programs
|
|
- Josephine Logan
- 5 years ago
- Views:
Transcription
1 LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY USA February 2015 Mitchell LP Relaxations 1 / 29
2 LP Relaxations LP relaxations We want to solve an integer program by solving a sequence of linear programs. We can relax the integrality constraints to give an LP relaxation. Let S := {x Z n : Ax b, x 0} = Z n P where P := {x R n : Ax b, x 0}. Since we restrict x 0, the polyhedron P has extreme points if it is nonempty. Mitchell LP Relaxations 2 / 29
3 LP Relaxations Convex hull of S Theorem The convex hull of S is a polyhedron. The proof is in Nemhauser and Wolsey. It is important to note that the extreme rays of conv(s) are the extreme rays of P. Mitchell LP Relaxations 3 / 29
4 LP Relaxations Equivalent LP formulation Our integer program of interest is min{c T x : x S} (IP). We relate this to the linear program min{c T x : x conv(s)} (CIP). We don t know the constraints of the linear program (CIP) explicitly. Mitchell LP Relaxations 4 / 29
5 LP Relaxations (IP) and (CIP) S c T x = z Mitchell LP Relaxations 5 / 29
6 LP Relaxations (IP) and (CIP) S conv(s) c T x = z Mitchell LP Relaxations 5 / 29
7 Value of (IP) and (CIP) LP Relaxations Theorem For any c R n, we have: 1 The objective value of (IP) is unbounded below if and only if the objective value of (CIP) is unbounded below. 2 If (CIP) has a bounded optimal value then it has an optimal solution that is an optimal solution to (IP). This optimal solution is an extreme point of conv(s). 3 If x 0 is an optimal solution to (IP) then it is an optimal solution to (CIP). The proof is in the text. It relies on the fact that the minimizer of a concave function over a convex set is at an extreme point. Mitchell LP Relaxations 6 / 29
8 Value of (IP) and (CIP) LP Relaxations Theorem For any c R n, we have: 1 The objective value of (IP) is unbounded below if and only if the objective value of (CIP) is unbounded below. 2 If (CIP) has a bounded optimal value then it has an optimal solution that is an optimal solution to (IP). This optimal solution is an extreme point of conv(s). 3 If x 0 is an optimal solution to (IP) then it is an optimal solution to (CIP). The proof is in the text. It relies on the fact that the minimizer of a concave function over a convex set is at an extreme point. Mitchell LP Relaxations 6 / 29
9 Value of (IP) and (CIP) LP Relaxations Theorem For any c R n, we have: 1 The objective value of (IP) is unbounded below if and only if the objective value of (CIP) is unbounded below. 2 If (CIP) has a bounded optimal value then it has an optimal solution that is an optimal solution to (IP). This optimal solution is an extreme point of conv(s). 3 If x 0 is an optimal solution to (IP) then it is an optimal solution to (CIP). The proof is in the text. It relies on the fact that the minimizer of a concave function over a convex set is at an extreme point. Mitchell LP Relaxations 6 / 29
10 Value of (IP) and (CIP) LP Relaxations Theorem For any c R n, we have: 1 The objective value of (IP) is unbounded below if and only if the objective value of (CIP) is unbounded below. 2 If (CIP) has a bounded optimal value then it has an optimal solution that is an optimal solution to (IP). This optimal solution is an extreme point of conv(s). 3 If x 0 is an optimal solution to (IP) then it is an optimal solution to (CIP). The proof is in the text. It relies on the fact that the minimizer of a concave function over a convex set is at an extreme point. Mitchell LP Relaxations 6 / 29
11 LP Relaxations Possible cases for an integer linear program Corollary (IP) is either unbounded or infeasible or has an optimal solution. Mitchell LP Relaxations 7 / 29
12 Set up LP relaxation LP Relaxations So in principle, could solve (IP) by solving the linear program (CIP). But we don t know a polyhedral description of conv(s). Look at the LP relaxation min {c T x : Ax b, x 0} = min {c T x : x P}. (LP) Mitchell LP Relaxations 8 / 29
13 LP Relaxations Compare (IP) to LP relaxation We can relate (LP) to (IP) in the following theorem. The proof exploits the fact that S P. Theorem Let z LP and z IP be the optimal values of (LP) and (IP) respectively. 1 If P = then S =. 2 If z LP is finite then either S = or z IP is finite. If S then z IP z LP. 3 If x LP is optimal for (LP) and if x LP Z n then x LP is optimal for (IP). Mitchell LP Relaxations 9 / 29
14 LP Relaxations Compare (IP) to LP relaxation We can relate (LP) to (IP) in the following theorem. The proof exploits the fact that S P. Theorem Let z LP and z IP be the optimal values of (LP) and (IP) respectively. 1 If P = then S =. 2 If z LP is finite then either S = or z IP is finite. If S then z IP z LP. 3 If x LP is optimal for (LP) and if x LP Z n then x LP is optimal for (IP). Mitchell LP Relaxations 9 / 29
15 LP Relaxations Compare (IP) to LP relaxation We can relate (LP) to (IP) in the following theorem. The proof exploits the fact that S P. Theorem Let z LP and z IP be the optimal values of (LP) and (IP) respectively. 1 If P = then S =. 2 If z LP is finite then either S = or z IP is finite. If S then z IP z LP. 3 If x LP is optimal for (LP) and if x LP Z n then x LP is optimal for (IP). Mitchell LP Relaxations 9 / 29
16 LP Relaxations Compare (IP) to LP relaxation We can relate (LP) to (IP) in the following theorem. The proof exploits the fact that S P. Theorem Let z LP and z IP be the optimal values of (LP) and (IP) respectively. 1 If P = then S =. 2 If z LP is finite then either S = or z IP is finite. If S then z IP z LP. 3 If x LP is optimal for (LP) and if x LP Z n then x LP is optimal for (IP). Mitchell LP Relaxations 9 / 29
17 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {x R n + : Ax b} Soln to LP relaxation conv(s) Mitchell LP Relaxations 10 / 29
18 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {x R n + : Ax b} Cutting plane a1 T x = b 1 Soln to LP relaxation conv(s) Mitchell LP Relaxations 10 / 29
19 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {x R n + : Ax b, a1 T x b 1} Soln to LP relaxation conv(s) Mitchell LP Relaxations 10 / 29
20 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {x R n + : Ax b, a T 1 x b 1} Cutting plane a 2 T x = b 2 Soln to LP relaxation conv(s) Mitchell LP Relaxations 10 / 29
21 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {y R n + : Ax b, a1 T x b 1, a2 T x b 2} Solution to LP relaxation conv(s) Mitchell LP Relaxations 10 / 29
22 LP Relaxations Cutting plane algorithm illustration Solve linear program relaxation {x R n + : Ax b, a1 T x b 1, a2 T x b 2} Solution to LP relaxation conv(s) Solution is integral, so optimal to IP Mitchell LP Relaxations 10 / 29
23 LP Relaxations A cutting plane approach An integer program has many LP relaxations. The aim of a cutting plane approach is to add linear constraints to the original LP relaxation in order to tighten up the LP relaxation. These linear constraints are satisfied by every point in S but they might not be satisfied by every point in P. Adding these constraints gives an improved LP relaxation of the integer program. We would like to improve the relaxation so that it resembles conv(s) in some sense, at least in the neighborhood of an optimal solution to (IP). Mitchell LP Relaxations 11 / 29
24 Polyhedral description of conv(s) We would like to get a polyhedral description of conv(s). We d like as compact a description as possible. We first set up some notation. Given a matrix A R m n and a vector b R m, we construct the polyhedron Q := {x R n : Ax b}. Note: We have changed notation from Section 1. In particular, any nonnegativity constraints are included in the system Ax b. Mitchell LP Relaxations 12 / 29
25 Example 0 Full-dimensional example Q := x R 2 : x 1 + x 2 6 x 2 6 x 1 x 2 2 2x 1 + x 2 10 x 1 0 x 2 0 Mitchell LP Relaxations 13 / 29
26 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 3 x 1 + x 2 3 3x 1 + x 2 3 x 1 0 x 2 0 Mitchell LP Relaxations 14 / 29
27 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 4 x 1 + x 2 4 x 1 0 x 2 0 Mitchell LP Relaxations 15 / 29
28 Implicit equality constraints We construct three sets of indices: M := {1,..., m} M = := {i M : A T i x = b i x Q} M := M \ M = = {i M : A T i x > b i for some x Q}. We also use the notation A =, A, b = and b in an analogous way. Mitchell LP Relaxations 16 / 29
29 Example 0 Full-dimensional example Q := x R 2 : x 1 + x 2 6 M x 2 6 M x 1 x 2 2 M 2x 1 + x 2 10 M x 1 0 M x 2 0 M Mitchell LP Relaxations 17 / 29
30 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 3 M = x 1 + x 2 3 M = 3x 1 + x 2 3 M x 1 0 M x 2 0 M Mitchell LP Relaxations 18 / 29
31 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 4 M = x 1 + x 2 4 M = x 1 0 M = x 2 0 M Mitchell LP Relaxations 19 / 29
32 Valid inequalities Describing Polyhedra by Facets Definition The inequality π T x π 0 is a valid inequality for Q if it is satisfied by all points in Q. We also represent the inequality using the pair (π, π 0 ). Definition Let π T x π 0 be a valid inequality for Q. Let H = {x R n : π T x = π 0 } so F := Q H is a face of Q. Then (π, π 0 ) represents F. If F then (π, π 0 ) supports Q. We extend the notation M =, M to the face F using the notation M = F, M F. Mitchell LP Relaxations 20 / 29
33 Valid inequalities Describing Polyhedra by Facets Definition The inequality π T x π 0 is a valid inequality for Q if it is satisfied by all points in Q. We also represent the inequality using the pair (π, π 0 ). Definition Let π T x π 0 be a valid inequality for Q. Let H = {x R n : π T x = π 0 } so F := Q H is a face of Q. Then (π, π 0 ) represents F. If F then (π, π 0 ) supports Q. We extend the notation M =, M to the face F using the notation M = F, M F. Mitchell LP Relaxations 20 / 29
34 Impicit equalities for faces Proposition If F is a nonempty face of Q then F is a polyhedron and F = {x R n : ai T x = b i i M F =, at i x b i i M F }, where M F = M= and M F M. Mitchell LP Relaxations 21 / 29
35 Facets Proposition If F is a facet of Q then there exists some inequality a T k x b k with k M that represents F. Proof. Now dim(f) = dim(p)-1, so rank(a = F, b= F ) = rank(a=, b = ) + 1. Therefore, we only need one inequality in M that is in M F =, and this inequality represents the facet. Mitchell LP Relaxations 22 / 29
36 Facets Proposition If F is a facet of Q then there exists some inequality a T k x b k with k M that represents F. Proof. Now dim(f) = dim(p)-1, so rank(a = F, b= F ) = rank(a=, b = ) + 1. Therefore, we only need one inequality in M that is in M F =, and this inequality represents the facet. Mitchell LP Relaxations 22 / 29
37 One inequality per facet Proposition For each facet F of Q, one of the inequalities representing F is necessary in the description of Q. Proposition Every inequality a T i x b i for i M that represents a face of Q of dimension less than dim(q) 1 is irrelevant to the description of Q. Thus, later we will emphasize finding facets of the convex hull of S. Mitchell LP Relaxations 23 / 29
38 One inequality per facet Proposition For each facet F of Q, one of the inequalities representing F is necessary in the description of Q. Proposition Every inequality a T i x b i for i M that represents a face of Q of dimension less than dim(q) 1 is irrelevant to the description of Q. Thus, later we will emphasize finding facets of the convex hull of S. Mitchell LP Relaxations 23 / 29
39 Minimal representation of polyhedron With these propositions, we can now state two theorems showing how a polyhedron can be minimally represented using linear equalities and inequalities. Theorem (full dimensional case) A full dimensional polyhedron Q has a unique (to within scalar multiplication) minimal representation by a finite set of linear inequalities. In particular, for each facet F i of Q with i = 1,..., t, there is an inequality a T i x b i (unique to within scalar multiplication) representing F i and Q = {x R n : a T i x b i, i = 1,..., t}. Mitchell LP Relaxations 24 / 29
40 Example 0 Full-dimensional example Q := x R 2 : x 1 + x 2 6 M x 2 6 M x 1 x 2 2 M 2x 1 + x 2 10 M x 1 0 M x 2 0 M Mitchell LP Relaxations 25 / 29
41 Example 0 Full-dimensional example Q := x R 2 : x 1 + x 2 6 M x 2 6 M x 1 x 2 2 M 2x 1 + x 2 10 M x 1 0 M x 2 0 M Mitchell LP Relaxations 25 / 29
42 Minimal representation of polyhedron Theorem (not full dimensional) If dim(q) = n k with k > 0 then let t be the number of facets F i of Q, and we have Q = {x R n : a T i x = b i for i = 1,..., k, a T i x b i for i = k + 1,..., k + t}. The set {(a i, b i ) : i = 1,..., k} is a maximal set of linearly independent rows of (A =, b = ). For i = k + 1,..., k + t, (a i, b i ) is any inequality from the equivalence class of inequalities representing the facet F i of Q. Mitchell LP Relaxations 26 / 29
43 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 3 M = x 1 + x 2 3 M = 3x 1 + x 2 3 M x 1 0 M x 2 0 M Mitchell LP Relaxations 27 / 29
44 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 = 3 M = x 1 + x 2 3 M = 3x 1 + x 2 3 M x 1 0 M x 2 0 M Mitchell LP Relaxations 27 / 29
45 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 3 M = x 1 + x 2 = 3 M = 3x 1 + x 2 3 M x 1 0 M x 2 0 M Mitchell LP Relaxations 27 / 29
46 Example 1 First example with implicit equality in R 2 Q := x R 2 : x 1 + x 2 3 M = x 1 + x 2 = 3 M = 3x 1 + x 2 3 M x 1 0 M x 2 0 M Mitchell LP Relaxations 27 / 29
47 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 4 M = x 1 + x 2 4 M = x 1 0 M = x 2 0 M Mitchell LP Relaxations 28 / 29
48 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 4 M = x 1 + x 2 = 4 M = x 1 = 0 M = x 2 0 M Mitchell LP Relaxations 28 / 29
49 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 = 4 M = x 1 + x 2 4 M = x 1 = 0 M = x 2 0 M Mitchell LP Relaxations 28 / 29
50 Example 2 Second example with implicit equality in R 2 Q := x R 2 : 2x 1 + x 2 = 4 M = x 1 + x 2 = 4 M = x 1 0 M = x 2 0 M Mitchell LP Relaxations 28 / 29
51 Summary The aim in a cutting plane approach is to try to develop a minimal description of the polyhedron conv(s), at least in the neighborhood of an optimal point to (IP). This pair of theorems tells us that it is enough to determine all the facets of conv(s), as well as a description of the affine hull of conv(s). Mitchell LP Relaxations 29 / 29
Chapter 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 informationComputational Integer Programming Universidad de los Andes. Lecture 1. Dr. Ted Ralphs
Computational Integer Programming Universidad de los Andes Lecture 1 Dr. Ted Ralphs MIP Lecture 1 1 Quick Introduction Bio Course web site Course structure http://coral.ie.lehigh.edu/ ted/teaching/mip
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 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 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 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 informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
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 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 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 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 informationTHE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM LEVI DELISSA. B.S., Kansas State University, 2014
THE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM by LEVI DELISSA B.S., Kansas State University, 2014 A THESIS submitted in partial fulfillment of the
More informationSolving the MWT. Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP:
Solving the MWT Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP: max subject to e i E ω i x i e i C E x i {0, 1} x i C E 1 for all critical mixed cycles
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 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 informationThe Ellipsoid Algorithm
The Ellipsoid Algorithm John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA 9 February 2018 Mitchell The Ellipsoid Algorithm 1 / 28 Introduction Outline 1 Introduction 2 Assumptions
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
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 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 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 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 informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationLinear and Integer Optimization (V3C1/F4C1)
Linear and Integer Optimization (V3C1/F4C1) Lecture notes Ulrich Brenner Research Institute for Discrete Mathematics, University of Bonn Winter term 2016/2017 March 8, 2017 12:02 1 Preface Continuous updates
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
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 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 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 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 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 informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
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 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 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 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 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 informationMath Models of OR: Branch-and-Bound
Math Models of OR: Branch-and-Bound John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA November 2018 Mitchell Branch-and-Bound 1 / 15 Branch-and-Bound Outline 1 Branch-and-Bound
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 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 informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
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 informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
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 informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
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 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 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 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 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 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 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 informationOn the Value Function of a Mixed Integer Linear Optimization Problem and an Algorithm for its Construction
On the Value Function of a Mixed Integer Linear Optimization Problem and an Algorithm for its Construction Ted K. Ralphs and Anahita Hassanzadeh Department of Industrial and Systems Engineering, Lehigh
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 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 information1. Consider the following polyhedron of an LP problem: 2x 1 x 2 + 5x 3 = 1 (1) 3x 2 + x 4 5 (2) 7x 1 4x 3 + x 4 4 (3) x 1, x 2, x 4 0
MA Linear Programming Tutorial 3 Solution. Consider the following polyhedron of an LP problem: x x + x 3 = ( 3x + x 4 ( 7x 4x 3 + x 4 4 (3 x, x, x 4 Identify all active constraints at each of the following
More informationLifted Inequalities for 0 1 Mixed-Integer Bilinear Covering Sets
1 2 3 Lifted Inequalities for 0 1 Mixed-Integer Bilinear Covering Sets Kwanghun Chung 1, Jean-Philippe P. Richard 2, Mohit Tawarmalani 3 March 1, 2011 4 5 6 7 8 9 Abstract In this paper, we study 0 1 mixed-integer
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 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 informationLinear Programming. Chapter Introduction
Chapter 3 Linear Programming Linear programs (LP) play an important role in the theory and practice of optimization problems. Many COPs can directly be formulated as LPs. Furthermore, LPs are invaluable
More informationMixed-integer nonlinear programming, Conic programming, Duality, Cutting
A STRONG DUAL FOR CONIC MIXED-INTEGER PROGRAMS DIEGO A. MORÁN R., SANTANU S. DEY, AND JUAN PABLO VIELMA Abstract. Mixed-integer conic programming is a generalization of mixed-integer linear programming.
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationNonconvex Quadratic Programming: Return of the Boolean Quadric Polytope
Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope Kurt M. Anstreicher Dept. of Management Sciences University of Iowa Seminar, Chinese University of Hong Kong, October 2009 We consider
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 informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
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 informationTight Formulations for Some Simple Mixed Integer Programs and Convex Objective Integer Programs
Tight Formulations for Some Simple Mixed Integer Programs and Convex Objective Integer Programs Andrew J. Miller 1 Laurence A. Wolsey 2 March 19, 2008 Abstract We study the polyhedral structure of simple
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 informationInteger and Combinatorial Optimization: Introduction
Integer and Combinatorial Optimization: Introduction John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA November 2018 Mitchell Introduction 1 / 18 Integer and Combinatorial Optimization
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More informationAM 121: Intro to Optimization! Models and Methods! Fall 2018!
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 13: Branch and Bound (I) Yiling Chen SEAS Example: max 5x 1 + 8x 2 s.t. x 1 + x 2 6 5x 1 + 9x 2 45 x 1, x 2 0, integer 1 x 2 6 5 x 1 +x
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 informationAM 121: Intro to Optimization! Models and Methods! Fall 2018!
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 15: Cutting plane methods Yiling Chen SEAS Lesson Plan Cut generation and the separation problem Cutting plane methods Chvatal-Gomory
More informationMath Models of OR: Extreme Points and Basic Feasible Solutions
Math Models of OR: Extreme Points and Basic Feasible Solutions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 1180 USA September 018 Mitchell Extreme Points and Basic Feasible Solutions
More informationStrong Dual for Conic Mixed-Integer Programs
Strong Dual for Conic Mixed-Integer Programs Diego A. Morán R. Santanu S. Dey Juan Pablo Vielma July 14, 011 Abstract Mixed-integer conic programming is a generalization of mixed-integer linear programming.
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 informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
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 informationMath Models of OR: Some Definitions
Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Some Definitions 1 / 20 Active constraints Outline 1 Active constraints
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 informationInteger and Combinatorial Optimization: The Cut Generation LP
Integer and Combinatorial Optimization: The Cut Generation LP John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA March 2019 Mitchell The Cut Generation LP 1 / 15 General disjunctions
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationMinimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane Alberto Del Pia Department of Industrial and Systems Engineering & Wisconsin Institutes for Discovery, University of Wisconsin-Madison
More informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
More informationConstrained Optimization Theory
Constrained Optimization Theory Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Constrained Optimization Theory IMA, August
More informationAN INTRODUCTION TO CONVEXITY
AN INTRODUCTION TO CONVEXITY GEIR DAHL NOVEMBER 2010 University of Oslo, Centre of Mathematics for Applications, P.O.Box 1053, Blindern, 0316 Oslo, Norway (geird@math.uio.no) Contents 1 The basic concepts
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 informationNumerical Optimization
Linear Programming Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on min x s.t. Transportation Problem ij c ijx ij 3 j=1 x ij a i, i = 1, 2 2 i=1 x ij
More informationOptimality of extreme points. Theorem 2.8
Recap, and outline of Lecture 8 Previously Posed several questions re. existence of extreme points of polyhedra and existence of optimal solutions of LPs: 1. When do polyhedra have (and don t have) extreme
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 informationOperations that preserve the covering property of the lifting region
Operations that preserve the covering property of the lifting region Amitabh Basu and Joe Paat June 23, 2015 Abstract We contribute to the theory for minimal liftings of cut-generating functions. In particular,
More informationThe Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm
The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm by Xiaojing Wang A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master
More informationBranch-and-cut Approaches for Chance-constrained Formulations of Reliable Network Design Problems
Branch-and-cut Approaches for Chance-constrained Formulations of Reliable Network Design Problems Yongjia Song James R. Luedtke August 9, 2012 Abstract We study solution approaches for the design of reliably
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 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 informationUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the
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 informationMEP123: Master Equality Polyhedron with one, two or three rows
1/17 MEP123: Master Equality Polyhedron with one, two or three rows Oktay Günlük Mathematical Sciences Department IBM Research January, 29 joint work with Sanjeeb Dash and Ricardo Fukasawa 2/17 Master
More informationLecture 7 Duality II
L. Vandenberghe EE236A (Fall 2013-14) Lecture 7 Duality II sensitivity analysis two-person zero-sum games circuit interpretation 7 1 Sensitivity analysis purpose: extract from the solution of an LP information
More information