Investigating Mixed-Integer Hulls using a MIP-Solver
|
|
- Brendan Mitchell
- 6 years ago
- Views:
Transcription
1 Investigating Mixed-Integer Hulls using a MIP-Solver Matthias Walter Otto-von-Guericke Universität Magdeburg Joint work with Volker Kaibel (OvGU) Aussois Combinatorial Optimization Workshop 2015
2 Outline 1 Polyhedral Combinatorics 1 Introduction 2 Usual Approach 3 Limitations 2 Vision 3 Facets 1 Polarity 2 Target Cuts 4 Affine Hull 5 Minimizing the 1-Norm of Basis Vectors 1 Problem 2 2 Vectors: Exact Approach 3 2 Vectors: Heuristic Approach Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
3 Setup Problems in Question We consider mixed-integer programs with rational data: max c, x s.t. Ax b x i Z i I [n] Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
4 Setup Problems in Question We consider mixed-integer programs with rational data: max c, x s.t. Ax b x i Z i I [n] Denote by R = {x R n : Ax b} the relaxation polyhedron, by L = {x R n : x i Z i I } the integrality restrictions, and by P = conv.hull(r L) the mixed-integer hull. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
5 Setup Problems in Question We consider mixed-integer programs with rational data: max c, x s.t. Ax b x i Z i I [n] Denote by R = {x R n : Ax b} the relaxation polyhedron, by L = {x R n : x i Z i I } the integrality restrictions, and by P = conv.hull(r L) the mixed-integer hull. Facts P is a polyhedron again. For most (e.g., NP-hard) problems, P has many facets. MIP-solvers are really fast these days. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
6 Polyhedral Combinatorics Another Fact The time a MIP-solver needs for solving depends on the strength of the relaxation, i.e., how well P is approximated by R. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
7 Polyhedral Combinatorics Another Fact The time a MIP-solver needs for solving depends on the strength of the relaxation, i.e., how well P is approximated by R. Strengthening a Relaxation Generic cutting planes: GMI, MIR, CG, Lift & Project,... Problem-specific inequalities: Problem-dependent Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
8 Polyhedral Combinatorics Another Fact The time a MIP-solver needs for solving depends on the strength of the relaxation, i.e., how well P is approximated by R. Strengthening a Relaxation Generic cutting planes: GMI, MIR, CG, Lift & Project,... Problem-specific inequalities: Problem-dependent Goals of Polyhedral Combinatorics Given a MIP-model for a problem, find inequalities valid for P (but not for R), develop algorithms (exact or heuristics) to separate these inequalities if there are too many, determine the dimension of P, i.e., find valid equations, and prove if/when the inequalities define facets of P. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
9 Usual Approach for IPs Step 1: Find all feasible points (a) By hand / handcrafted software (b) Some tool, e.g. PORTA s vint functionality or azove Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
10 Usual Approach for IPs Step 1: Find all feasible points (a) By hand / handcrafted software (b) Some tool, e.g. PORTA s vint functionality or azove Step 2: Compute Outer Description There are quite a few tools (PORTA, Polymake, azove) and several algorithms: The Beneath-and-Beyond method The Double-Description method Lexicographic Reverse Search Pyramid decomposition (mixture of beneath-and-beyond and Fourier-Motzkin) Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
11 Usual Approach for IPs Step 1: Find all feasible points (a) By hand / handcrafted software (b) Some tool, e.g. PORTA s vint functionality or azove Step 2: Compute Outer Description There are quite a few tools (PORTA, Polymake, azove) and several algorithms: The Beneath-and-Beyond method The Double-Description method Lexicographic Reverse Search Pyramid decomposition (mixture of beneath-and-beyond and Fourier-Motzkin) Step 3: Generalize Inequalities There s only one main tool here: The mathematician. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
12 Limitations Memory and Time The dominant of the cut polytope (corresponds to MinCut problem) has among others a facet per disjoint union of cycles joined together by any spanning tree! Alevras ( 99) enumerated the facets for this polyhedron for the complete graph on 8 nodes, including 2 billions of the above type. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
13 Limitations Memory and Time The dominant of the cut polytope (corresponds to MinCut problem) has among others a facet per disjoint union of cycles joined together by any spanning tree! Alevras ( 99) enumerated the facets for this polyhedron for the complete graph on 8 nodes, including 2 billions of the above type. Continuous Variables The mixed-integer case is usually harder for enumeration tools. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
14 Limitations Memory and Time The dominant of the cut polytope (corresponds to MinCut problem) has among others a facet per disjoint union of cycles joined together by any spanning tree! Alevras ( 99) enumerated the facets for this polyhedron for the complete graph on 8 nodes, including 2 billions of the above type. Continuous Variables The mixed-integer case is usually harder for enumeration tools. Symmetry Often, facets have a lot of symmetry and it is only sometimes possible to exploit (parts of it) during the convex-hull computation. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
15 Limitations Memory and Time The dominant of the cut polytope (corresponds to MinCut problem) has among others a facet per disjoint union of cycles joined together by any spanning tree! Alevras ( 99) enumerated the facets for this polyhedron for the complete graph on 8 nodes, including 2 billions of the above type. Continuous Variables The mixed-integer case is usually harder for enumeration tools. Symmetry Often, facets have a lot of symmetry and it is only sometimes possible to exploit (parts of it) during the convex-hull computation. Specific Objective Functions Which are the facets useful when optimizing specific objective functions? Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
16 Vision Fact Reminder PORTA & friends need a moment for a 50-dimensional polytope, while a MIP with 50 variables is usually solved within a second! Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
17 Vision Fact Reminder PORTA & friends need a moment for a 50-dimensional polytope, while a MIP with 50 variables is usually solved within a second! Goal of this work: Use MIP-solvers to determine facets! (and the affine hull) Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
18 Assumptions Definition (MIP-oracle Pair) A MIP-oracle pair for a rational MIP R L with relaxation R and integrality restrictions L consists of an oracle which solves max { c, x : x R L} for any objective c Q n, and an oracle which can separate over R, i.e., decides for given ˆx, whether ˆx R holds, and if not, yields a separating inequality. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
19 Assumptions Definition (MIP-oracle Pair) A MIP-oracle pair for a rational MIP R L with relaxation R and integrality restrictions L consists of an oracle which solves max { c, x : x R L} for any objective c Q n, and an oracle which can separate over R, i.e., decides for given ˆx, whether ˆx R holds, and if not, yields a separating inequality. Remark We can use an ordinary MIP solver and apply rational reconstruction techniques to the floating-point solution Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
20 Assumptions Definition (MIP-oracle Pair) A MIP-oracle pair for a rational MIP R L with relaxation R and integrality restrictions L consists of an oracle which solves max { c, x : x R L} for any objective c Q n, and an oracle which can separate over R, i.e., decides for given ˆx, whether ˆx R holds, and if not, yields a separating inequality. Remark We can use an ordinary MIP solver and apply rational reconstruction techniques to the floating-point solution (and hope for correctness). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
21 Facets Finding Facets Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
22 Polarity - Basics Definition Let P R n be a polyhedron containing the origin O. Then the set {y R n : y, x 1 x P} is called the polar dual of P. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
23 Polarity - Basics Definition Let P R n be a polyhedron containing the origin O. Then the set {y R n : y, x 1 x P} is called the polar dual of P. Since the polar dual has a lineality space if P is not full-dimensional, let P := {y lin.hull (P) : y, x 1 x P}. denote the truncated polar dual of P. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
24 Polarity - Basics Definition Let P R n be a polyhedron containing the origin O. Then the set {y R n : y, x 1 x P} is called the polar dual of P. Since the polar dual has a lineality space if P is not full-dimensional, let P := {y lin.hull (P) : y, x 1 x P}. denote the truncated polar dual of P. Proposition (see Schrijver 86) (P ) = P x is a point in (vertex of) P if and only if x, y 1 defines an inequality for (facet of) P. P is bounded if and only if P contains O in its relative interior. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
25 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
26 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. 2 If not, we obtain a point ˆx R \ P. Let s find a facet separating ˆx! Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
27 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. 2 If not, we obtain a point ˆx R \ P. Let s find a facet separating ˆx! 4 By polarity, we want a vertex y of (P o) with ˆx o, y > 1. For this we solve max ˆx o, y s.t. x o, y 1 x P y lin.hull(p o) using the simplex method. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
28 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. 2 If not, we obtain a point ˆx R \ P. Let s find a facet separating ˆx! 4 By polarity, we want a vertex y of (P o) with ˆx o, y > 1. For this we solve max ˆx o, y s.t. x o, y 1 x P y lin.hull(p o) using the simplex method. 5 The separation problem for the first constraint is again by polarity the problem to maximize ŷ over P (Many oracle calls!). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
29 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. 2 If not, we obtain a point ˆx R \ P. Let s find a facet separating ˆx! 3 Restrict to facets that are tight at points x 1,..., x k. 4 By polarity, we want a vertex y of (P o) with ˆx o, y > 1. For this we solve max ˆx o, y s.t. x o, y 1 x P using the simplex method. y lin.hull(p o) x i o, y = 1 i = 1,..., k 5 The separation problem for the first constraint is again by polarity the problem to maximize ŷ over P (Many oracle calls!). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
30 Using Polarity to Obtain Facets Suppose we know a point o in the relative interior of P. 1 Solve max x R c, x and max x P c, x (2 oracle calls!). If objective values coincide, R approximates P well in direction c. 2 If not, we obtain a point ˆx R \ P. Let s find a facet separating ˆx! 3 Restrict to facets that are tight at points x 1,..., x k. 4 By polarity, we want a vertex y of (P o) with ˆx o, y > 1. For this we solve max ˆx o, y s.t. x o, y 1 x P using the simplex method. y lin.hull(p o) x i o, y = 1 i = 1,..., k 5 The separation problem for the first constraint is again by polarity the problem to maximize ŷ over P (Many oracle calls!). Not new: Target Cuts invented by Buchheim, Liers & Oswald, 08 Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
31 Choice of the Interior Point Proposition The objective value of a facet a, x β of P equals a, ˆx a, o. β a, o ˆx x o maximize Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
32 Choice of the Interior Point Proposition The objective value of a facet a, x β of P equals a, ˆx a, o. β a, o ˆx x o maximize Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
33 Choice of the Interior Point Proposition The objective value of a facet a, x β of P equals a, ˆx a, o. β a, o ˆx x o maximize Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
34 Choice of the Interior Point Proposition The objective value of a facet a, x β of P equals a, ˆx a, o. β a, o ˆx x o o maximize Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
35 Affine Hull Computing Affine Hull & Dimension Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
36 Computing the Affine Hull Input: MIP-oracle pair for = P = conv.hull(r L) R n. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
37 Computing the Affine Hull Input: MIP-oracle pair for = P = conv.hull(r L) R n. Output: Dimension d of P (d + 1)-many affinely independent points in P (n d)-many irredundant equations Cx = d valid for P Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
38 Computing the Affine Hull Input: MIP-oracle pair for = P = conv.hull(r L) R n. Output: Dimension d of P (d + 1)-many affinely independent points in P (n d)-many irredundant equations Cx = d valid for P Ideas: 1 Maintain known equations Cx = d and points x 1, x 2,..., x l P. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
39 Computing the Affine Hull Input: Output: Ideas: MIP-oracle pair for = P = conv.hull(r L) R n. Dimension d of P (d + 1)-many affinely independent points in P (n d)-many irredundant equations Cx = d valid for P 1 Maintain known equations Cx = d and points x 1, x 2,..., x l P. 2 Repeatedly find a useful direction c R n, and compute z + := max x P c, x and z := min x P c, x (2 oracle calls!). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
40 Computing the Affine Hull Input: Output: Ideas: MIP-oracle pair for = P = conv.hull(r L) R n. Dimension d of P (d + 1)-many affinely independent points in P (n d)-many irredundant equations Cx = d valid for P 1 Maintain known equations Cx = d and points x 1, x 2,..., x l P. 2 Repeatedly find a useful direction c R n, and compute z + := max x P c, x and z := min x P c, x (2 oracle calls!). 3 If we are lucky and z + = z holds, then c, x = z + is a valid equation. To make progress, we want c to be linear independent of C s rows. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
41 Computing the Affine Hull Input: Output: Ideas: MIP-oracle pair for = P = conv.hull(r L) R n. Dimension d of P (d + 1)-many affinely independent points in P (n d)-many irredundant equations Cx = d valid for P 1 Maintain known equations Cx = d and points x 1, x 2,..., x l P. 2 Repeatedly find a useful direction c R n, and compute z + := max x P c, x and z := min x P c, x (2 oracle calls!). 3 If we are lucky and z + = z holds, then c, x = z + is a valid equation. To make progress, we want c to be linear independent of C s rows. 4 If we also choose c to be orthogonal to aff.hull(x 1,..., x l ) (that is, c, x i = c, x 1 for all i = 2,..., l), the result z + > z yields a point x l+1 affinely independent of x 1,..., x l. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
42 Computing the Affine Hull (cont.) Reminder: x 1,..., x l P R n are affinely independent points found so far. Cx = d are the equations found so far. Algebra: Let D R (l 1) n be the matrix whose rows are x i x 1 for i = 2,..., l. We can choose c (ker C ker D) \ O. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
43 Computing the Affine Hull (cont.) Reminder: x 1,..., x l P R n are affinely independent points found so far. Cx = d are the equations found so far. Algebra: Let D R (l 1) n be the matrix whose rows are x i x 1 for i = 2,..., l. We can choose c (ker C ker D) \ O. Drawback: It works but we modeled linear independence by orthogonality! Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
44 Computing the Affine Hull (cont.) Reminder: x 1,..., x l P R n are affinely independent points found so far. Cx = d are the equations found so far. Algebra: Let D R (l 1) n be the matrix whose rows are x i x 1 for i = 2,..., l. We can choose c (ker C ker D) \ O. Drawback: It works but we modeled linear independence by orthogonality! Conclusion: Consider a basis c 1,..., c k of ker D and use each c i as a direction (or skip c i if it linearly depends on C s rows). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
45 Computing the Affine Hull (cont.) Reminder: x 1,..., x l P R n are affinely independent points found so far. Cx = d are the equations found so far. Algebra: Let D R (l 1) n be the matrix whose rows are x i x 1 for i = 2,..., l. We can choose c (ker C ker D) \ O. Drawback: It works but we modeled linear independence by orthogonality! Conclusion: Consider a basis c 1,..., c k of ker D and use each c i as a direction (or skip c i if it linearly depends on C s rows). Open Question: Can one do better than 2n oracle calls? Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
46 Minimize 1-Norm Making Equations and Facets Pretty Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
47 1-Norm Minimization Motivation Readability of produced equations & facets! a, x β with a Z n and β Z where (a, β) is a primitive vector. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
48 1-Norm Minimization Motivation Readability of produced equations & facets! a, x β with a Z n and β Z where (a, β) is a primitive vector. If dim(p) n, facet representations are not unique and equation normals are an arbitrary basis of aff.hull (P). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
49 1-Norm Minimization Motivation Readability of produced equations & facets! a, x β with a Z n and β Z where (a, β) is a primitive vector. If dim(p) n, facet representations are not unique and equation normals are an arbitrary basis of aff.hull (P). Goal: Consider pairs of vectors and replace one by a nice linear combination. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
50 1-Norm Minimization Motivation Readability of produced equations & facets! a, x β with a Z n and β Z where (a, β) is a primitive vector. If dim(p) n, facet representations are not unique and equation normals are an arbitrary basis of aff.hull (P). Goal: Consider pairs of vectors and replace one by a nice linear combination. Problem (1-Norm Minimization in Dimension Two) Input are two linearly independent vectors u, v Z n. Find λ, µ Q with λ 0 and λu + µv Z n minimizing λu + µv 1. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
51 2 Vectors, Step 1: Lattice Basis Problem (1-Norm Minimization in Dimension Two) Input are two linearly independent vectors u, v Z n. Find λ, µ Q with λ 0 and λu + µv Z n minimizing λu + µv 1. Lemma ( ) u By computing the Hermite-Normal-Form of Z 2 n, we can replace u, v by a lattice basis u, v of lin.hull (u, v) Z n... v Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
52 2 Vectors, Step 1: Lattice Basis Problem (1-Norm Minimization in Dimension Two) Input are two linearly independent vectors u, v Z n. Find λ, µ Q with λ 0 and λu + µv Z n minimizing λu + µv 1. Lemma ( ) u By computing the Hermite-Normal-Form of Z 2 n, we can replace u, v by a lattice basis u, v of lin.hull (u, v) Z n such that λu + µv is a multiple of v if and only if λ = 0. v Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
53 2 Vectors, Step 1: Lattice Basis Problem (1-Norm Minimization in Dimension Two) Input are two linearly independent vectors u, v Z n. Find λ, µ Q with λ 0 and λu + µv Z n minimizing λu + µv 1. Lemma ( ) u By computing the Hermite-Normal-Form of Z 2 n, we can replace u, v by a lattice basis u, v of lin.hull (u, v) Z n such that λu + µv is a multiple of v if and only if λ = 0. v Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
54 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
55 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
56 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
57 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. 1 u = = v 2 µ λ Objective: λu + µv 1 Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
58 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. µ 1 u = = v 2 10 u λ Objective: λu + µv 1 Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
59 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. 1 u = = v 2 µ u + v u λ Objective: λu + µv 1 Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
60 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. 1 u = = v 2 µ u + v u 15 2u v λ Objective: λu + µv 1 15 u 3v Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
61 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. 1 u = = v 2 µ u + v u 25 2u + v 15 2u v λ Objective: λu + µv 1 15 u 3v Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
62 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. 1 u = = v 2 Objective: λu + µv 1 µ u + v u u + v 15 2u v u v u 2v u 3v λ 15 Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
63 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. Lemma Let u, v Z n be lin. independent. { Let = q 0 < q 1 } <... < q k 1 < q k = be the sorted elements of Q := u i v i : i [n], v i 0 {± }. Then the sign-pattern of λu + µv is constant over all multiplier pairs λ, µ with with λ > 0 for which λ/µ is in any fixed interval [q j 1, q j ]. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
64 2 Vectors, Step 2: Case Distinction Problem (Restricted 1-Norm Minimization in Dimension Two) Given a lattice basis u, v Z n, find λ, µ Z with λ > 0 minimizing λu + µv 1. Let s consider all sign-patterns of λu + µv in order to resolve the 1-norm! Observation: Sign of λu i + µv i depends on µ/λ compared to u i /v i. Lemma Let u, v Z n be lin. independent. { Let = q 0 < q 1 } <... < q k 1 < q k = be the sorted elements of Q := u i v i : i [n], v i 0 {± }. Then the sign-pattern of λu + µv is constant over all multiplier pairs λ, µ with with λ > 0 for which λ/µ is in any fixed interval [q j 1, q j ]. Final Step: In such an interval the 1-norm is linear and integer programming in dimension 2 can be solved efficiently (see Eisenbrand & Laue, 03). Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
65 2 Vectors: Heuristic Approach Observation Let u, v Z n be lin. independent. { Let = q 0 < q 1 } <... < q k 1 < q k = be the sorted elements of Q := u i v i : i [n], v i 0 {± }. Then the only multiplier pairs λ, µ Z for which λu + µv has zero entries not present in u nor v are those with λ/µ Q. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
66 2 Vectors: Heuristic Approach Observation Let u, v Z n be lin. independent. { Let = q 0 < q 1 } <... < q k 1 < q k = be the sorted elements of Q := u i v i : i [n], v i 0 {± }. Then the only multiplier pairs λ, µ Z for which λu + µv has zero entries not present in u nor v are those with λ/µ Q. Heuristic: 1 Let w := u. 2 For all i [n] with v i 0 do: 1 Let w (i) := v i u u i v. 2 Divide w (i) by the g.c.d. of its entries. 3 If w (i) 1 < w 1, replace w by w (i). 3 Return w. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
67 Live Demo Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
68 Questions? Problems to be tackled by help of MIP-solvers: Compute all valid equations / the dimension d. Find facets useful when optimizing certain objective functions, together with d independent points proving that it is a facet. Compute the dimension of other faces, e.g. the optimal face. Compute the conflict graph for 0/1-variables. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
69 Questions? Problems to be tackled by help of MIP-solvers: Compute all valid equations / the dimension d. Find facets useful when optimizing certain objective functions, together with d independent points proving that it is a facet. Compute the dimension of other faces, e.g. the optimal face. Compute the conflict graph for 0/1-variables. To be done: Finish basic code :-) Improve cutting plane procedure (stabilize, aging of cuts,... ). Carry out computational study. Find some nice facets for interesting polytopes. Investigate dimensions of non-facets. Matthias Walter Investigating Mixed-Integer Hulls using a MIP-Solver Aussois / 22
IPO Investigating Polyhedra by Oracles
IPO Investigating Polyhedra by Oracles Matthias Walter Otto-von-Guericke Universität Magdeburg Joint work with Volker Kaibel (OVGU) Aussois Combinatorial Optimization Workshop 2016 PORTA & Polymake Approach
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More informationarxiv: v1 [math.co] 15 Dec 2009
ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every
More informationPolytopes Course Notes
Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationDiscrete Optimization
Minisymposium 1 Discrete Optimization Leiter des Symposiums: Prof. Dr. Jens Vygen Prof. Dr. Robert Weismantel Forschungsinstitut für Fakultät für Mathematik / IMO Diskrete Mathematik Universität Bonn Otto-von-Guericke-Universität
More informationCS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm Instructor: Shaddin Dughmi Algorithms for Convex Optimization We will look at 2 algorithms in detail: Simplex and Ellipsoid.
More informationbe a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that
( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices
More informationTHEORY OF LINEAR AND INTEGER PROGRAMMING
THEORY OF LINEAR AND INTEGER PROGRAMMING ALEXANDER SCHRIJVER Centrum voor Wiskunde en Informatica, Amsterdam A Wiley-Inter science Publication JOHN WILEY & SONS^ Chichester New York Weinheim Brisbane Singapore
More informationPolyhedral Computation Today s Topic: The Double Description Algorithm. Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010
Polyhedral Computation Today s Topic: The Double Description Algorithm Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010 1 Convexity Review: Farkas-Type Alternative Theorems Gale
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationImproved Gomory Cuts for Primal Cutting Plane Algorithms
Improved Gomory Cuts for Primal Cutting Plane Algorithms S. Dey J-P. Richard Industrial Engineering Purdue University INFORMS, 2005 Outline 1 Motivation The Basic Idea Set up the Lifting Problem How to
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationFrom final point cuts to!-polyhedral cuts
AUSSOIS 2017 From final point cuts to!-polyhedral cuts Egon Balas, Aleksandr M. Kazachkov, François Margot Tepper School of Business, Carnegie Mellon University Overview Background Generalized intersection
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More information12.1 Formulation of General Perfect Matching
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,
More informationIntegral Geometry and the Polynomial Hirsch Conjecture
Integral Geometry and the Polynomial Hirsch Conjecture Jonathan Kelner, MIT Partially based on joint work with Daniel Spielman Introduction n A lot of recent work on Polynomial Hirsch Conjecture has focused
More informationLecture 4: Linear Programming
COMP36111: Advanced Algorithms I Lecture 4: Linear Programming Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline The Linear Programming Problem Geometrical analysis The Simplex
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationACO Comprehensive Exam October 12 and 13, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Given a simple directed graph G = (V, E), a cycle cover is a set of vertex-disjoint directed cycles that cover all vertices of the graph. 1. Show that there
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationTarget Cuts from Relaxed Decision Diagrams
Target Cuts from Relaxed Decision Diagrams Christian Tjandraatmadja 1, Willem-Jan van Hoeve 1 1 Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA {ctjandra,vanhoeve}@andrew.cmu.edu
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationarxiv: v1 [math.co] 27 Feb 2015
Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,
More informationOn the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes Hans Raj Tiwary hansraj@cs.uni-sb.de FR Informatik Universität des Saarlandes D-66123 Saarbrücken, Germany Tel: +49 681 3023235
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization
More informationInteger Programming ISE 418. Lecture 1. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 1 Dr. Ted Ralphs ISE 418 Lecture 1 1 Reading for This Lecture N&W Sections I.1.1-I.1.4 Wolsey Chapter 1 CCZ Chapter 2 ISE 418 Lecture 1 2 Mathematical Optimization Problems
More informationLP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008
LP-Modelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following
More informationLattice-point generating functions for free sums of polytopes
Lattice-point generating functions for free sums of polytopes Tyrrell B. McAllister 1 Joint work with Matthias Beck 2 and Pallavi Jayawant 3 1 University of Wyoming 2 San Francisco State University 3 Bates
More informationSplit-Cuts and the Stable Set Polytope of Quasi-Line Graphs
Split-Cuts and the Stable Set Polytope of Quasi-Line Graphs Friedrich Eisenbrand Joint work with G. Oriolo, P. Ventura and G. Stauffer Gomory cutting planes P = {x n Ax b} polyhedron, c T x δ, c n valid
More informationarxiv: v1 [math.co] 12 Dec 2017
arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationTowards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationShellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem
Chapter 8 Shellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem 8.1 Shellings The notion of shellability is motivated by the desire to give an inductive
More informationA Generic Separation Algorithm and Its Application to the Vehicle Routing Problem
A Generic Separation Algorithm and Its Application to the Vehicle Routing Problem Presented by: Ted Ralphs Joint work with: Leo Kopman Les Trotter Bill Pulleyblank 1 Outline of Talk Introduction Description
More information60 2 Convex sets. {x a T x b} {x ã T x b}
60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationUsing Facets of a MILP Model for solving a Job Shop Scheduling Problem
Using Facets of a MILP Model for solving a Job Shop Scheduling Problem Master s Thesis in Complex Adaptive Systems VIKTOR FORSMAN Department of Mathematical Sciences Gothenburg University Gothenburg, Sweden
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More informationConvex Hull Representation Conversion (cddlib, lrslib)
Convex Hull Representation Conversion (cddlib, lrslib) Student Seminar in Combinatorics: Mathematical Software Niklas Pfister October 31, 2014 1 Introduction In this report we try to give a short overview
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 29
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 29 CS 473: Algorithms, Spring 2018 Simplex and LP Duality Lecture 19 March 29, 2018
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationLinear Programming Duality and Algorithms
COMPSCI 330: Design and Analysis of Algorithms 4/5/2016 and 4/7/2016 Linear Programming Duality and Algorithms Lecturer: Debmalya Panigrahi Scribe: Tianqi Song 1 Overview In this lecture, we will cover
More informationSubmodularity Reading Group. Matroid Polytopes, Polymatroid. M. Pawan Kumar
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar http://www.robots.ox.ac.uk/~oval/ Outline Linear Programming Matroid Polytopes Polymatroid Polyhedron Ax b A : m x n matrix b:
More informationarxiv: v1 [math.co] 24 Aug 2009
SMOOTH FANO POLYTOPES ARISING FROM FINITE PARTIALLY ORDERED SETS arxiv:0908.3404v1 [math.co] 24 Aug 2009 TAKAYUKI HIBI AND AKIHIRO HIGASHITANI Abstract. Gorenstein Fano polytopes arising from finite partially
More informationExact adaptive parallel algorithms for data depth problems. Vera Rosta Department of Mathematics and Statistics McGill University, Montreal
Exact adaptive parallel algorithms for data depth problems Vera Rosta Department of Mathematics and Statistics McGill University, Montreal joint work with Komei Fukuda School of Computer Science McGill
More information15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs
15.082J and 6.855J Lagrangian Relaxation 2 Algorithms Application to LPs 1 The Constrained Shortest Path Problem (1,10) 2 (1,1) 4 (2,3) (1,7) 1 (10,3) (1,2) (10,1) (5,7) 3 (12,3) 5 (2,2) 6 Find the shortest
More informationLegal and impossible dependences
Transformations and Dependences 1 operations, column Fourier-Motzkin elimination us use these tools to determine (i) legality of permutation and Let generation of transformed code. (ii) Recall: Polyhedral
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge October 20, 2016 Abstract We consider the problem of minimizing
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationConvex hull computation in Normaliz
FB Mathematik/Informatik Universität Osnabrück wbruns@uos.de Cambridge, April 2017 Based on W. Bruns, B. Ichim and C. Söger The power of pyramid decomposition in Normaliz J. Symb. Comp. 74 (2016), 513
More informationOutline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014
5/2/24 Outline CS38 Introduction to Algorithms Lecture 5 May 2, 24 Linear programming simplex algorithm LP duality ellipsoid algorithm * slides from Kevin Wayne May 2, 24 CS38 Lecture 5 May 2, 24 CS38
More informationDynamic Collision Detection
Distance Computation Between Non-Convex Polyhedra June 17, 2002 Applications Dynamic Collision Detection Applications Dynamic Collision Detection Evaluating Safety Tolerances Applications Dynamic Collision
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationRELATIVELY OPTIMAL CONTROL: THE STATIC SOLUTION
RELATIVELY OPTIMAL CONTROL: THE STATIC SOLUTION Franco Blanchini,1 Felice Andrea Pellegrino Dipartimento di Matematica e Informatica Università di Udine via delle Scienze, 208 33100, Udine, Italy blanchini@uniud.it,
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationPolyhedral Computation and their Applications. Jesús A. De Loera Univ. of California, Davis
Polyhedral Computation and their Applications Jesús A. De Loera Univ. of California, Davis 1 1 Introduction It is indeniable that convex polyhedral geometry is an important tool of modern mathematics.
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationLecture 10,11: General Matching Polytope, Maximum Flow. 1 Perfect Matching and Matching Polytope on General Graphs
CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 2009) Lecture 10,11: General Matching Polytope, Maximum Flow Lecturer: Mohammad R Salavatipour Date: Oct 6 and 8, 2009 Scriber: Mohammad
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationInstitutionen för matematik, KTH.
Institutionen för matematik, KTH. Chapter 11 Construction of toric varieties 11.1 Recap example Example 11.1.1. Consider the Segre embedding seg : P 1 P 1 P 3 given by ((x 0, x 1 ), (y 0, y 1 )) (x 0
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationCS671 Parallel Programming in the Many-Core Era
1 CS671 Parallel Programming in the Many-Core Era Polyhedral Framework for Compilation: Polyhedral Model Representation, Data Dependence Analysis, Scheduling and Data Locality Optimizations December 3,
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationCutting Planes for Some Nonconvex Combinatorial Optimization Problems
Cutting Planes for Some Nonconvex Combinatorial Optimization Problems Ismael Regis de Farias Jr. Department of Industrial Engineering Texas Tech Summary Problem definition Solution strategy Multiple-choice
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationIn this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems.
2 Basics In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems. 2.1 Notation Let A R m n be a matrix with row index set M = {1,...,m}
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationAMS : Combinatorial Optimization Homework Problems - Week V
AMS 553.766: Combinatorial Optimization Homework Problems - Week V For the following problems, A R m n will be m n matrices, and b R m. An affine subspace is the set of solutions to a a system of linear
More informationA fan for every cluster algebra
A fan for every cluster algebra Nathan Reading NC State University Combinatorics and beyond: the many facets of Sergey Fomin s mathematics University of Michigan November 8-11, 2018 Cluster algebras of
More informationLecture 14: Linear Programming II
A Theorist s Toolkit (CMU 18-859T, Fall 013) Lecture 14: Linear Programming II October 3, 013 Lecturer: Ryan O Donnell Scribe: Stylianos Despotakis 1 Introduction At a big conference in Wisconsin in 1948
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationExploiting Degeneracy in MIP
Exploiting Degeneracy in MIP Tobias Achterberg 9 January 2018 Aussois Performance Impact in Gurobi 7.5+ 35% 32.0% 30% 25% 20% 15% 14.6% 10% 5.7% 7.9% 6.6% 5% 0% 2.9% 1.2% 0.1% 2.6% 2.6% Time limit: 10000
More informationApplied Integer Programming
Applied Integer Programming D.S. Chen; R.G. Batson; Y. Dang Fahimeh 8.2 8.7 April 21, 2015 Context 8.2. Convex sets 8.3. Describing a bounded polyhedron 8.4. Describing unbounded polyhedron 8.5. Faces,
More informationCombinatorial Optimization
Combinatorial Optimization Frank de Zeeuw EPFL 2012 Today Introduction Graph problems - What combinatorial things will we be optimizing? Algorithms - What kind of solution are we looking for? Linear Programming
More informationTROPICAL CONVEXITY MIKE DEVELIN AND BERND STURMFELS
TROPICAL CONVEXITY MIKE DEVELIN AND BERND STURMFELS Abstract. The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes
More informationLinear Programming and its Applications
Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear
More informationLecture 7. s.t. e = (u,v) E x u + x v 1 (2) v V x v 0 (3)
COMPSCI 632: Approximation Algorithms September 18, 2017 Lecturer: Debmalya Panigrahi Lecture 7 Scribe: Xiang Wang 1 Overview In this lecture, we will use Primal-Dual method to design approximation algorithms
More informationMOURAD BAÏOU AND FRANCISCO BARAHONA
THE p-median POLYTOPE OF RESTRICTED Y-GRAPHS MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median
More information