Integer Programming ISE 418. Lecture 13. Dr. Ted Ralphs
|
|
- Alvin Stanley
- 5 years ago
- Views:
Transcription
1 Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs
2 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 for Mixed Integer Linear Programs, G. Cornuejols. Generating Disjunctive Cuts for Mixed Integer Programs, M. Perregaard.
3 ISE 418 Lecture 13 2 Valid Inequalities from Disjunctions Valid inequalities for conv(s) can also be generated from valid disjunctions. Let X i = {x R n + A i x b i } for i = 1,..., k constitute a disjunction valid for S. Then inequalities valid for k i=1 (P X i are also valid for conv(s).
4 ISE 418 Lecture 13 3 The Union of Polyhedra The convex hull of the union of polyhedra is not necessarily a polyhedron. Under mild conditions, we can characterize it, however. Consider a finite collection of polyhedra P i = {x R n A i x b i for 1 i k. Let Y be the polyhedron described by the following constraints: A i x i b i y i i = 1,..., k k x i = x i=1 k y i = 1 i=1 y 0 Furthermore, for polyhedron P i, let C i = {x R n A i x 0} and let P i = Q i + C i where Q i is a polytope.
5 ISE 418 Lecture 13 4 The Convex Hull of the Union of Polyhedra Under the assumptions on the previous slide, we have the following result. Proposition 1. If either k i=1 P i = or C j cone( i:pi C i for all j such that P j =, then the following sets are identical: conv( k i=1 P i} conv( k i=1 Q i) + cone( k i=1 C i) proj x Y. Note that the assumptions of the proposition are necessary, but are automatically satisfied if C i = {0} whenever P i =, or all the polyhedra have the same recession cone.
6 ISE 418 Lecture 13 5 The Convex Hull of the Union of Polyhedra (cont.) Note also that if all the polyhedra have the same recession cones, then conv( k i=1 P i) = conv( k i=1 P i) and k i=1 P i is the projection of A i x i b i y i i = 1,..., k k x i = x i=1 k y i = 1 i=1 y {0, 1} This is the case when the polyhedra only differ in their right-hand sides, as is the case when branching on variables.
7 ISE 418 Lecture 13 6 Valid Inequalities from Disjunctions Another viewpoint for constructing valid inequalities based on disjunctions comes from the following result: Proposition 2. S 2 R n +, then for x S 1 S 2. If (π 1, π0) 1 is valid for S 1 R n + and (π 2, π0) 2 is valid for n min(πj 1, πj 2 )x j max(π0, 1 π0) 2 (1) j=1 In fact, all valid inequalities for the union of two polyhedra can be obtained in this way. Proposition 3. If P i = {x R n + A i x b i } for i = 1, 2 are nonempty polyhedra, then (π, π 0 ) is a valid inequality for conv(p 1 P 2 ) if and only if there exist u 1, u 2 R m such π u i A i and π 0 u i b i for i = 1, 2.
8 ISE 418 Lecture 13 7 Simple Disjunctive Inequalities We want to develop a procedure analogous to C-G for mixed-integer sets. It is straightforward to develop an analog of the rounding principle we used earlier that was geared towards pure integer programs. Proposition 4. Let T = {x Z R + x 1 x 2 b}. Then the inequality x 1 1 x 2 b. 1 f 0 is valid for T. The proof requires exploiting the disjunction x 1 b OR x 1 b + 1
9 ISE 418 Lecture 13 8 Mixed Integer Rounding Inequalities We can generalize the inequality from the previous slide as follows. Proposition 5. Let T = {x Z p + R n p + n j=1 a jx j b}, where a Q n and b Q. Then the inequality p j=1 ( a j + (f j f 0 ) + 1 f 0 )x j f 0 p+1 j n:a j <0 is valid for T, where f j = a j a j and f 0 = b b. a j x j b. In fact, if a j Z, gcd{a 1,..., a n } = 1, and b Z, then the above inequality is facet-inducing for conv(t ). The above inequality is called a mixed integer rounding (MIR) inequality. Its validity can be proved by aggregating the integer and continuous variables, respectively, and applying Proposition??.
10 ISE 418 Lecture 13 9 Gomory Mixed Integer Inequalities Let s consider again the set of solutions T to an IP with one equation. This time, we write T equivalently as T = x Zn + f j x j + (f j 1)x j = f 0 + k for some integer k j:f j f 0 j:f j >f 0 Since k 1 or k 0, we have the disjunction f j x j f 0 j:f j f 0 (1 f j ) x j 1 f 0 j:f j >f 0 OR j:f j f 0 f j (1 f 0 ) x j + j:f j >f 0 (1 f j ) (1 f 0 ) x j 1
11 ISE 418 Lecture The Gomory Mixed Integer Cut Applying Proposition??, we get f j x j + f 0 j:f j f 0 (1 f j ) (1 f 0 ) x j 1 j:f j >f 0 This is called a Gomory mixed integer (GMI) inequality. GMI inequalities dominate the associated Gomory cut and can also be obtained easily from the tableau. In the case of the mixed integer set T = x Zp + R n p + the GMI cut is 0 j p f j f 0 f j x j + f 0 0 j p f j >f 0 (1 f j ) (1 f 0 ) x j + p+1 j n a j >0 n a j x j = a 0, j=1 a j f 0 x j p+1 j n a j <0 a j (1 f 0 ) x j 1
12 ISE 418 Lecture GMI vs. MIR Although we derived the GMI inequality using a different logic than that which we used for the MIR inequality, they are equivalent. Beginning with the inequality n a j x j b, (2) j=1 we add a slack variables s = b a x to obtain n a j x j + s = b. j=1 Deriving the GMI inequality from this equation and then substituting out the slack variable s, we obtain the MIR inequality associated with (??).
13 ISE 418 Lecture Gomory Mixed Integer Cuts from the Tableau Let s consider how to generate Gomory mixed integer cuts from the tableau when solving (??). As before, we first introduce a slack variable for each inequality in the formulation. Solving the LP relaxation, we look for a row in the tableau in which an integer variable is basic and has a fractional variable. We apply the GMI procedure to produce a cut. Finally, we substitute out the slack variables in order to express the cut in terms of the original variables only.
14 ISE 418 Lecture Example: GMI Cuts versus Gomory Cuts Recall our example from last time. max 2x 1 + 5x 2 (3) s.t. 4x 1 + x 2 28 (4) The optimal tableau for the LP relaxation is: x 1 + 4x 2 27 (5) x 1 x 2 1 (6) x 1, x 2 0 (7) Basic var. x 1 x 2 s 1 s 2 s 3 RHS x /30 8/ /3 s /3 1/3 1 2/3 x /30-2/ /3 Table 1: Optimal tableau of the LP relaxation The associated optimal solution to the LP relaxation is also shown in Figure??.
15 ISE 418 Lecture Example: Gomory Cuts (cont.) Figure 1: Convex hull of S
16 ISE 418 Lecture Example: GMI Cuts versus Gomory Cuts (cont.) The GMI cut from the first row is In terms of x 1 and x 2, we have 1 10 s s 2 1, 12x x 2 234, (GMI-C1)
17 ISE 418 Lecture Example: GMI Cuts versus Gomory Cuts (cont.) The GMI cut from the third row is In terms of x 1 and x 2, we have 4 10 s s 2 1, 3x 1 + 2x 2 26, (GMI-C3)
18 ISE 418 Lecture Geometric Interpretation of GMI Cuts To understand the geometric interpretation of GMI cuts, we consider a relaxation of (??) associated with a basis of the LP relaxation. We simply relax the non-negativity constraints on the basic variables to obtain T = { (x, s) Z n+m Ax + Is = b, x N 0, s N 0 }, where x N and s N are the non-basic variables associated with basis B. This is equivalent to relaxing the non-binding constraints. The convex hull of T is the so-called corner polyhedron associated with the basis B.
19 ISE 418 Lecture Example: Corner Polyhedron Figure 2: The corner polyhedron associated with the optimal basis of the LP relaxation of the earlier example.
20 ISE 418 Lecture Intersection Cuts A simple way to obtain inequalities valid for the corner polyhedron (and hence the original MILP is as follows. Construct a convex set C whose interior contains the solution x associated with the current basis and no other integer points. Determine the points of intersection of each of the extreme rays of the corner polyhedron with the set C. The unique hyperplane determined by these points of intersection then separates x from the corner polyhedron. This is a general paradigm and one can get different classes of valid inequality by choosing the set C in different ways. The GMI cut from row i of the tableau is precisely the intersection cut obtained by setting C = { x R n+m x j x j x j }, where x j is the variable that is basic in row i.
21 ISE 418 Lecture Example: GMI Cut as an Intersection Cut Figure?? shows the GMI cut derived from the second row of the tableau in our example as an intersection cut. The basic variable in this case is s 3. In terms of the original variables, we have C = { x R n+m 0 x 1 x 2 1 }
22 ISE 418 Lecture Example: GMI Cut as an Intersection Cut Figure 3: GMI Cut from row 2 as an intersection cut
23 ISE 418 Lecture GMI Cuts in Practice Here is an example of the slow convergence sometimes seen in practice. min 20x x 2 2x 1 3x 2 5 4x 1 2x x 1 4x x x 2 6 x 1, x 2 Z We will solve this using the naive implementation in CuPPy.
24 ISE 418 Lecture The Polyhedra in Example Figure 4: Feasible region of Example MILP
25 ISE 418 Lecture First Iteration The solution to the LP relaxation is (2, 3.5). The tableau row in which x 2 is basic is x s 2 0.4s 3 Note that for purposes of illustration, we are explicitly included the bound constraints in the tableau. The GMI is 0.6s s 3 1 In terms of the original variables, this is 4.8x 1 4.4x 2 26
26 ISE 418 Lecture Second Iteration Figure 5: Feasible region of Example MILP after adding cut The solution in the second iteration is (1.75, 4) and the cut is 10.4x x
27 ISE 418 Lecture Third Iteration Figure 6: Feasible region of Example MILP after two cuts The solution in the third iteration is (2, ) and the cut is 14.3x x
28 ISE 418 Lecture Further Iterations Figure 7: Feasible region of Example MILP after 100 cuts
29 ISE 418 Lecture Further Iterations Note the slow convergence rate. Not much progress is being made with each cut. After 100 iteration, the solution is (1.9979, 4), which may be close enough, but would not be considered optimal by most solvers. It is surprising that such a small MILP would have such a high rank. This is at least partly due to numerical errors and the fact that our implementation is naive. We will delve further into these topics later in the course.
30 ISE 418 Lecture Lift and Project In lift and project, we directly write down the separation problem with respect to a given point and disjunction. We will use the variable disjunction on the j th variable. We have that conv(s) conv(p 0 j P1 j ) where P0 j = P {x Rn x j x j } and P1 j = P {x Rn x j x j }. Applying Proposition??, we see that the inequality (π, π 0 ) is valid for P j = conv(p 0 j P1 j ) if there exists ui R m +, v i R n +, and w i R + for i = 0, 1 such that π u 0 A + w 0 e j, π u 1 A w 1 e j, π 0 u 0 b + w 0 x j, π 0 u 1 b w 1 x j, Notice that this is a set of linear constraints, i.e., we could write an LP to generate constraints based on this disjunction.
31 ISE 418 Lecture The Cut Generating LP This leads to the cut generating LP (CGLP), which generates the most violated inequality valid for P j. max πˆx π 0 s.t. π ua + u 0 e j, π va v 0 e j, π 0 ub + u 0 x j, (CGLP) m u i + u 0 + i=1 π 0 vb v 0 x j, m v i + v 0 = 1 i=1 u, u 0, v, v 0 0 The last constraint is for normalization. There are a number of alternatives for normalization and the choice does have an impact (see Perregaard). This shows that the separation problem for P j is polynomially solvable.
32 ISE 418 Lecture Split Inequalities Let (α, β) be a split disjunction and define P 1 = P {x R n α x β} P 2 = P {x R n α x β + 1} Any inequality valid for conv(p 1 P 2 ) is valid for S and is called a split inequality.
33 ISE 418 Lecture Separation Problem for Split Inequalities The LP (??) can be generalized straightforwardly to produce the most violated split cut. max πˆx π 0 s.t. π ua + u 0 α, π va v 0 α, π 0 ub + u 0 β, m u i + u 0 + i=1 π 0 vb v 0 (β + 1), m v i + v 0 = 1 i=1 u, u 0, v, v 0 0 α Z n β Z (SCGLP) The separation problem is a mixed integer nonlinear optimization problem, however, and is not easy to solve.
34 ISE 418 Lecture Strengthening Lift-and-Project Cuts Note that (??) only explicitly accounts for the integrality of a single variable. We can strengthen the generated cuts using the integrality of the other variables (we consider the pure binary case, but this can be generalized). To do this, we simply replace the original coefficients π k = min{ua k, va k } for k j π j = min{ua j + u 0, va j v 0 } for the integer variables indexed 1 k p with π k = max{ua k + u 0 m k, va k v 0 m k }, where m i = va i ua i u 0 + v 0 The proof is to fix the values of u, v, u 0, v 0 obtained by solving (??) and then find an optimal (α, β) in (??).
35 ISE 418 Lecture GMI Cuts vs. Lift-and-Project Cuts There is a correspondence between GMI cuts generated from basic solutions of the LP relaxation and strengthened lift-and-project cuts. We use the normalization π 0 { 1, 0, 1} in (??). Then each of the former can be derived as the latter from some basic solution to (??) (and vice versa, though the relationship is not one-to-one). We may be able to get stronger GMI cuts from tableaus other than the one that is optimal to the current LP relaxation. There are lift-and-project cuts that can only be obtained as GMI cuts from an infeasible tableau. We may also be able to get stronger cuts from a basic solution that is suboptimal for the LP relaxation. By pivoting in the LP relaxation, we can implicitly solve the cut generating LP (see Balas and Perregaard).
36 ISE 418 Lecture Lift-and-Project Cut as GMI from Infeasible Basis Figure 8: A GMI cut arising from an infeasible basis
37 ISE 418 Lecture Lift-and-Project Cut as GMI from Alternative Basis In our earlier example. the inequality x 1 5 dominates 3x 1 + 2x 2 26, but the latter was generated from the current basis. With respect to the basic solution (5.8, 4.8), we obtain the cut x 1 5 as a GMI cut. Figure 9: GMI cut arising from an alternative basis
38 ISE 418 Lecture Another Derivation for Binary Optimization Consider the following procedure: 1: Select j {1,..., n}. 2: Generate the nonlinear system x j (Ax b) 0, (1 x j )(Ax b) 0. 3: Linearize the system by substituting y i for x i x j, i j, and x j for x 2 j. Call this polyhedron M j. 4: Project M j onto the x-space. In this case, the resulting polyhedron is again P j. This procedure can be strengthened in a number of different ways.
39 ISE 418 Lecture The Lift-and-Project Closure The lift-and-project closure is P 1 = n j=1p j We have just shown that optimization over this closure can be accomplished in polynomial time. Let P k be the lift-and-project closure of P k 1 for k > 1. The lift-and-project rank of P is the smallest number k such that P k = conv(s). Surprisingly, the lift-and-project rank is bounded by n in the binary and mixed binary case.
40 ISE 418 Lecture Example: Lift and Project Closure We consider the polyhedron P in two dimensions defined by the constraints 8x x x 1 4x x 1 + 8x 2 1 2x 1 36x x 1 8x x x 2 127
41 ISE 418 Lecture Lift-and-Project Closure for Example Figure 10: Lift-and-project closure for example
42 ISE 418 Lecture The GMI closure A GMI cut with respect to a polyhedron P is any cut that can be derived using the GMI procedure starting from any inequality valid for P. The GMI closure is obtained by adding all GMI cuts to the description of P. The GMI closure is a polyhedron, but in contrast to the lift-and-project closure, optimizing over it is difficult (N P-hard). This seems like a paradox, since we have shown that most-violated GMI cuts are easy to generate. This is only the case, however, for basic solutions to the LP relaxation separating arbitrary points is difficult in general. The GMI rank of both valid inequalities and polyhedra can be defined in a fashion similar to that of the C-G rank (more on this later).
43 ISE 418 Lecture The GMI Closure and the Split Closure The split closure is the set of points satisfying all possible split cuts and is a polyhedron. Every split cut is also a GMI cut and vice versa. The split closure and the GMI closure are therefore identical. As expected, the GMI cut corresponding to a given split cut is not necessarily one that can be derived from a basic solution to the LP relaxation. We can define the split rank of an inequality and of a polyhedron as before. In the pure integer case, the split rank (and GMI rank) of P is finite, but it may not be in the mixed case. In the mixed binary case, the split rank is bounded by n.
44 ISE 418 Lecture Aside: Selection Criteria The criteria by which we select cuts has a big impact on the overall effectiveness. We will see later that we in fact need two different kinds of selection criteria: one for generating cuts and one for choosing which cuts to add. We typically use bound improvement as a rough criteria when selecting disjunctions for branching, but we often use degree of violation with cuts. Why the difference? One simple answer is that degree of violation is a linear objective with respect to the cut generating LP. Generating cuts according to other criteria seems to be more difficult. See
Integer 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
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 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 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 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 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 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. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
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 informationConvex hull of two quadratic or a conic quadratic and a quadratic inequality
Noname manuscript No. (will be inserted by the editor) Convex hull of two quadratic or a conic quadratic and a quadratic inequality Sina Modaresi Juan Pablo Vielma the date of receipt and acceptance should
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 informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.05 Recitation 8 TAs: Giacomo Nannicini, Ebrahim Nasrabadi At the end of this recitation, students should be able to: 1. Derive Gomory cut from fractional
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 informationAn Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory
An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory by Troels Martin Range Discussion Papers on Business and Economics No. 10/2006 FURTHER INFORMATION Department of Business
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 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 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 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 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 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 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 informationarxiv: v1 [cs.cc] 5 Dec 2018
Consistency for 0 1 Programming Danial Davarnia 1 and J. N. Hooker 2 1 Iowa state University davarnia@iastate.edu 2 Carnegie Mellon University jh38@andrew.cmu.edu arxiv:1812.02215v1 [cs.cc] 5 Dec 2018
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 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 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 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 informationOn optimizing over lift-and-project closures
Math. Prog. Comp. manuscript No. (will be inserted by the editor) On optimizing over lift-and-project closures Pierre Bonami the date of receipt and acceptance should be inserted later Abstract The strengthened
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 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 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 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 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 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 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 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 informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
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 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 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 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 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 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 informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University MOA 2016, Beijing, China, 27 June 2016 What Is This Talk
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 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 mathematical programming with indicator constraints
On mathematical programming with indicator constraints Andrea Lodi joint work with P. Bonami & A. Tramontani (IBM), S. Wiese (Unibo) University of Bologna, Italy École Polytechnique de Montréal, Québec,
More informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
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 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 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 informationOptimization in Process Systems Engineering
Optimization in Process Systems Engineering M.Sc. Jan Kronqvist Process Design & Systems Engineering Laboratory Faculty of Science and Engineering Åbo Akademi University Most optimization problems in production
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 informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
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 informationMixed Integer Programming Solvers: from Where to Where. Andrea Lodi University of Bologna, Italy
Mixed Integer Programming Solvers: from Where to Where Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it November 30, 2011 @ Explanatory Workshop on Locational Analysis, Sevilla A. Lodi, MIP
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 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 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 informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
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 informationConstraint Qualification Failure in Action
Constraint Qualification Failure in Action Hassan Hijazi a,, Leo Liberti b a The Australian National University, Data61-CSIRO, Canberra ACT 2601, Australia b CNRS, LIX, Ecole Polytechnique, 91128, Palaiseau,
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 informationCritical Reading of Optimization Methods for Logical Inference [1]
Critical Reading of Optimization Methods for Logical Inference [1] Undergraduate Research Internship Department of Management Sciences Fall 2007 Supervisor: Dr. Miguel Anjos UNIVERSITY OF WATERLOO Rajesh
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University COLGEN 2016, Buzios, Brazil, 25 May 2016 What Is This Talk
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 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 informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
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 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 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 informationBilevel Integer Linear Programming
Bilevel Integer Linear Programming TED RALPHS SCOTT DENEGRE ISE Department COR@L Lab Lehigh University ted@lehigh.edu MOPTA 2009, Lehigh University, 19 August 2009 Thanks: Work supported in part by the
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 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 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 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 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 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 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 information