Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
|
|
- Thomas Neal
- 5 years ago
- Views:
Transcription
1 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 (CMU) MINLP Workshop Pittsburgh (PA) June 03, 2014 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 1 / 27
2 Outline Mixed integer conic optimization (MICP) Problem setting Motivation Structure of linear valid inequalities K-minimal valid inequalities K-sublinear valid inequalities Disjunctive cuts for Lorentz cone (joint work with Sercan Yıldız (CMU)) Structure of valid linear inequalities A class of valid convex inequalities Nice case and nasty case (with examples) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 2 / 27
3 A Disjunctive Perspective Problem: Study the closed convex hull of where S(A, K, B) = {x E : Ax B, x K} E is a finite dimensional Euclidean space with inner product, A is a linear map from E to R m B R m is a given set of points (can be finite or infinite) K E is a full-dimensional, closed, convex and pointed cone [regular cone] F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 3 / 27
4 A Disjunctive Perspective Problem: Study the closed convex hull of where S(A, K, B) = {x E : Ax B, x K} E is a finite dimensional Euclidean space with inner product, A is a linear map from E to R m B R m is a given set of points (can be finite or infinite) K E is a full-dimensional, closed, convex and pointed cone [regular cone] Most (if not all!) cutting planes (convexification techniques) in MILPs rely on disjunctive formulations. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 3 / 27
5 Representation Flexibility S(A, K, B) = {x E : Ax B, x K} This set captures the essential structure of MICPs F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 4 / 27
6 Representation Flexibility S(A, K, B) = {x E : Ax B, x K} This set captures the essential structure of MICPs {(y, v) R k + Z q : W y + H v b K} where K E is a full-dimensional, closed, convex, pointed cone. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 4 / 27
7 Representation Flexibility S(A, K, B) = {x E : Ax B, x K} This set captures the essential structure of MICPs {(y, v) R k + Z q : W y + H v b K} where K E is a full-dimensional, closed, convex, pointed cone. Define ( ) y x =, A = [ W, Id ], and B = b H Z q, z where Id is the identity map in E. Then we arrive at S(A, K, B) = {x (R k E) : Ax B, x (R k + K) } }{{} :=K F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 4 / 27
8 Representation Flexibility S(A, K, B) = {x E : Ax B, x K} Models traditional disjunctive formulations Captures the essential non-convex structure of MICPs Precisely contains famous Gomory s Corner Polyhedron (1969) Arises in modeling complementarity relations Can be used as a natural relaxation for sequential convexification etc., etc... F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 5 / 27
9 Questions of Interest S(A, K, B) = {x E : Ax B, x K} General Questions: When can we study/characterize conv(s(a, K, B)) explicitly? Will (or when will) conv(s(a, K, B)) preserve the nice structural properties we originally had? F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 6 / 27
10 Questions of Interest S(A, K, B) = {x E : Ax B, x K} General Questions: When can we study/characterize conv(s(a, K, B)) explicitly? Will (or when will) conv(s(a, K, B)) preserve the nice structural properties we originally had? Let s first see what we can find out about the structure of linear valid inequalities... F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 6 / 27
11 Structure of Valid Linear Inequalities S(A, K, B) = {x E : Ax B, x K} conv(s(a, K, B)) = intersection of all linear valid inequalities (v.i.) µ, x η 0 for S(A, K, B) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 7 / 27
12 Structure of Valid Linear Inequalities S(A, K, B) = {x E : Ax B, x K} conv(s(a, K, B)) = intersection of all linear valid inequalities (v.i.) µ, x η 0 for S(A, K, B) C(A, K, B) = convex cone of all linear valid inequalities for S(A, K, B) { } = (µ; η 0 ) : µ E, µ 0, < η 0 inf µ, x x S(A,K,B) Goal: Study C(A, K, B) in order to characterize the properties of the linear v.i., and identify the necessary and/or sufficient ones defining conv(s(a, K, B)) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 7 / 27
13 Which Inequalities Should We Really Care About? S(A, K, B) = {x E : Ax B, x K} C(A, K, B) = convex cone of (µ; η 0 ) of all linear valid inequalities µ, x η 0 C(A, K, B) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 8 / 27
14 Which Inequalities Should We Really Care About? S(A, K, B) = {x E : Ax B, x K} C(A, K, B) = convex cone of (µ; η 0 ) of all linear valid inequalities µ, x η 0 Cone implied inequality, (δ; 0) for any δ K \ {0}, is always valid. Cone implied inequalities C(A, K, B) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 8 / 27
15 Which Inequalities Should We Really Care About? S(A, K, B) = {x E : Ax B, x K} C(A, K, B) = convex cone of (µ; η 0 ) of all linear valid inequalities µ, x η 0 Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 8 / 27
16 Which Inequalities Should We Really Care About? S(A, K, B) = {x E : Ax B, x K} C(A, K, B) = convex cone of (µ; η 0 ) of all linear valid inequalities µ, x η 0 Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. C m (A, K, B) = cone of K-minimal valid inequalities F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 8 / 27
17 Which Inequalities Should We Really Care About? S(A, K, B) = {x E : Ax B, x K} C(A, K, B) = convex cone of (µ; η 0 ) of all linear valid inequalities µ, x η 0 C m (A, K, B) = cone of K-minimal valid inequalities C(A, K, B) C m (A, K, B) Cone implied inequalities F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 8 / 27
18 K-minimal Inequalities Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. A K-minimal v.i. (µ; η 0 ) cannot be written as a sum of a cone implied inequality and another valid inequality. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 9 / 27
19 K-minimal Inequalities Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. A K-minimal v.i. (µ; η 0 ) cannot be written as a sum of a cone implied inequality and another valid inequality. Cone implied inequality (δ; 0) for any δ K \ {0} is never minimal. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 9 / 27
20 K-minimal Inequalities Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. A K-minimal v.i. (µ; η 0 ) cannot be written as a sum of a cone implied inequality and another valid inequality. Cone implied inequality (δ; 0) for any δ K \ {0} is never minimal. K-minimal v.i. exists if and only if valid equations of form δ, x = 0 with δ K \ {0}. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 9 / 27
21 K-minimal Inequalities Definition An inequality (µ; η 0 ) C(A, K, B) is a K-minimal valid inequality if for all ρ such that ρ K µ and ρ µ, we have ρ 0 < η 0. A K-minimal v.i. (µ; η 0 ) cannot be written as a sum of a cone implied inequality and another valid inequality. Cone implied inequality (δ; 0) for any δ K \ {0} is never minimal. K-minimal v.i. exists if and only if valid equations of form δ, x = 0 with δ K \ {0}. Theorem: [Sufficiency of K-minimal Inequalities] Whenever C m (A, K, B), K-minimal v.i. together with x K constraint are sufficient to describe conv(s(a, K, B)). F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 9 / 27
22 Some Properties We can show that Every valid inequality (µ; η 0 ) C(A, K, B) satisfies condition (A.0) µ Im(A ) + K. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 10 / 27
23 Some Properties We can show that Every valid inequality (µ; η 0 ) C(A, K, B) satisfies condition (A.0) µ Im(A ) + K. Remark For any µ Im(A ) + K, D µ := {λ R m : µ A λ K } ; and for any η 0 inf b B σ Dµ (b), where σ Dµ := support function of D µ, we have (µ; η 0 ) C(A, K, B). F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 10 / 27
24 Some Properties We can show that Every valid inequality (µ; η 0 ) C(A, K, B) satisfies condition (A.0) µ Im(A ) + K. K-minimal inequalities have more structure, i.e., they are K-sublinear: Definition An inequality (µ; η 0 ) is a K-sublinear v.i. (C a (A, K, B)) if it satisfies (A.1) 0 µ, u for all u s.t. Au = 0 and α, v u + v K v Ext(K) holds for some α Ext(K ), (A.2) η 0 µ, x for all x S(A, K, B). Condition (A.1) implies (A.0). F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 10 / 27
25 On Conditions for K-minimality and K-sublinearity We can establish necessary, and also sufficient conditions for an inequality (µ; η 0 ) to be K-minimal or K-sublinear via its relation with support function σ Dµ of the structured set D µ. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 11 / 27
26 On Conditions for K-minimality and K-sublinearity We can establish necessary, and also sufficient conditions for an inequality (µ; η 0 ) to be K-minimal or K-sublinear via its relation with support function σ Dµ of the structured set D µ. When K = R n +: K-sublinear v.i. are identical to the class of subadditive v.i. defined by Johnson 81, i.e., condition (A.1) is precisely condition (A.0) and (A.1i) for all i = 1,..., n, µ i µ, u for all u R n + s.t. Au = A i. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 11 / 27
27 On Conditions for K-minimality and K-sublinearity We can establish necessary, and also sufficient conditions for an inequality (µ; η 0 ) to be K-minimal or K-sublinear via its relation with support function σ Dµ of the structured set D µ. When K = R n +: K-sublinear v.i. are identical to the class of subadditive v.i. defined by Johnson 81, i.e., condition (A.1) is precisely condition (A.0) and (A.1i) for all i = 1,..., n, µ i µ, u for all u R n + s.t. Au = A i. Our sufficient condition for K-sublinearity matches precisely our necessary condition, resulting in (µ; η 0) C a(a, K, B) µ i = σ Dµ (A i ) for all i. All R n +-sublinear (and thus R n +-minimal) inequalities are generated by sublinear functions (subadditive and positively homogeneous, in fact also piecewise linear and convex), i.e., support functions σ Dµ ( ) of D µ. [ This recovers a number of results from Johnson 81, and Conforti et al. 13. ] F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 11 / 27
28 On Conditions for K-minimality and K-sublinearity We can establish necessary, and also sufficient conditions for an inequality (µ; η 0 ) to be K-minimal or K-sublinear via its relation with support function σ Dµ of the structured set D µ. When K = R n +: K-sublinear v.i. are identical to the class of subadditive v.i. defined by Johnson 81, i.e., condition (A.1) is precisely condition (A.0) and (A.1i) for all i = 1,..., n, µ i µ, u for all u R n + s.t. Au = A i. Our sufficient condition for K-sublinearity matches precisely our necessary condition, resulting in (µ; η 0) C a(a, K, B) µ i = σ Dµ (A i ) for all i. All R n +-sublinear (and thus R n +-minimal) inequalities are generated by sublinear functions (subadditive and positively homogeneous, in fact also piecewise linear and convex), i.e., support functions σ Dµ ( ) of D µ. [ This recovers a number of results from Johnson 81, and Conforti et al. 13. ] This is underlies a cut generating function view for MILPs. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 11 / 27
29 On Conditions for K-minimality and K-sublinearity For general regular cones K other than R n +, unfortunately there is a gap between our current necessary condition and our sufficient condition for K-minimality. Moreover, there is a simple example S(A, K, B) with K = L 3, where a necessary (in terms of convex hull description) family of K-minimal inequalities cannot be generated by any class of cut generating functions. This is in sharp contrast to MILP case, i.e., K = R n +, and, to the strong dual for MICP result of Moran et al. 12, which studied a more restrictive conic setup. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 12 / 27
30 Questions on Structure General Questions: S(A, K, B) = {x E : Ax B, x K} When can we characterize conv(s(a, K, B)) explicitly? Will (or when will) conv(s(a, K, B)) preserve the nice structural properties we originally had? F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 13 / 27
31 Questions on Structure General Questions: S(A, K, B) = {x E : Ax B, x K} When can we characterize conv(s(a, K, B)) explicitly? Will (or when will) conv(s(a, K, B)) preserve the nice structural properties we originally had? General case is too general for us to answer these questions... In the rest of this talk, we will study a simple (?) yet interesting case Joint work with S. Yıldız F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 13 / 27
32 Disjunctive Cuts for Lorentz Cone, L n Start with a simple set for x, i.e., a regular cone K R n Consider a two-term disjunction: either c1 T x c 1,0 or c2 T x c 2,0 must hold. Let C i := {x : ci T x c i,0, x K}. C 1 C 2 A special case is split disjunctions, i.e., c 1 = τc 2 for some τ > 0, and c 1,0c 2,0 > 0. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 14 / 27
33 Disjunctive Cuts for Lorentz Cone, L n Start with a simple set for x, i.e., a regular cone K R n Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x : c T i By setting [ c T A = 1 we arrive at c T 2 x c i,0, x K}. ] {[ {c1,0 } + R, and B = + R ] [ R {c 2,0 } + R + S(A, K, B) = {x R n : Ax B, x K} = C 1 C 2. ]} F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 14 / 27
34 Disjunctive Cuts for Lorentz Cone, L n Start with a simple set for x, i.e., a regular cone K R n Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x : c T i By setting [ c T A = 1 we arrive at c T 2 x c i,0, x K}. ] {[ {c1,0 } + R, and B = + R ] [ R {c 2,0 } + R + S(A, K, B) = {x R n : Ax B, x K} = C 1 C 2. We are interested in describing conv(s(a, K, B)) in the original space of variables: Is there any structure in conv(s(a, K, B))? Can we preserve the simple conic structure we started out with? ]} F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 14 / 27
35 Disjunctive Cuts for Lorentz Cone, L n Start with a simple set for x, i.e., a regular cone K R n Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x : c T i By setting [ c T A = 1 we arrive at c T 2 x c i,0, x K}. ] {[ {c1,0 } + R, and B = + R ] [ R {c 2,0 } + R + S(A, K, B) = {x R n : Ax B, x K} = C 1 C 2. ]} Simple set we start out can be U = {x R n : Qx d K} with Q R m n having full row rank. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 14 / 27
36 Approach Characterize the structure of K-minimal and tight valid linear inequalities F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 15 / 27
37 Approach Characterize the structure of K-minimal and tight valid linear inequalities Using conic duality, we group these linear inequalities appropriately, and thus derive a family of convex valid inequalities sufficient to describe the closed convex hull F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 15 / 27
38 Approach Characterize the structure of K-minimal and tight valid linear inequalities Using conic duality, we group these linear inequalities appropriately, and thus derive a family of convex valid inequalities sufficient to describe the closed convex hull Any structure beyond convexity? Understand when these convex inequalities are conic representable F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 15 / 27
39 Approach Characterize the structure of K-minimal and tight valid linear inequalities Using conic duality, we group these linear inequalities appropriately, and thus derive a family of convex valid inequalities sufficient to describe the closed convex hull Any structure beyond convexity? Understand when these convex inequalities are conic representable When does a single inequality from this family suffice? Characterize when only single inequality from this family is sufficient to describe the closed convex hull F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 15 / 27
40 Setup for Conic Disjunctive Cuts Start with a simple set for x, i.e., K Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x K : c T i x c i,0 }. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 16 / 27
41 Setup for Conic Disjunctive Cuts Start with a simple set for x, i.e., K Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x K : c T i x c i,0 }. WLOG we assume that c 1,0, c 2,0 {0, ±1} and C 1 and C 2 (in fact we assume C 1, C 2 are strictly feasible) C 1 C 2 and C 2 C 1. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 16 / 27
42 Setup for Conic Disjunctive Cuts Start with a simple set for x, i.e., K Consider a two-term disjunction: either c T 1 x c 1,0 or c T 2 x c 2,0 must hold. Let C i := {x K : c T i x c i,0 }. WLOG we assume that Assumption c 1,0, c 2,0 {0, ±1} and C 1 and C 2 (in fact we assume C 1, C 2 are strictly feasible) C 1 C 2 and C 2 C 1. This assumption is equivalent to The disjunction c T 1 x c 1,0 or c T 2 x c 2,0 satisfies {β R + : βc 1,0 c 2,0, c 2 βc 1 K} =, and {β R + : βc 2,0 c 1,0, c 1 βc 2 K} =. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 16 / 27
43 Structure of Valid Linear Inequalities Disjunction on K: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0, c 2,0 {0, ±1} Standard Approach For any valid linear inequality, µ x µ 0 for conv(c 1 C 2 ) there exists α 1, α 2 K, and β 1, β 2 R + s.t. µ = α 1 + β 1 c 1, µ = α 2 + β 2 c 2, µ 0 min{β 1 c 1,0, β 2 c 2,0 }. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 17 / 27
44 Structure of Valid Linear Inequalities Disjunction on K: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0, c 2,0 {0, ±1} Proposition For any K-minimal and tight valid linear inequality, µ x µ 0 for conv(c 1 C 2 ) there exists α 1, α 2 bd(k), and β 1, β 2 (R + \ {0}) s.t. µ = α 1 + β 1 c 1, µ = α 2 + β 2 c 2, min{c 1,0 β 1, c 2,0 β 2 } = µ 0 = min{c 1,0, c 2,0 }, and at least one of β 1 and β 2 is equal to 1. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 17 / 27
45 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
46 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
47 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } = {µ R n : µ (β c 1 c 2 ) µ n (βc 1,n c 2,n )= M2 }, µ β c 1 2 =µ n βc 1,n where M := (β 2 c c 2 2 2) (β 2 c 2 1,n c 2 2,n). F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
48 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } = {µ R n : µ (β c 1 c 2 ) µ n (βc 1,n c 2,n )= M2 }, µ β c 1 2 =µ n βc 1,n where M := (β 2 c c 2 2 2) (β 2 c 2 1,n c 2 2,n). x conv(c 1 C 2 ) x L n and µ x c 2,0 µ M(β, 1) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
49 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } = {µ R n : µ (β c 1 c 2 ) µ n (βc 1,n c 2,n )= M2 }, µ β c 1 2 =µ n βc 1,n where M := (β 2 c c 2 2 2) (β 2 c 2 1,n c 2 2,n). x conv(c 1 C 2 ) x L n and µ x c 2,0 µ M(β, 1) x L n { and inf µ x : µ M(β, 1) } c 2,0 µ F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
50 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } = {µ R n : µ (β c 1 c 2 ) µ n (βc 1,n c 2,n )= M2 }, µ β c 1 2 =µ n βc 1,n where M := (β 2 c c 2 2 2) (β 2 c 2 1,n c 2 2,n). x conv(c 1 C 2 ) x L n and µ x c 2,0 µ M(β, 1) x L n { and inf µ x : µ M(β, 1) } c 2,0 µ x L n and inf µ { µ x : µ M(β, } 1) c 2,0 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
51 Deriving a Nonlinear (but Convex) Valid Inequality when K = L n Assume c 1,0 c 2,0 β 2 = 1 Consider the set of undominated v.i. µ T x µ 0 for given β 1 = β > 0 and β 2 = 1, i.e., µ 0 = min{c 1,0, c 2,0 } = c 2,0 and µ M(β, 1):={µ R n : α 1, α 2 bd L n s.t. µ = α 1 + βc 1 = α 2 + c 2 } = {µ R n : µ (β c 1 c 2 ) µ n (βc 1,n c 2,n )= M2 }, µ β c 1 2 =µ n βc 1,n where M := (β 2 c c 2 2 2) (β 2 c 2 1,n c 2 2,n). x conv(c 1 C 2 ) x L n and µ x c 2,0 µ M(β, 1) x L n { and inf µ x : µ M(β, 1) } c 2,0 µ { x L n and inf µ x : µ } M(β, 1) c 2,0 µ {βc 1 ρ + M2 ( τ : ρ+τ x L n and max ρ,τ ) β c 1 c 2 =x, ρ L } c n βc 1,n + c 2,0 2,n F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 18 / 27
52 Convex Disjunctive Cut for K = L n Theorem Disjunction on second-order cone, L n = {x R n : x n x 2 }: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0 c 2,0 For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), then the following inequality is valid for conv(c 1 C 2 ): 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (xn 2 x 2 2 ) where N(β) := β c 1 c (βc 1,n c 2,n ) 2. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 19 / 27
53 Convex Disjunctive Cut for K = L n Theorem Disjunction on second-order cone, L n = {x R n : x n x 2 }: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0 c 2,0 For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), then the following inequality is valid for conv(c 1 C 2 ): 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (xn 2 x 2 2 ) where N(β) := β c 1 c (βc 1,n c 2,n ) 2. From its construction, this inequality exactly captures all undominated linear v.i. µ T x µ 0 corresponding to β 1 = β and β 2 = 1, e.g., µ 0 = c 2,0 and µ M(β, 1) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 19 / 27
54 Convex Disjunctive Cut for K = L n Theorem Disjunction on second-order cone, L n = {x R n : x n x 2 }: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0 c 2,0 For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), then the following inequality is valid for conv(c 1 C 2 ): 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (xn 2 x 2 2 ) where N(β) := β c 1 c (βc 1,n c 2,n ) 2. From its construction, this inequality exactly captures all undominated linear v.i. µ T x µ 0 corresponding to β 1 = β and β 2 = 1, e.g., µ 0 = c 2,0 and µ M(β, 1) is valid and convex F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 19 / 27
55 Convex Disjunctive Cut for K = L n Theorem Disjunction on second-order cone, L n = {x R n : x n x 2 }: either c T 1 x c 1,0 or c T 2 x c 2,0 with c 1,0 c 2,0 For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), then the following inequality is valid for conv(c 1 C 2 ): 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (xn 2 x 2 2 ) where N(β) := β c 1 c (βc 1,n c 2,n ) 2. From its construction, this inequality exactly captures all undominated linear v.i. µ T x µ 0 corresponding to β 1 = β and β 2 = 1, e.g., µ 0 = c 2,0 and µ M(β, 1) is valid and convex reduces to the linear inequality βc 1 x c 2,0 in L n when βc 1 c 2 ± bd L n F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 19 / 27
56 Structure of Convex Valid Inequalities 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (x 2 n x 2 2 ) Any further structure than convexity? F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 20 / 27
57 Structure of Convex Valid Inequalities 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (x 2 n x 2 2 ) Proposition Any further structure than convexity? An equivalent conic quadratic form given by ( ) N(β)x + 2(c2 β c x c 2,0 ) 1 c 2 L n βc 1,n + c 2,n is valid whenever a symmetry condition, e.g., 2c 2,0 + (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (xn 2 x 2 ) holds for all x conv(c 1 C 2 ). F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 20 / 27
58 Structure of Convex Valid Inequalities 2c 2,0 (βc 1 + c 2 ) x ((βc 1 c 2 ) x) 2 + N(β) (x 2 n x 2 2 ) Any further structure than convexity? ( N(β)x + 2(c2 x c 2,0 ) ) β c 1 c 2 L n βc 1,n + c 2,n An equivalent conic quadratic form is valid, e.g., symmetry condition holds, when C 1 C 2 =, i.e., a proper split disjunction, or {x L n : βc 1 x c 2,0, c 2 x c 2,0}={x L n : βc 1 x = c 2,0, c 2 x = c 2,0} F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 20 / 27
59 When does a Single Convex Inequality Suffice? A parametric family of convex inequalities: For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), 2c 2,0 (βc 1 + c 2 ) x is valid for conv(c 1 C 2 ). ((βc 1 c 2 ) x) 2 + N(β) (x 2 n x 2 2 ) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 21 / 27
60 When does a Single Convex Inequality Suffice? A parametric family of convex inequalities: For any β > 0 s.t. βc 1,0 c 2,0 and βc 1 c 2 / ±int(l n ), 2c 2,0 (βc 1 + c 2 ) x is valid for conv(c 1 C 2 ). ((βc 1 c 2 ) x) 2 + N(β) (x 2 n x 2 2 ) Theorem In certain cases such as c 1 L n or c 2 L n, or c 1,0 = c 2,0 {±1} and conv(c 1 C 2 ) is closed, e.g., in the case of split disjunctions, it is sufficient (for conv(c 1 C 2 )) to consider only one inequality with β = 1. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 21 / 27
61 Example: Nice Case Disjunction: x 3 1 or x 1 + x 3 1 conv(c 1 C 2 ) = { } x L 3 : 2 (x 1 + 2x 3 ) x3 2 x 2 2 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 22 / 27
62 Example: Nice Case Disjunction: x 3 1 or x 1 + x 3 1 conv(c 1 C 2 ) = { } x L 3 : 2 (x 1 + 2x 3 ) x3 2 x 2 2 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 22 / 27
63 Not So Nice Case There are cases when we need infinitely many convex inequalities from this family. Recessive directions, and conv(c 1 C 2 ) being non-closed, play a key role in these cases. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 23 / 27
64 Not So Nice Case There are cases when we need infinitely many convex inequalities from this family. Recessive directions, and conv(c 1 C 2 ) being non-closed, play a key role in these cases. We can still give expressions for a single inequality describing conv(c 1 C 2 ), but it is really nasty looking... F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 23 / 27
65 Example: Nasty Case Disjunction: x 3 1 or x 2 0 conv(c 1 C 2 ) = {x L 3 : x 2 1, 1 + x 1 x 3 } 1 max{0, x 2 } 2 F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 24 / 27
66 Final Remarks Introduce and study the properties of K-minimal and K-sublinear inequalities for conic MIPs F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 25 / 27
67 Final Remarks Introduce and study the properties of K-minimal and K-sublinear inequalities for conic MIPs For two-term disjunctions on Lorentz cone, L n Derive explicit expressions for disjunctive conic cuts Cover most of the recent results on conic MIR, split, and two-term disjunctive inequalities for Lorentz cones (i.e., Belotti et al. 11, Andersen & Jensen 13, Modaresi et al. 13) Extends to elementary split disjunctions on p-order cones F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 25 / 27
68 Final Remarks Introduce and study the properties of K-minimal and K-sublinear inequalities for conic MIPs For two-term disjunctions on Lorentz cone, L n Derive explicit expressions for disjunctive conic cuts Cover most of the recent results on conic MIR, split, and two-term disjunctive inequalities for Lorentz cones (i.e., Belotti et al. 11, Andersen & Jensen 13, Modaresi et al. 13) Extends to elementary split disjunctions on p-order cones More intuitive and elegant derivations leading to new insights When we can have valid conic inequalities in the original space When a single convex inequality will suffice F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 25 / 27
69 Final Remarks Introduce and study the properties of K-minimal and K-sublinear inequalities for conic MIPs For two-term disjunctions on Lorentz cone, L n Derive explicit expressions for disjunctive conic cuts Cover most of the recent results on conic MIR, split, and two-term disjunctive inequalities for Lorentz cones (i.e., Belotti et al. 11, Andersen & Jensen 13, Modaresi et al. 13) Extends to elementary split disjunctions on p-order cones More intuitive and elegant derivations leading to new insights When we can have valid conic inequalities in the original space When a single convex inequality will suffice Extends to disjunctions on cross-sections of the Lorentz cone (Joint work with S. Yıldız and G. Cornuéjols) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 25 / 27
70 Thank you! F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 26 / 27
71 References Kılınç-Karzan, F., On Minimal Valid Inequalities for Mixed Integer Conic Programs. GSIA Working Paper Number: 2013-E20, GSIA, Carnegie Mellon University, Pittsburgh, PA, June Kılınç-Karzan, F., Yıldız, S., Two-Term Disjunctions on the Second-Order Cone. April A shorter version is published as part of Proceedings of 17 th IPCO Conference. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 27 / 27
72 A Simple Example for Insufficiency of Cut Generating Functions K = L 3, A = [1, 0, 0] and B = { 1, 1}, i.e., S(A, K, B) = {x R 3 : x 1 { 1, 1}, x 3 x x 2 2 } x 3 (0, 0) x 1 x 2 conv(s(a, K, B)) = {x R 3 : 1 x 1 1, x x 2 2 } F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 28 / 27
73 A Simple Example for Insufficiency of Cut Generating Functions K = L 3, A = [1, 0, 0] and B = { 1, 1}, i.e., S(A, K, B) = {x R 3 : x 1 { 1, 1}, x 3 x x 2 2 } conv(s(a, K, B)) = {x R 3 : 1 x 1 1, x x 2 2 } K-minimal inequalities are: (a) µ (+) = (1; 0; 0) with η (+) 0 = 1 and µ ( ) = ( 1; 0; 0) with η ( ) 0 = 1; (b) µ (t) = (0; t; t 2 + 1) with η (t) 0 = 1 for all t R. F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 28 / 27
74 A Simple Example for Insufficiency of Cut Generating Functions K = L 3, A = [1, 0, 0] and B = { 1, 1}, i.e., S(A, K, B) = {x R 3 : x 1 { 1, 1}, x 3 x x 2 2 } conv(s(a, K, B)) = {x R 3 : 1 x 1 1, x x 2 2 } K-minimal inequalities are: (a) µ (+) = (1; 0; 0) with η (+) 0 = 1 and µ ( ) = ( 1; 0; 0) with η ( ) 0 = 1; (b) µ (t) = (0; t; t 2 + 1) with η (t) 0 = 1 for all t R. (these can be expressed as a single conic inequality x x 2 2.) F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 28 / 27
75 A Simple Example for Insufficiency of Cut Generating Functions K = L 3, A = [1, 0, 0] and B = { 1, 1}, i.e., S(A, K, B) = {x R 3 : x 1 { 1, 1}, x 3 x x 2 2 } conv(s(a, K, B)) = {x R 3 : 1 x 1 1, x x 2 2 } K-minimal inequalities are: (a) µ (+) = (1; 0; 0) with η (+) 0 = 1 and µ ( ) = ( 1; 0; 0) with η ( ) 0 = 1; (b) µ (t) = (0; t; t 2 + 1) with η (t) 0 = 1 for all t R. (these can be expressed as a single conic inequality x x 2 2.) Linear inequalities in (b) cannot be generated by any cut generating function ρ( ), i.e., ρ(a i ) = µ (t) i is not possible for any function ρ( ). [Sharp contrast to the strong conic IP dual result of Moran, Dey, & Vielma 12. ] F. Kılınç-Karzan (CMU) Structure in Mixed Integer Conic Sets 28 / 27
Structure 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 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 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 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 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 informationLow-Complexity Relaxations and Convex Hulls of Disjunctions on the Positive Semidefinite Cone and General Regular Cones
Low-Complexity Relaxations and Convex Hulls of Disjunctions on the Positive Semidefinite Cone and General Regular Cones Sercan Yıldız and Fatma Kılınç-Karzan Tepper School of Business, Carnegie Mellon
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 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 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 informationHow to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic
How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic arxiv:1406.1031v2 [math.oc] 5 Jun 2014 Samuel Burer Fatma Kılınç-Karzan June 3, 2014 Abstract A recent series of papers
More informationSplit Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed Integer Programming Juan Pablo Vielma Massachusetts Institute of Technology joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of
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 informationarxiv: v3 [math.oc] 24 May 2016
Mathematical Programming manuscript No. (will be inserted by the editor) How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic Samuel Burer Fatma Kılınç-Karzan arxiv:1406.1031v3
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationMinimal Valid Inequalities for Integer Constraints
Minimal Valid Inequalities for Integer Constraints Valentin Borozan LIF, Faculté des Sciences de Luminy, Université de Marseille, France borozan.valentin@gmail.com and Gérard Cornuéjols Tepper School of
More 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 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 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 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 informationIntersection cuts for nonlinear integer programming: convexification techniques for structured sets
Noname manuscript No. (will be inserted by the editor Intersection cuts for nonlinear integer programming: convexification techniques for structured sets Sina Modaresi Mustafa R. Kılınç Juan Pablo Vielma
More informationIntersection cuts for nonlinear integer programming: convexification techniques for structured sets
Noname manuscript No. (will be inserted by the editor) Intersection cuts for nonlinear integer programming: convexification techniques for structured sets Sina Modaresi Mustafa R. Kılınç Juan Pablo Vielma
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 informationHow to convexify the intersection of a second order cone and a nonconvex quadratic
Math. Program., Ser. A (217 162:393 429 DOI 1.17/s117-16-145-z FULL LENGTH PAPER How to convexify the intersection of a second order cone and a nonconvex quadratic Samuel Burer 1 Fatma Kılınç-Karzan 2
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 informationRank-one Generated Spectral Cones Defined by Two Homogeneous Linear Matrix Inequalities
Rank-one Generated Spectral Cones Defined by Two Homogeneous Linear Matrix Inequalities C.J. Argue Joint work with Fatma Kılınç-Karzan October 22, 2017 INFORMS Annual Meeting Houston, Texas C. Argue, F.
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 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 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 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 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 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 informationDisjunctive conic cuts: The good, the bad, and implementation
Disjunctive conic cuts: The good, the bad, and implementation MOSEK workshop on Mixed-integer conic optimization Julio C. Góez January 11, 2018 NHH Norwegian School of Economics 1 Motivation Goals! Extend
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 informationVALID INEQUALITIES AND REFORMULATION TECHNIQUES FOR MIXED INTEGER NONLINEAR PROGRAMMING
VALID INEQUALITIES AND REFORMULATION TECHNIQUES FOR MIXED INTEGER NONLINEAR PROGRAMMING by Sina Modaresi B.S., Sharif University of Technology, 2010 M.S., University of Pittsburgh, 2012 Submitted to the
More informationInteger programming (part 2) Lecturer: Javier Peña Convex Optimization /36-725
Integer programming (part 2) Lecturer: Javier Peña Convex Optimization 10-725/36-725 Last time: integer programming Consider the problem min x subject to f(x) x C x j Z, j J where f : R n R, C R n are
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 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 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 informationAdvances in CPLEX for Mixed Integer Nonlinear Optimization
Pierre Bonami and Andrea Tramontani IBM ILOG CPLEX ISMP 2015 - Pittsburgh - July 13 2015 Advances in CPLEX for Mixed Integer Nonlinear Optimization 1 2015 IBM Corporation CPLEX Optimization Studio 12.6.2
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 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 Subadditive Duality for Conic Mixed-Integer Programs
arxiv:1808.10419v1 [math.oc] 30 Aug 2018 On Subadditive Duality for Conic Mixed-Integer Programs Diego A. Morán R. Burak Kocuk Abstract It is known that the subadditive dual of a conic mixed-integer program
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 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 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 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 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 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 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 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 information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
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 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 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 informationCuts for mixed 0-1 conic programs
Cuts for mixed 0-1 conic programs G. Iyengar 1 M. T. Cezik 2 1 IEOR Department Columbia University, New York. 2 GERAD Université de Montréal, Montréal TU-Chemnitz Workshop on Integer Programming and Continuous
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 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 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 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 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 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 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 informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
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 informationExample: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma
4-1 Algebra and Duality P. Parrilo and S. Lall 2006.06.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone of valid
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 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 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 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 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 informationSelected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.
. Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,
More informationValid Inequalities for Potential-Constrained Network Design
Valid Inequalities for Potential-Constrained Network Design Hyemin Jeon Jeff Linderoth Jim Luedtke Dept. of ISyE UW-Madison jrluedt1@wisc.edu MINLP 2014, CMU, Pittsburgh, PA June 3, 2014 Jeon, Linderoth,
More informationIntroduction to Koecher Cones. Michael Orlitzky
Introduction to Koecher Cones Extreme Points Definition 1. Let S be a convex set in some vector space. We say that the point x S is an extreme point of the set S if x = λx 1 + (1 λ)x 2 for λ (0, 1) implies
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 informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationSolving Mixed-Integer Nonlinear Programs
Solving Mixed-Integer Nonlinear Programs (with SCIP) Ambros M. Gleixner Zuse Institute Berlin MATHEON Berlin Mathematical School 5th Porto Meeting on Mathematics for Industry, April 10 11, 2014, Porto
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 informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
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 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 informationLecture: Cone programming. Approximating the Lorentz cone.
Strong relaxations for discrete optimization problems 10/05/16 Lecture: Cone programming. Approximating the Lorentz cone. Lecturer: Yuri Faenza Scribes: Igor Malinović 1 Introduction Cone programming is
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 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 information23. Cutting planes and branch & bound
CS/ECE/ISyE 524 Introduction to Optimization Spring 207 8 23. Cutting planes and branch & bound ˆ Algorithms for solving MIPs ˆ Cutting plane methods ˆ Branch and bound methods Laurent Lessard (www.laurentlessard.com)
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 informationCompletely Positive Reformulations for Polynomial Optimization
manuscript No. (will be inserted by the editor) Completely Positive Reformulations for Polynomial Optimization Javier Peña Juan C. Vera Luis F. Zuluaga Received: date / Accepted: date Abstract Polynomial
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 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 informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee227c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee227c@berkeley.edu
More informationCut-generating functions and S-free sets
Cut-generating functions and S-free sets Michele Conforti Dip.Mat., Univ. di Padova, Italy email: conforti@math.unipd.it Gérard Cornuéjols Tepper School of Business, Carnegie Mellon Univ., Pittsburgh,
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 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 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 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 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 informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More informationThe Value function of a Mixed-Integer Linear Program with a Single Constraint
The Value Function of a Mixed Integer Linear Programs with a Single Constraint MENAL GUZELSOY TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu University of Wisconsin February
More informationConvex sets, conic matrix factorizations and conic rank lower bounds
Convex sets, conic matrix factorizations and conic rank lower bounds Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationLecture 7: Lagrangian Relaxation and Duality Theory
Lecture 7: Lagrangian Relaxation and Duality Theory (3 units) Outline Lagrangian dual for linear IP Lagrangian dual for general IP Dual Search Lagrangian decomposition 1 / 23 Joseph Louis Lagrange Joseph
More information