Minimal Valid Inequalities for Integer Constraints
|
|
- Brent Campbell
- 6 years ago
- Views:
Transcription
1 Minimal Valid Inequalities for Integer Constraints Valentin Borozan LIF, Faculté des Sciences de Luminy, Université de Marseille, France and Gérard Cornuéjols Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 1513 and LIF, Faculté des Sciences de Luminy, Université de Marseille, France July 007 Dedicated to George Nemhauser for his 70th birthday Abstract In this note we consider an infinite relaxation of mixed integer linear programs. We show that any minimal valid inequality for this infinite relaxation arises from a nonnegative, piecewise linear, convex and homogeneous function. 1 Introduction Consider an integer program (IP min cx Ax = b x j Z for j = 1,..., p, x j 0 for j = 1,..., n, where p n, the matrix A Q m n, the row vector c Q n, the column vector b Q m are data, and x R n is a column vector of variables. We assume that A has full row rank m. A common approach to solve (IP is to first solve the linear programming relaxation (LP obtained by ignoring the integrality restrictions on x. A basic optimal solution of (LP is of the form x i = f i + j J rj x j for i B, (1 where B and J denote the sets of basic and nonbasic variables respectively. We have f 0. If f i Z for all i B {1,..., p}, then the basic solution x i = f i for all i B and x i = 0 Supported by NSF grant DMI , ONR grant N and ANR grant BLAN
2 otherwise, is an optimal solution of the integer program. On the other hand, if f i Z for some i B {1,..., p}, the above basic solution is not feasible to (IP and one may want to generate one or several cutting planes that cut it off while being satisfied by all the feasible solutions to (IP. Different strategies have been proposed for generating cutting planes. For example, Balas [] introduced intersection cuts obtained by intersecting the rays f + αr j, α 0, with a convex set whose interior contains f but no integral point. Most general purpose cutting planes used in state-of-the-art solvers are obtained by generating a linear combination of the original constraints Ax = b, and by applying integrality arguments to the resulting equation (Gomory s Mixed Integer Cuts, MIR inequalities and split cuts are examples. Recently, there has been interest in cutting planes that cannot be deduced from a single equation, but can be deduced by integrality arguments involving two equations (Dey and Richard [5], Andersen, Louveaux, Weismantel and Wolsey [1]. Let us consider the following relaxation of the integer program (IP starting from its equivalent form (1. We drop the nonnegativity restriction on all basic variables x i, i B, and we drop the integrality restriction on all the nonbasic variables x j, j J. Furthermore, we drop the constraints x i = f i + j J rj x j for i B {p + 1,..., n}. We are left with a system of the form x = f + k j=1 rj s j x Z q s 0 ( where we now denote by s the nonbasic variables and by x the remaining basic variables. We will keep this notation in the remainder of the paper. This relaxation of (IP is denoted by R f (r 1,..., r k where f, r 1,..., r k Q q. Such a relaxation was considered in [1] for the case q =. Gomory and Johnson [8] suggested relaxing the k-dimensional space of variables s = (s 1,..., s k to an infinite-dimensional space, where the variables s r are defined for any r Q q. We get the infinite relaxation R f x = f + finite rs r x Z q s 0 (3 where finite means that s r > 0 for a finite number of r Q q, i.e. the vector s has finite support. A feasible solution of the infinite relaxation R f is a vector (x, s with finite support that satisfies the three conditions (3. We say that an inequality is valid for R f if it is satisfied by all its feasible solutions. Note that conv(r f (r 1,..., r k is the face of conv(r f obtained by setting s r = 0 for all r Q q \ {r 1,..., r k }. Any valid inequality for (3 yields a valid inequality for ( by simply restricting it to the space r 1,..., r k. In the remainder, we assume f Z q. Thus the basic solution x = f, s = 0 is not feasible for R f. In this paper, we study valid inequalities for R f that cut off this infeasible basic solution. These inequalities can be stated in terms of the variables s only:
3 finite ψ(rs r 1. Our main interest is in minimal valid inequalities for R f, namely valid inequalities finite ψ(rs r 1 such that there is no valid inequality finite ψ (rs r 1 where ψ ψ and ψ (r < ψ(r for at least one r Q q. We show that, for a minimal valid inequality, the function ψ is nonnegative, piecewise linear, convex and homogeneous (namely ψ(λr = λψ(r for any scalar λ Q + and r Q q. The function ψ is not always continuous or finite. However, when it is finite, the piecewise linear function ψ has at most q pieces. Minimal Valid Inequalities We consider the infinite integer programming problem R f defined by (3 where we assume f Z q. Note that R f since x = 0, s r = 1 for r = f and s r = 0 otherwise, is a feasible solution of (3. Any valid inequality for R f that cuts off the infeasible solution s = 0 can be written as finite ψ f (rs r 1. (4 We say that the function ψ f : Q q R {+ } is valid if the corresponding inequality (4 is satisfied by every feasible solution of R f, i.e. by every s with finite support such that (x, s R f. We assume that there exists at least one feasible solution of R f such that finite ψ f (rs r < + (otherwise the function ψ f is uninteresting. When ψ f (r = + and s r = 0, we define ψ f (rs r = 0. Equivalently, finite is computed by summing only over the finitely many vectors r such that s r > 0. To simplify notation, we write ψ instead of ψ f in the remainder. Lemma.1. If the function ψ is valid, then ψ 0. p 1 D Proof. Suppose ψ( r < 0 for some r =... where p 1,..., p q Z and D Z + is a p q D common denominator. Let ( x, s be a feasible solution in R f such that finite ψ(r s r < +. Let ( x, s be defined by s r := s r + MD where M is a positive integer, s r := s r for r r, and x := f + r s r. The point ( x, s is a feasible solution in R f since x = x+md r Z q. We have ψ(r s r = ψ(r sr + ψ( rmd. By making the positive integer M large, we can make ψ( rmd as negative as we want. Therefore ψ(r s r < 1, contradicting the fact that ( x, s is feasible. A valid function ψ is minimal if there is no valid function ψ such that ψ ψ and ψ (r < ψ(r for at least one r Q q. Lemma.. If ψ is a minimal valid function, then ψ(0 = 0. Proof. If ( x, s is a feasible solution in R f, then so is ( x, s defined by s r := s r for r 0, and s 0 = 0. Therefore, if ψ is valid, then ψ defined by ψ (r = ψ(r for r 0 and ψ (0 = 0 is also valid. Since ψ is minimal, it follows that ψ(0 = 0. 3
4 A function g is subadditive if g(a + g(b g(a + b. Lemma.3. If ψ is a minimal valid function, then ψ is subadditive. Proof. Let r 1, r Q q. Define the function ψ as follows. { ψ(r ψ (r := 1 + ψ(r if r = r 1 + r ψ(r if r r 1 + r. We will show that ψ is valid. Consider any ( x, s R f. Define ( x, s as follows s r 1 + s r 1 +r if r = r1 s s r := r + s r 1 +r if r = r 0 if r = r 1 + r s r otherwise. Using the definitions of ψ and s, it is easy to verify that ψ (r s r = r r ψ(r s r. (5 Furthermore we have x = f + r s r = f + r s r. Since x Z q and s 0, this implies that ( x, s R f. Since ψ is valid, this implies r ψ(r s r 1. Therefore, by (5, ψ (r s r 1. Thus ψ is valid. Since ψ is minimal, we get ψ(r 1 + ψ(r ψ(r 1 + r. Lemma.4. If ψ is a minimal valid function, then ψ is homogeneous. Proof. Let r Q q and λ Q +. We will show ψ(λ r = λψ( r. This holds when λ = 0 so assume now λ > 0. Define the function ψ as follows. { 1 ψ (r := λψ(λ r if r = r ψ(r otherwise. We will show that ψ is valid. Consider any ( x, s R f. Define ( x, s as follows s λ r + 1 λ s r if r = λ r s r := 0 if r = r s r otherwise. Using the definition of ψ and s, it is easy to verify that ψ (r s r = ψ(r s r. (6 Furthermore we have x = f + r s r = f + r s r. Since x Z q and s 0, this implies that ( x, s R f. Since ψ is valid, this implies r ψ(r s r 1. Therefore, by (6, ψ (r s r 1. Thus ψ is valid. Since ψ is minimal, we get ψ(λ r λψ( r. By reversing the roles of r and λ r, we get ψ( r 1 λ ψ(λ r. Therefore we have equality. 4 r
5 Corollary.5. If ψ is a minimal valid function, then ψ is convex. Proof. Let r 1, r Q q and 0 < t < 1 rational. Then, by Lemmas.3 and.4, tψ(r 1 + (1 tψ(r = ψ(tr 1 + ψ((1 tr ψ(tr 1 + (1 tr. Example.6. In R q, suppose 0 < f i < 1 for some i = 1,..., q. Define ψ as follows. ψ(r := { ri 1 f i if r i 0 r i f i if r i 0. This inequality is a Gomory mixed integer cut [7] obtained from row i of R f. Equivalently, it is a simple split inequality [4] obtained from the disjunction x i 0 or x i 1. Example.7. In R q, suppose f i = 1 for i = 1,..., q. Define ψ(r := q ( r r q. This inequality is an intersection cut [] obtained from the octahedron centered at f with vertices f ± q ei, where e i denotes the ith unit vector. This octahedron has q facets, each of which contains a 0,1 point in its center. As one would expect, a minimal valid inequality may be implied by a linear combination of other minimal valid inequalities. This is the case here. Indeed, the above intersection cut from the octahedron is implied by the q split cuts ψ i (r := r i for i = 1,..., q since ψ = q i=1 1 q ψi and finite ψi (rs r 1 for i = 1,..., q imply finite ψ(rs r 1. A minimal valid function ψ may not be continuous nor finite, as shown by the following examples. ( 1 Example.8. In R, let f :=. Define ψ as follows. 0 ( r1 ψ r ( 1 Example.9. In R, let f := 1 := r if r > 0 r 1 if r = 0 + if r < 0. It is easy to verify that this function ( ( is valid. In ( particular ψ(x f 1 for all x Z 0 1 i and equality holds when x =, and for i Z. The minimality of ψ ( ( M for r 0 can be verified directly. For r < 0, convexity implies 1 ψ r1 ψ r 0 ( ( ( 1 M ψ r1 r1 r1. Thus ψ M r r r. When M goes to +, this implies ψ = r +.. Define ψ as follows. ( r1 ψ r := 3 r if r 1 < r < r 1 and r > 0 r if r = r 1 or r 1, and r 0 + otherwise. 5
6 3 Maximal lattice-free convex sets For a convex function ψ : Q q R {+ }, define B ψ := {x Q q : ψ(x f 1}. (7 We are interested in the properties of B ψ when ψ is a minimal valid function. For the function ψ of Example.8, B ψ contains all the rational points in the band 0 < x 1 and in the segment x = 0, 1 x 1 1 but the half-lines x = 0, x 1 > 1 are not in B ψ. Define the boundary of B ψ to be the set {x Q q : ψ(x f = 1}. In Example.8, the boundary of B ψ consists of the line x = 1 and the two points (0, 0 and (1, 0. Lemma 3.1. Let ψ be a minimal valid function for R f. Then B ψ is a convex subset of Q q that contains no integral point x Z q except possibly on its boundary. Furthermore f B ψ and, if ψ is finite, then B ψ contains f in its interior. Proof. The fact that B ψ is convex follows from Corollary.5. Let x Z q. Then ( x, s R f where s x f = 1 and s r = 0 otherwise. Since ψ is valid, ψ( x f 1. If, in addition, x B ψ, this implies ψ( x f = 1. f B ψ since ψ(0 = 0. Now assume ψ(r < + for all r Q q. For each unit vector e i, the homogeneity of ψ implies the existence of λ i > 0 such that ψ(λ i e i 1. Similarly, for i = 1,..., q, choose any µ i > 0 such that ψ(µ i ( e i 1. Then the convex hull of the q points f + λ i e i, f µ i e i is contained in B ψ by convexity and it contains f in its interior. Thus f is in the interior of B ψ. Lemma 3.. Let B be any closed convex set in R q with nonempty interior and no integral point in its interior. Then the following function ψ is valid for R f whenever f Q q is in the interior of B: Set ψ(r = 0 for any r in the recession cone of B, ψ(r = 1 for any r Q q such that the point f + r is on the boundary of B, all other values of ψ being defined by homogeneity. Furthermore B ψ = B Q q. Proof. The convexity of B and homogeneity of ψ imply that ψ is subadditive: Let a, b Q q. Suppose first that neither a nor b is in the recession cone of B. Set α > 0 to be the scalar such that ψ(αa = 1. Similarly set β > 0 such that ψ(βb = 1. Then f + αa, f + βb B. By convexity of B, for any 0 λ 1 we have Set λ := β α+β λψ(αa + (1 λψ(βb = 1 ψ(λαa + (1 λβb (8 in (8. We get, by homogeneity of ψ ψ(a + ψ(b ψ(a + b. (9 If both a, b are in the recession cone of B, then a + b also is and (9 holds. So we may assume that b is in the recession cone of B but not a. Choose α > 0 such that ψ(αa = 1. Then αa B and, since b is in the recession cone of B, we also have αa + αb B. Thus ψ(α(a + b 1. Now (9 holds since ψ(αa + ψ(αb = 1 and ψ is homogeneous. 6
7 Suppose ψ is not valid. Then there exists ( x, s R f such that ψ(r s r < 1. Since x = f + r s r, the subadditivity and homogeneity of ψ imply ψ( x f = ψ( r s r ψ(r s r < 1. Thus x Z q is in B ψ but not on its boundary, a contradiction. Lemma 3.3. Let ψ and ψ be two valid functions. Then ψ ψ if and only if B ψ B ψ. Proof. Immediate from the definition of B ψ. Theorem 3.4. If ψ is a finite minimal valid function for R f, then ψ is a continuous nonegative homogeneous convex piecewise linear function with at most q pieces. Proof. Let ψ be a finite minimal valid function and let B ψ be the corresponding convex set as defined in (7. By Lemma 3.1, B ψ is convex, contains f in its interior and has integral points only on its boundary, and by Lemmas 3. and 3.3 it is inclusion maximal with these properties. By a theorem of Doignon [6], Bell [3] and Scarf [11], every maximal convex set in R q with no integral point in its interior is a polyhedron with at most q facets. The proof of the upper bound on the number of facets is simple and elegant: By maximality, each facet F contains an integral point x F in its relative interior. If there are more than q facets, two integral points x F and x F must be identical modulo. Then their middle point 1 (xf + x F is integral and interior, contradiction. Consider a facet F of B ψ. We have ψ(x f = 1 for all x F. By homogeneity (Lemma.4, ψ is linear in the cone {r Q q : r = λ(x f with λ 0, x F }. Since the union of these cones over all facets of B ψ covers Q q, the function ψ is piecewise linear with at most q pieces. integral point integral point integral point f integral point r 0 1 r 1 x-space B ψ ψ Figure 1: A maximal lattice-free convex set and corresponding function ψ in R Corollary 3.5. Let ψ is a finite minimal valid function for R f. Then B ψ is a polyhedron with at most q facets, each facet contains an integral point in its relative interior, and B ψ contains f but no integral point in its interior. 7
8 Conversely, any polyhedron B Q q with nonempty interior, no integral point in its interior, but an integral point in the relative interior of each facet corresponds to a finite minimal valid function ψ such that B ψ = B. To see this, as in Lemma 3., choose f Q q in the interior of B and let ψ(x f = 1 for x on the facets of B. The other values of ψ(r are defined by homogeneity. The function so defined is minimal because B ψ is a maximal convex set with no integral point in its interior (Lemma 3.3. As stated in the proof of Theorem 3.4 above, a maximal convex set in R q with no integral point in its interior is a polyhedron with at most q facets. Lovász [9] points out that the unbounded case reduces to the bounded case as follows. Let b 1,..., b q be any basis of the integer lattice. Let U 1 (L 1 be the linear subspace (lattice spanned by b 1,..., b k and U the linear subspace spanned by b k+1,..., b q. Let K 1 be a maximal convex set in U 1 free of the lattice L 1 (By a lattice-free convex set S, we mean that S does not contain lattice points in its interior. Then the set K 1 + U, called cylinder above K 1, is a maximal lattice-free convex set for the whole space. Conversely, every unbounded maximal lattice-free convex set is a cylinder above a bounded maximal lattice-free convex set in some lattice subspace. Theorem 3.6. If ψ is a minimal valid function for R f, then ψ is a nonnegative homogeneous convex piecewise linear function. Proof. By Theorem 3.4, it suffices to consider the case when ψ is not finite everywhere. Let B ψ be the corresponding convex set as defined in (7. Let B ψ be the closure of B ψ. Bψ is a lattice-free convex set and by Lemma 3.3, it is maximal. Therefore, by [6], [3] and [11], Bψ is a full-dimensional polyhedron with at most q facets. By Lemma 3.1, f B ψ. If f were in the interior of B ψ, then ψ would be finite by Lemma 3., contradicting our assumption. Therefore the point f lies in one of the faces of B ψ. In each facet of B ψ containing f, we can apply induction to conclude that ψ is piecewise linear in that subspace. In the directions r such that the ray f + λr, λ 0, goes through the interior of B ψ, we get a piecewise linear function since ψ equals 1 on the encountered facets and ψ is homogeneous in each of the corresponding cones. Finally, in the directions r such that the ray f +λr, λ 0, only touches B ψ in f, we have ψ(r = +. References [1] K. Andersen, Q. Louveaux, R. Weismantel and L. Wolsey, Cutting Planes from Two Rows of a Simplex Tableau, Proceedings of IPCO XII, Ithaca, New York ( [] E. Balas, Intersection Cuts - A New Type of Cutting Planes for Integer Programming, Operations Research 19 ( [3] D.E. Bell, A Theorem Concerning the Integer Lattice, Studies in Applied Mathematics 56 ( [4] W. Cook, R. Kannan and A. Schrijver, Chvátal closures for mixed integer programming problems, Mathematical Programming 47 ( [5] S.S. Dey and J.-P. P. Richard, Facets for the Two-Dimensional Infinite Group Problems, technical report (007. 8
9 [6] J.-P. Doignon, Convexity in Cristallographical Lattices, Journal of Geometry 3 ( [7] R.E. Gomory, An Algorithm for Integer Solutions to Linear Programs, Recent Advances in Mathematical Programming, R.L. Graves and P. Wolfe eds., McGraw-Hill, New York ( [8] R.E. Gomory and E.L. Johnson, Some Continuous Functions Related to Corner Polyhedra, Part I, Mathematical Programming 3 ( [9] L. Lovász, Geometry of Numbers and Integer Programming, Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe eds., Kluwer ( [10] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley (1988. [11] H.E. Scarf, An Observation on the Structure of Production Sets with Indivisibilities, Proceedings of the National Academy of Sciences of the United States of America 74 (
On 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationOn mixed-integer sets with two integer variables
On mixed-integer sets with two integer variables Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Santanu S. Dey Georgia Inst. Tech. santanu.dey@isye.gatech.edu September 8, 2010 Oktay Günlük IBM Research
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCut-Generating Functions for Integer Variables
Cut-Generating Functions for Integer Variables Sercan Yıldız and Gérard Cornuéjols December 204, revised August 205 Abstract For an integer linear program, Gomory s corner relaxation is obtained by ignoring
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 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 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 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 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 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 informationEllipsoidal Mixed-Integer Representability
Ellipsoidal Mixed-Integer Representability Alberto Del Pia Jeff Poskin September 15, 2017 Abstract Representability results for mixed-integer linear systems play a fundamental role in optimization since
More informationConvex Sets and Minimal Sublinear Functions
Convex Sets and Minimal Sublinear Functions Amitabh Basu Gérard Cornuéjols Giacomo Zambelli March 2009, revised January 2010 Abstract We show that, given a closed convex set K containing the origin in
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 informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More 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 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 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 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 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 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 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 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 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 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 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 informationRelations Between Facets of Low- and High-Dimensional Group Problems
Mathematical Programming manuscript No. (will be inserted by the editor) Santanu S. Dey Jean-Philippe P. Richard Relations Between Facets of Low- and High-Dimensional Group Problems Received: date / Accepted:
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 informationarxiv:math/ v1 [math.co] 23 May 2000
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems arxiv:math/0005229v1 [math.co] 23 May 2000 Masakazu Kojima Department of Mathematical and Computing Sciences
More informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More 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 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 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 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 informationTRISTRAM BOGART AND REKHA R. THOMAS
SMALL CHVÁTAL RANK TRISTRAM BOGART AND REKHA R. THOMAS Abstract. We introduce a new measure of complexity of integer hulls of rational polyhedra called the small Chvátal rank (SCR). The SCR of an integer
More 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 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 informationarxiv:math/ v1 [math.oc] 3 Oct 2001
AN ALGEBRAIC PERSPECTIVE OF GROUP RELAXATIONS arxiv:math/0110034v1 [math.oc] 3 Oct 2001 REKHA R. THOMAS Contents 1. Introduction 1 2. Group Relaxations 3 3. Associated Sets 10 4. Arithmetic Degree 16 5.
More informationCutting planes from two rows of a simplex tableau
Cutting planes from two rows of a simplex tableau K. Andersen Q. Louveaux R. Weismantel L. Wolsey May, 6 Abstract Introduction In this paper a basic geometric object is investigated that allows us to derive
More 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 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 information