Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
|
|
- Hilary Nicholson
- 5 years ago
- Views:
Transcription
1 Subexponential lower bounds for randomized pivoting rules for the simplex algorithm Oliver Friedmann 1 Thomas Dueholm Hansen 2 Uri Zwick 3 1 Department of Computer Science, University of Munich, Germany. 2 Department of Management Science and Engineering, Stanford University, California, USA. (Previously at Aarhus University and Tel Aviv University.) 3 School of Computer Science, Tel Aviv University, Israel. October 21, 213 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 1/44
2 Outline Linear programming, the simplex algorithm, and shortest paths. Results and related work. Framework: Lower bounds for the simplex algorithm utilizing shortest paths and Markov decision processes. On the lower bound for RandomEdge. On the lower bound for RandomFacet. Summary of open problems. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 2/44
3 Linear programming A linear program (LP) in standard form is an optimization problem of the form: minimize c T x s.t. Ax = b x We use A R n m, b R n, and c R m : m variables and inequality constraints, n equality constraints, and dimension d = m n, assuming that the rows of A are linearly independent. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 3/44
4 Example: Single target shortest paths 2 b 1 = 1 b 2 = 1 b 3 = 1 b t = t b 4 = 1 b 5 = 1 b 6 = 1 3 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 4/44
5 Example: Single target shortest paths 2 b 1 = 1 b 2 = 1 b 3 = 1 b t = t b 4 = 1 b 5 = 1 b 6 = 1 3 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 4/44
6 Example: Single target shortest paths 2 b 1 = 1 b 2 = 1 b 3 = 1 b t = t b 4 = 1 b 5 = 1 b 6 = 1 3 minimize c (u,v) x (u,v) s.t. v V : (u,v) E x (v,w) x (u,v) = b v w:(v,w) E u:(u,v) E (u, v) E : x (u,v) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 4/44
7 Basic feasible solutions min c T x s.t. Ax = b x The set of feasible solutions is a convex polytope. Vertices (or corners) are basic feasible solutions. A basis is a subset B {1,..., m} of n linearly independent columns of A. Every basic feasible solution is defined by a basis by setting non-basic variables, x i for i B, to zero. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 5/44
8 Example: Single target shortest paths Flow conservation: minimize c (u,v) x (u,v) s.t. v t : (u,v) E x (v,w) x (u,v) = 1 w:(v,w) E u:(u,v) E (u, v) E : x (u,v) x 1 = 1 x 2 = 6 x 3 = 4 x 4 = 2 The flow through every vertex is at least 1. x 1 + x 2 = 1 + x 3 + x 4 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 6/44
9 Example: Single target shortest paths Flow conservation: minimize c (u,v) x (u,v) s.t. v t : (u,v) E x (v,w) x (u,v) = 1 w:(v,w) E u:(u,v) E (u, v) E : x (u,v) x 1 = 7 x 2 = x 3 = 4 x 4 = 2 The flow through every vertex is at least 1. x 1 + x 2 = 1 + x 3 + x 4 For a basic feasible solution, at most one edge leaving every vertex has non-zero flow. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 6/44
10 Example: Single target shortest paths Flow conservation: minimize c (u,v) x (u,v) s.t. v t : (u,v) E x (v,w) x (u,v) = 1 w:(v,w) E u:(u,v) E (u, v) E : x (u,v) x 1 = 7 x 2 = x 3 = 4 x 4 = 2 The flow through every vertex is at least 1. x 1 + x 2 = 1 + x 3 + x 4 For a basic feasible solution, at most one edge leaving every vertex has non-zero flow. There is a one-to-one correspondence between basic feasible solutions and shortest paths trees (or policies). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 6/44
11 The simplex algorithm, Dantzig (1947) min c T x s.t. Ax = b x Pivoting: Exchange a basic and a non-basic variable in a basis to move from one basic feasible solution to another. A basic feasible solution is optimal if there are no improving pivots w.r.t. its basis. The simplex algorithm: Repeatedly perform improving pivots. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 7/44
12 Reduced costs The vector of reduced costs for a basis B is: c := c A T y where y = (A 1 B )T c B is the dual basic solution corresponding to B. 1 A variable x i is an improving pivot w.r.t. B iff its reduced cost c i is negative. 1 A B R n n and c B R n are obtained by selecting the columns and rows corresponding to B from A and c, respectively. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 8/44
13 Pivoting rules Several improving pivots may be available for a given basis. The edge is chosen by a pivoting rule. I.e., a pivoting rule decides which basic and non-basic variables to exchange. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 9/44
14 Example: Single target shortest paths t Improving pivots are improving switches. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 1/44
15 Example: Single target shortest paths c (1,3) = = t val π (1) = 12 val π (2) = 11 val π (3) = 8 For every policy π (shortest paths tree), let valπ(v) be the length of the path from v to t in π: (u, v) π : valπ(u) = c (u,v) + valπ(v) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 11/44
16 Example: Single target shortest paths c (1,3) = = val π (1) = 12 val π (2) = 11 val π (3) = 8 t For every policy π (shortest paths tree), let valπ(v) be the length of the path from v to t in π: (u, v) π : valπ(u) = c (u,v) + valπ(v) The reduced cost of an edge (u, v) w.r.t. π is: c (u,v) = c (u,v) + valπ(v) valπ(u) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 11/44
17 PolicyIteration Multiple improving switches can be performed in parallel, which gives a more general class of algorithms: Function PolicyIteration(π) while improving switch w.r.t. π do Update π by performing improving switches return π Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 12/44
18 Deterministic pivoting rules LargestCoefficient, Dantzig (1947) The non-basic variable with most negative reduced cost enters the basis. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 13/44
19 Deterministic pivoting rules LargestCoefficient, Dantzig (1947) The non-basic variable with most negative reduced cost enters the basis. Bland s rule, Bland (1977) Pick the available variable with the smallest index, both for entering and leaving the basis. This pivoting rule is guaranteed not to cycle. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 13/44
20 Deterministic pivoting rules LargestCoefficient, Dantzig (1947) The non-basic variable with most negative reduced cost enters the basis. Bland s rule, Bland (1977) Pick the available variable with the smallest index, both for entering and leaving the basis. This pivoting rule is guaranteed not to cycle. Others: LargestIncrease SteepestEdge ShadowVertex LeastEntered... Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 13/44
21 Exponential lower bounds Klee and Minty (1972): The LargestCoefficient pivoting rule may require exponentially many steps; the Klee-Minty cube. 2 2 Picture from Gärtner, Henk and Ziegler (1998) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 14/44
22 Exponential lower bounds Klee and Minty (1972): The LargestCoefficient pivoting rule may require exponentially many steps; the Klee-Minty cube. 2 Essentially all known natural deterministic pivoting rules are now known to be exponential: LargestIncrease: Jeroslow (1973). SteepestEdge: Goldfarb and Sit (1979). Bland s rule: Avis and Chvátal (1978). ShadowVertex: Murty (198), Goldfarb (1983). See Amenta and Ziegler (1996) for a unified view. 2 Picture from Gärtner, Henk and Ziegler (1998) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 14/44
23 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
24 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. RandomFacet, Kalai (1992) and Matoušek, Sharir and Welzl (1992) Pick a uniformly random facet that contains the current vertex, and recursively find an optimal solution within that facet. If possible, make an improving pivot leaving the facet and repeat. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
25 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. RandomFacet, Kalai (1992) and Matoušek, Sharir and Welzl (1992) Pick a uniformly random facet that contains the current vertex, and recursively find an optimal solution within that facet. If possible, make an improving pivot leaving the facet and repeat. Expected subexponential time: 2 O( n log d) expected steps. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
26 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. RandomFacet, Kalai (1992) and Matoušek, Sharir and Welzl (1992) Pick a uniformly random facet that contains the current vertex, and recursively find an optimal solution within that facet. If possible, make an improving pivot leaving the facet and repeat. Expected subexponential time: 2 O( n log d) expected steps. Randomized Bland s rule Randomly permute the variables and use Bland s rule. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
27 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. RandomFacet, Kalai (1992) and Matoušek, Sharir and Welzl (1992) Pick a uniformly random facet that contains the current vertex, and recursively find an optimal solution within that facet. If possible, make an improving pivot leaving the facet and repeat. Expected subexponential time: 2 O( n log d) expected steps. Randomized Bland s rule Randomly permute the variables and use Bland s rule. No subexponential upper bounds are known for RandomEdge and Randomized Bland s rule. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
28 Randomized pivoting rules RandomEdge Perform uniformly random improving pivots. RandomFacet, Kalai (1992) and Matoušek, Sharir and Welzl (1992) Pick a uniformly random facet that contains the current vertex, and recursively find an optimal solution within that facet. If possible, make an improving pivot leaving the facet and repeat. Expected subexponential time: 2 O( n log d) expected steps. Randomized Bland s rule Randomly permute the variables and use Bland s rule. No subexponential upper bounds are known for RandomEdge and Randomized Bland s rule. Prior to our work no superpolynomial lower bounds were known for important randomized pivoting rules. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 15/44
29 Results We prove lower bounds for the expected number of pivoting steps: RandomEdge: 2 Ω(n1/4 ) RandomFacet: 2 Ω(n 1/3 ) Randomized Bland s rule: 2 Ω(n 1/2 ) where n is the number of equality constraints, and the number of variables is m = Õ(n). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 16/44
30 Results We prove lower bounds for the expected number of pivoting steps: RandomEdge: 2 Ω(n1/4 ) RandomFacet: 2 Ω(n 1/3 ) Randomized Bland s rule: 2 Ω(n 1/2 ) where n is the number of equality constraints, and the number of variables is m = Õ(n). Note: In our SODA 211 paper we studied a modified RandomFacet pivoting rule and incorrectly claimed that the expected running time was the same. We have repaired the analysis, but with a worse bound. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 16/44
31 Results We prove lower bounds for the expected number of pivoting steps: RandomEdge: 2 Ω(n1/4 ) RandomFacet: 2 Ω(n 1/3 ) Randomized Bland s rule: 2 Ω(n 1/2 ) where n is the number of equality constraints, and the number of variables is m = Õ(n). Note: In our SODA 211 paper we studied a modified RandomFacet pivoting rule and incorrectly claimed that the expected running time was the same. We have repaired the analysis, but with a worse bound. Initially, we used Markov decision processes for the constructions. We now use shortest paths for RandomFacet and Randomized Bland s rule. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 16/44
32 Techniques Previous lower bounds were proved by studying linear programs directly. The new lower bounds are based on strong connections between linear programming and shortest paths and Markov decision processes (MDPs). MDPs can be viewed as stochastic shortest paths: edges can result in stochastic transitions. We prove lower bounds for corresponding PolicyIteration algorithms for MDPs, which immediately translate to lower bounds for the simplex algorithm. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 17/44
33 Related work Friedmann (29) and Fearnley (21) gave a similar lower bound construction for Howard s PolicyIteration algorithm for solving MDPs (and parity games). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 18/44
34 Related work Friedmann (29) and Fearnley (21) gave a similar lower bound construction for Howard s PolicyIteration algorithm for solving MDPs (and parity games). Friedmann (211) used the same technique to prove a lower bound of subexponential form, 2 Ω( n), for Zadeh s LeastEntered pivoting rule (198). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 18/44
35 Related work Friedmann (29) and Fearnley (21) gave a similar lower bound construction for Howard s PolicyIteration algorithm for solving MDPs (and parity games). Friedmann (211) used the same technique to prove a lower bound of subexponential form, 2 Ω( n), for Zadeh s LeastEntered pivoting rule (198). Superpolynomial lower bounds for RandomEdge and RandomFacet were previously only known in an abstract setting (Acyclic Unique Sink Orientations): Matoušek (1994): 2 Ω( n) lower bound for RandomFacet. Matoušek and Szabó (26): 2 Ω(n1/3) lower bound for RandomEdge. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 18/44
36 (Un)related work Orlin (1985): Dantzig s LargestCoefficient pivoting rule requires at most O(n 2 m log n) iterations for shortest paths. Hansen, Kaplan, and Zwick (SODA, 214): Dantzig s LargestCoefficient pivoting rule requires between O(nm log n) and Ω(n 2 ) iterations for shortest paths. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 19/44
37 (Un)related work Orlin (1985): Dantzig s LargestCoefficient pivoting rule requires at most O(n 2 m log n) iterations for shortest paths. Hansen, Kaplan, and Zwick (SODA, 214): Dantzig s LargestCoefficient pivoting rule requires between O(nm log n) and Ω(n 2 ) iterations for shortest paths. Gärtner and Kaibel (27): RandomEdge requires at most O(2 n /n log n ) iterations for n-dimensional acyclic unique sink orientations (AUSOs). Hansen, Paterson, and Zwick (SODA, 214): RandomEdge requires at most O(1.8 n ) iterations for n-dimensional AUSOs. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 19/44
38 On the diameter of polytopes The diameter of a polytope P is the maximum distance between any two vertices in the edge graph of P. The diameter gives a lower bound for any pivoting rule for the simplex algorithm. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 2/44
39 On the diameter of polytopes The diameter of a polytope P is the maximum distance between any two vertices in the edge graph of P. The diameter gives a lower bound for any pivoting rule for the simplex algorithm. Hirsch conjecture (1957): The diameter of any m-facet convex polytope in d-dimensional Euclidean space is at most m d. Kalai and Kleitman (1992): O(m log m ) upper bound on the diameter. Counter-example by Santos (21): Existence of polytopes with diameter (1 + ɛ)(m d). It remains open whether the diameter is polynomial, or even linear, in m and d. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 2/44
40 On the diameter of polytopes The diameter of a polytope P is the maximum distance between any two vertices in the edge graph of P. The diameter gives a lower bound for any pivoting rule for the simplex algorithm. Hirsch conjecture (1957): The diameter of any m-facet convex polytope in d-dimensional Euclidean space is at most m d. Kalai and Kleitman (1992): O(m log m ) upper bound on the diameter. Counter-example by Santos (21): Existence of polytopes with diameter (1 + ɛ)(m d). It remains open whether the diameter is polynomial, or even linear, in m and d. Our results are unrelated to the diameter: The constructed polytopes have low diameter. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 2/44
41 Outline Linear programming, the simplex algorithm, and shortest paths. Results and related work. Framework: Lower bounds for the simplex algorithm utilizing shortest paths and Markov decision processes. On the lower bound for RandomEdge. On the lower bound for RandomFacet. Summary of open problems. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 21/44
42 Lower bound constructions: The first idea To prove a lower bound for a given pivoting rule, we construct a family of graphs (or MDPs) G n such that the corresponding PolicyIteration algorithm simulates an n-bit binary counter. We define a way to interpret a policy π as a configuration of the binary counter: b i bit i (π) = b i bit i (π) = 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 22/44
43 Lower bound constructions: The first idea To prove a lower bound for a given pivoting rule, we construct a family of graphs (or MDPs) G n such that the corresponding PolicyIteration algorithm simulates an n-bit binary counter. We define a way to interpret a policy π as a configuration of the binary counter: b i bit i (π) = b i bit i (π) = 1 We then show that (with high probability) a run of the PolicyIteration algorithm generates all 2 n counting configurations. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 22/44
44 A simplified construction w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i The graph is acyclic, and every bit i is associated with a level consisting of four vertices: b i, a i, w i, u i. w n+1 = u n+1 = t. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 23/44
45 A simplified construction, n = 3 w4 t u b w3 a3 u b w2 a2 u b w1 a1 u1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 24/44
46 Case: val π (w i+1 ) = val π (u i+1 ) val π (w i+1 ) = val π (u i+1 ) w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) bit i (π) =, stable. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 25/44
47 Case: val π (w i+1 ) = val π (u i+1 ) val π (w i+1 ) = val π (u i+1 ) w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) bit i (π) = 1, transitioning. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 25/44
48 Case: val π (w i+1 ) = val π (u i+1 ) val π (w i+1 ) = val π (u i+1 ) w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) + 2 2i bit i (π) = 1, transitioning, lower bits are unstable: reset. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 25/44
49 Case: val π (w i+1 ) = val π (u i+1 ) val π (w i+1 ) = val π (u i+1 ) w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) + 2 2i bit i (π) = 1, transitioning, lower bits are unstable: reset. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 25/44
50 Case: val π (w i+1 ) = val π (u i+1 ) val π (w i+1 ) = val π (u i+1 ) w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) bit i (π) = 1, stable. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 25/44
51 Case: val π (w i+1 ) val π (u i+1 ) + 2 2i+2 val π (w i+1 ) val π (u i+1 ) + 2 2i+2 w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) bit i (π) = 1, unstable, resetting. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 26/44
52 Case: val π (w i+1 ) val π (u i+1 ) + 2 2i+2 val π (w i+1 ) val π (u i+1 ) + 2 2i+2 w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i val π (w i ) = val π (u i ) + 2 2i bit i (π) =, stable, lower bits are unstable: reset. w i is updated when bit i + 1 stabilizes. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 26/44
53 Lower bound for Bland s rule Bland s rule for shortest paths: Perform the first improving switch according to a permutation of the edges. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 27/44
54 Lower bound for Bland s rule Bland s rule for shortest paths: Perform the first improving switch according to a permutation of the edges. It is easy to define a permutation of the edges, σ, such that we get the described behavior, giving an exponential lower bound: (b i, w i+1 ) edges are placed last, and σ(b i, w i+1 ) < σ(b j, w j+1 ) for i < j. (a i, b i ) edges are placed next, and σ(a i, b i ) < σ(a j, b j ) for i < j. The remaining edges are placed first in arbitrary order. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 27/44
55 Lower bound for Bland s rule Bland s rule for shortest paths: Perform the first improving switch according to a permutation of the edges. It is easy to define a permutation of the edges, σ, such that we get the described behavior, giving an exponential lower bound: (b i, w i+1 ) edges are placed last, and σ(b i, w i+1 ) < σ(b j, w j+1 ) for i < j. (a i, b i ) edges are placed next, and σ(a i, b i ) < σ(a j, b j ) for i < j. The remaining edges are placed first in arbitrary order. To implement a lower bound for RandomEdge we need a gadget to delay improving switches like (b i, w i+1 ) and (a i, b i ). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 27/44
56 Outline Linear programming, the simplex algorithm, and shortest paths. Results and related work. Framework: Lower bounds for the simplex algorithm utilizing shortest paths and Markov decision processes. On the lower bound for RandomEdge. On the lower bound for RandomFacet. Summary of open problems. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 28/44
57 Delaying events b i,3 c + 2ɛ 3 b i c b i,2 c + ɛ b i,1 c By replacing a vertex by a chain of vertices, a specific sequence of improving switches has to be performed to get the same effect as performing one improving switch originally. At any time there is only one edge for which it is improving to move into the chain. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 29/44
58 Delaying events b i,3 c + 2ɛ 3 b i c b i,2 c + ɛ b i,1 c By replacing a vertex by a chain of vertices, a specific sequence of improving switches has to be performed to get the same effect as performing one improving switch originally. At any time there is only one edge for which it is improving to move into the chain. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 29/44
59 Delaying events b i,3 c + 2ɛ 3 b i c b i,2 c + ɛ b i,1 c By replacing a vertex by a chain of vertices, a specific sequence of improving switches has to be performed to get the same effect as performing one improving switch originally. At any time there is only one edge for which it is improving to move into the chain. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 29/44
60 Delaying events b i,3 c + 2ɛ 3 b i c b i,2 c + ɛ b i,1 c By replacing a vertex by a chain of vertices, a specific sequence of improving switches has to be performed to get the same effect as performing one improving switch originally. At any time there is only one edge for which it is improving to move into the chain. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 29/44
61 Competing chains Suppose a short chain of length l i is competing with a longer chain of length l i+1. There is exactly one improving switch in both chains, and RandomEdge performs either one of them with equal probability. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 3/44
62 Competing chains Suppose a short chain of length l i is competing with a longer chain of length l i+1. There is exactly one improving switch in both chains, and RandomEdge performs either one of them with equal probability. Let X be the number of heads observed in l i + l i+1 coin tosses, then by a Chernoff bound: (l i+1 l i ) 2 2(l Pr[X l i ] e i+1 +l i ) Setting l k = Θ(k 2 n) the probability of failure, X < l i, is at most e n. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 3/44
63 Competing chains Suppose a short chain of length l i is competing with a longer chain of length l i+1. There is exactly one improving switch in both chains, and RandomEdge performs either one of them with equal probability. Let X be the number of heads observed in l i + l i+1 coin tosses, then by a Chernoff bound: (l i+1 l i ) 2 2(l Pr[X l i ] e i+1 +l i ) Setting l k = Θ(k 2 n) the probability of failure, X < l i, is at most e n. With n such chains this results in N = O(n 4 ) vertices, giving a lower bound of 2 Ω(N1/4) expected pivoting steps for RandomEdge. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 3/44
64 Fast resetting b i,3 c + 2ɛ 3 b i c b i,2 c + ɛ b i,1 c Moving in the other directions happens much faster since all edges are improving switches simultaneously. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 31/44
65 Problem We need to reset the progress made in chains at higher bits in order for the analysis to work. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 32/44
66 Problem We need to reset the progress made in chains at higher bits in order for the analysis to work. The graph should not be acyclic: higher bits must have access to lower bits. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 32/44
67 Problem We need to reset the progress made in chains at higher bits in order for the analysis to work. The graph should not be acyclic: higher bits must have access to lower bits. No vertex in a chain should get the benefit of setting a bit before this event occurs. RandomEdge solves shortest paths in O(NM) expected iterations, where N is the number of vertices and M is the number of edges. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 32/44
68 Problem We need to reset the progress made in chains at higher bits in order for the analysis to work. The graph should not be acyclic: higher bits must have access to lower bits. No vertex in a chain should get the benefit of setting a bit before this event occurs. RandomEdge solves shortest paths in O(NM) expected iterations, where N is the number of vertices and M is the number of edges. Use the power of MDPs: Introduce stochastic transitions. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 32/44
69 Problem We need to reset the progress made in chains at higher bits in order for the analysis to work. The graph should not be acyclic: higher bits must have access to lower bits. No vertex in a chain should get the benefit of setting a bit before this event occurs. RandomEdge solves shortest paths in O(NM) expected iterations, where N is the number of vertices and M is the number of edges. Use the power of MDPs: Introduce stochastic transitions. To reset b i -chains we need additional c i -chains to get alternating behavior. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 32/44
70 Construction for RandomEdge w i+1 u i+1 2 2i i b i 2 2i+1 2 2i w i a i u i Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 33/44
71 Construction for RandomEdge w i+1 u i+1 2 2i i b i 2 2i+1 2 2i l i w i a i u i g Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 33/44
72 Construction for RandomEdge w i+1 u i+1 2 2i l i b i 2 2i w i a i 2 2i u i g 2 2i+1 u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 33/44
73 Construction for RandomEdge w i+1 u i+1 ɛ 2 2i 1 ɛ 2 2i b i l i w i a i 2 2i u i g 2 2i+1 u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 33/44
74 Construction for RandomEdge w i+1 u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 33/44
75 Setting a bit w i+1 bit i (π) = u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
76 Setting a bit w i+1 bit i (π) = u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
77 Setting a bit w i+1 bit i (π) = 1 u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
78 Setting a bit w i+1 bit i (π) = 1 u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) + 2 2i u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
79 Setting a bit w i+1 bit i (π) = 1 u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) + 2 2i u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
80 Setting a bit w i+1 bit i (π) = 1 u i+1 ɛ 2 2i 1 ɛ h c i 2 2i b i 2 2i l i w i a i 2 2i u i g 2 2i+1 w 1 val π (w 1 ) = val π (u 1 ) u 1 Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 34/44
81 RandomEdge lower bound Theorem (Friedmann, Hansen and Zwick (211)) The worst-case expected number of pivoting steps performed by RandomEdge on linear programs with n equalities and 2n non-negative variables is 2 Ω(n1/4). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 35/44
82 Outline Linear programming, the simplex algorithm, and shortest paths. Results and related work. Framework: Lower bounds for the simplex algorithm utilizing shortest paths and Markov decision processes. On the lower bound for RandomEdge. On the lower bound for RandomFacet. Summary of open problems. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 36/44
83 The RandomFacet pivoting rule RandomFacet, Kalai (1992): 1 Pick a uniformly random facet f that contains the current basic feasible solution x. 2 Recursively find the optimal solution x within the picked facet f. 3 If possible, make an improving pivot from x, leaving the facet f, and repeat from (1). Otherwise return x. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 37/44
84 The RandomFacet pivoting rule RandomFacet, Kalai (1992): 1 Pick a uniformly random facet f that contains the current basic feasible solution x. 2 Recursively find the optimal solution x within the picked facet f. 3 If possible, make an improving pivot from x, leaving the facet f, and repeat from (1). Otherwise return x. A dual variant of the RandomFacet pivoting rule was discovered independently by Matoušek, Sharir and Welzl (1992). Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 37/44
85 The RandomFacet pivoting rule P f 3 f 2 x f 1 Pick a uniformly random facet f i that contains the current basic feasible solution x. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 38/44
86 The RandomFacet pivoting rule P f 3 f 2 x f 1 Pick a uniformly random facet f i that contains the current basic feasible solution x. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 38/44
87 The RandomFacet pivoting rule P f 3 x f 2 x f 1 Recursively find the optimal solution x within the picked facet f i. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 38/44
88 The RandomFacet pivoting rule P f 3 x x f 2 x f 1 If possible, make an improving pivot from x, leaving the facet f i, and repeat from the beginning. Otherwise return x. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 38/44
89 The RandomFacet pivoting rule P f 3 x x f 2 x f 1 Note that if the facets f 1,..., f d containing x are ordered according to their optimal value, then from x we never visit f 1,..., f i again. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 38/44
90 The RandomFacet pivoting rule The number of pivoting steps for a linear program with dimension d and m inequalities is at most: f (d, m) f (d 1, m 1) d d f (d, m i) i=1 with f (d, m) = for m d. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 39/44
91 The RandomFacet pivoting rule The number of pivoting steps for a linear program with dimension d and m inequalities is at most: f (d, m) f (d 1, m 1) d d f (d, m i) i=1 with f (d, m) = for m d. Solving the corresponding recurrence gives: f (d, m) 2 O( (m d) log d) Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 39/44
92 Interpretation for shortest paths minimize s.t. v t : (u,v) E w:(v,w) E c (u,v) x (u,v) x (v,w) u:(u,v) E x (u,v) = 1 (u, v) E : x (u,v) Staying within a facet means that the corresponding inequality is tight, meaning that a variable is fixed to zero. This corresponds to removing the edge. The RandomFacet pivoting rule removes random unused edges and solves the corresponding problem recursively. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 4/44
93 Interpretation for shortest paths minimize s.t. v t : (u,v) E w:(v,w) E c (u,v) x (u,v) x (v,w) u:(u,v) E x (u,v) = 1 (u, v) E : x (u,v) Staying within a facet means that the corresponding inequality is tight, meaning that a variable is fixed to zero. This corresponds to removing the edge. The RandomFacet pivoting rule removes random unused edges and solves the corresponding problem recursively. Note that delaying a switch, as for Bland s rule, can also be viewed as removing the edge. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 4/44
94 Different challenges When constructing lower bounds for RandomFacet, the challenge is to make sure that certain edges are not removed before certain other edges. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 41/44
95 Different challenges When constructing lower bounds for RandomFacet, the challenge is to make sure that certain edges are not removed before certain other edges. Suppose an edge e must not be removed before another edge e. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 41/44
96 Different challenges When constructing lower bounds for RandomFacet, the challenge is to make sure that certain edges are not removed before certain other edges. Suppose an edge e must not be removed before another edge e. To achieve this with high probability we make use of redundancy: Let e and e be copied k times, in such a way that we only require that at least one copy of e is removed before all copies of e are removed. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 41/44
97 Different challenges When constructing lower bounds for RandomFacet, the challenge is to make sure that certain edges are not removed before certain other edges. Suppose an edge e must not be removed before another edge e. To achieve this with high probability we make use of redundancy: Let e and e be copied k times, in such a way that we only require that at least one copy of e is removed before all copies of e are removed. The probability of failure, i.e. removing all k copies of e before one copy of e, is then: k i=1 i i + k = (k!)2 (2k)! 1 2 k Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 41/44
98 Lower bound construction wi+1 ui+1 2 2i (rs 1)ɛ bi,rs rs. bi,2 2 2i ɛ 2 2i bi,1 2 2i 2 2i+1 + (s 1)ɛ ai,1,s ai,2,s ai,r,s s. ai,1,2. ai,2,2. ai,r,2 2 2i+1 + ɛ ai,1,1 ai,2,1 ai,r,1 2 2i+1 2 2i wi } {{ } r ui Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 42/44
99 Open problems Subexponential upper bounds for RandomEdge and Randomized Bland s rule? Close the gap between the 2 Ω(n 1/3) and 2 O( n log d) bounds for RandomFacet for linear programs. Close the gap between the Ω(n 2 ) and O(nm log n) bounds for Dantzig s LargestCoefficient pivoting rule for shortest paths. Close the gap between the (1 + ɛ)(m d) lower bound and O(m log m ) upper bound for the diameter of convex polytopes. Strongly polynomial time algorithm for linear programming? A variant of the simplex algorithm? This question remains open already for Markov decision processes. Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 43/44
100 The end Thank you for listening! Friedmann, Hansen, Zwick Lower bounds for the simplex algorithm Page 44/44
Subexponential Lower Bounds for the Simplex Algorithm
Subexponential Lower Bounds for the Simplex Algorithm Oliver Friedmann Department of Computer Science, Ludwig-Maximilians-Universität Munich, Germany. January 0, 011 Oliver Friedmann (LMU) Subexponential
More informationThe simplex method and the diameter of a 0-1 polytope
The simplex method and the diameter of a 0-1 polytope Tomonari Kitahara and Shinji Mizuno May 2012 Abstract We will derive two main results related to the primal simplex method for an LP on a 0-1 polytope.
More informationA Subexponential Randomized Simplex Algorithm
s A Subexponential Randomized Gil Kalai (extended abstract) Shimrit Shtern Presentation for Polynomial time algorithms for linear programming 097328 Technion - Israel Institute of Technology May 14, 2012
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 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 informationLinear Programming Algorithms [Read Chapters G and H first.] Status: Half-finished.
Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.]
More informationAlgorithmic Game Theory and Applications. Lecture 6: The Simplex Algorithm
Algorithmic Game Theory and Applications Lecture 6: The Simplex Algorithm Kousha Etessami Recall our example 1 x + y
More informationNotes taken by Mea Wang. February 11, 2005
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 5: Smoothed Analysis, Randomized Combinatorial Algorithms, and Linear Programming Duality Notes taken by Mea Wang February 11, 2005 Summary:
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: v2 [cs.dm] 30 Aug 2016
The Niceness of Unique Sink Orientations Bernd Gärtner 1 and Antonis Thomas 1 1 Department of Computer Science, Institute of Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland arxiv:1606.07709v2
More informationOn real and on bad Linear Programs Günter M. Ziegler.
On real and on bad Linear Programs Günter M. Ziegler ziegler@math.fu-berlin.de On real and on bad LPs... but when they had taken their seats Her Majesty turned to the president and resumed.... was he nevertheless
More informationPolytopes, their diameter, and randomized simplex
Polytopes, their diameter, and randomized simplex Presentation by: Dan Stratila Operations Research Center Session 4: October 6, 2003 Based primarily on: Gil Kalai. A subexponential randomized simplex
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 informationOpen problems in convex optimisation
Open problems in convex optimisation 26 30 June 2017 AMSI Optimise Vera Roshchina RMIT University and Federation University Australia Perceptron algorithm and its complexity Find an x R n such that a T
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationRANDOM EDGE can be exponential on abstract cubes
RANDOM EDGE can be exponential on abstract cubes Jiří Matoušek Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI) Charles University Malostranské nám. 25, 118 00 Praha
More informationBernd Gärtner Institut für Informatik Freie Universität Berlin. Günter M. Ziegler Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Randomized simplex algorithms on Klee-Minty cubes Bernd Gärtner Institut für Informatik Freie Universität Berlin Abstract We investigate the behavior of randomized simplex algorithms on special linear
More informationOpen problems in convex geometry
Open problems in convex geometry 10 March 2017, Monash University Seminar talk Vera Roshchina, RMIT University Based on joint work with Tian Sang (RMIT University), Levent Tunçel (University of Waterloo)
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 informationAn iteration of the simplex method (a pivot )
Recap, and outline of Lecture 13 Previously Developed and justified all the steps in a typical iteration ( pivot ) of the Simplex Method (see next page). Today Simplex Method Initialization Start with
More informationLecture 16 October 23, 2014
CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 16 October 23, 2014 Scribe: Colin Lu 1 Overview In the last lecture we explored the simplex algorithm for solving linear programs. While
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 informationWhat is the Worst Case Behavior of the Simplex Algorithm?
Centre de Recherches Mathématiques CRM Proceedings and Lecture Notes Volume, 28 What is the Worst Case Behavior of the Simplex Algorithm? Norman Zadeh Abstract. The examples published by Klee and Minty
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 informationThe Simplex Algorithm for LP, and an Open Problem
The Simplex Algorithm for LP, and an Open Problem Linear Programming: General Formulation Inputs: real-valued m x n matrix A, and vectors c in R n and b in R m Output: n-dimensional vector x There is one
More informationLecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject
More informationMATH 310 : Degeneracy and Geometry in the Simplex Method
MATH 310 : Degeneracy and Geometry in the Simplex Method Fayadhoi Ibrahima December 11, 2013 1 Introduction This project is exploring a bit deeper the study of the simplex method introduced in 1947 by
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 informationLinear Programming and Clustering
and Advisor: Dr. Leonard Schulman, Caltech Aditya Huddedar IIT Kanpur Advisor: Dr. Leonard Schulman, Caltech Aditya Huddedar IIT Kanpur and Outline of Talk 1 Introduction 2 Motivation 3 Our Approach 4
More informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 Ellipsoid Methods Barnabás Póczos & Ryan Tibshirani Outline Linear programs Simplex algorithm Running time: Polynomial or Exponential? Cutting planes & Ellipsoid methods for
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I Instructor: Shaddin Dughmi Announcements Posted solutions to HW1 Today: Combinatorial problems
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 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 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 informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More informationJ Linear Programming Algorithms
Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.]
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 informationImproved Strong Worst-case Upper Bounds for MDP Planning
In Proc. IJCAI 2017, pp. 1788--1794, IJCAI, 2017. Improved Strong Worst-case Upper Bounds for MDP Planning Anchit Gupta and Shivaram Kalyanakrishnan Department of Computer Science and Engineering, Indian
More informationStrategy Improvement for Parity Games. A combinatorial perspective
: A combinatorial perspective InfoSys seminar Oxford University Computing Laboratory 28 October 2008 Overview Theorem The strategy improvement algorithm for parity games is a bottom-antipodal sink-finding
More informationNATCOR Convex Optimization Linear Programming 1
NATCOR Convex Optimization Linear Programming 1 Julian Hall School of Mathematics University of Edinburgh jajhall@ed.ac.uk 5 June 2018 What is linear programming (LP)? The most important model used in
More informationCMPSCI611: The Simplex Algorithm Lecture 24
CMPSCI611: The Simplex Algorithm Lecture 24 Let s first review the general situation for linear programming problems. Our problem in standard form is to choose a vector x R n, such that x 0 and Ax = b,
More information6.854 Advanced Algorithms. Scribes: Jay Kumar Sundararajan. Duality
6.854 Advanced Algorithms Scribes: Jay Kumar Sundararajan Lecturer: David Karger Duality This lecture covers weak and strong duality, and also explains the rules for finding the dual of a linear program,
More informationSolution for Homework set 3
TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities
More informationLinear Programming Motivation: The Diet Problem
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Network Flows & Applications NP-completeness Now Linear Programming and the Simplex Method Hung Q. Ngo (SUNY at Buffalo) CSE 531 1
More informationA deterministic subexponential algorithm for solving parity games
A deterministic subexponential algorithm for solving parity games Marcin Jurdziński Mike Paterson Uri Zwick Abstract The existence of polynomial time algorithms for the solution of parity games is a major
More informationAbstract objective function graphs on the 3-cube a classification by realizability
Research ollection Report bstract objective function graphs on the 3-cube a classification by realizability uthor(s): ärtner, ernd; Kaibel, Volker Publication ate: 1998 Permanent Link: https://doi.org/10.3929/ethz-a-006652780
More informationarxiv: v1 [cs.cc] 30 Jun 2017
On the Complexity of Polytopes in LI( Komei Fuuda May Szedlá July, 018 arxiv:170610114v1 [cscc] 30 Jun 017 Abstract In this paper we consider polytopes given by systems of n inequalities in d variables,
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
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 information11.1 Facility Location
CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationChapter 1 Linear Programming. Paragraph 4 The Simplex Algorithm
Chapter Linear Programming Paragraph 4 The Simplex Algorithm What we did so far By combining ideas of a specialized algorithm with a geometrical view on the problem, we developed an algorithm idea: Find
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 informationCircuit Walks in Integral Polyhedra
Circuit Walks in Integral Polyhedra Charles Viss Steffen Borgwardt University of Colorado Denver Optimization and Discrete Geometry: Theory and Practice Tel Aviv University, April 2018 LINEAR PROGRAMMING
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationINDIAN STATISTICAL INSTITUTE
INDIAN STATISTICAL INSTITUTE Mid Semestral Examination M. Tech (CS) - II Year, 202-203 (Semester - IV) Topics in Algorithms and Complexity Date : 28.02.203 Maximum Marks : 60 Duration : 2.5 Hours Note:
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 information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationCMPSCI 311: Introduction to Algorithms Practice Final Exam
CMPSCI 311: Introduction to Algorithms Practice Final Exam Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more detail including
More informationLECTURE 6: INTERIOR POINT METHOD. 1. Motivation 2. Basic concepts 3. Primal affine scaling algorithm 4. Dual affine scaling algorithm
LECTURE 6: INTERIOR POINT METHOD 1. Motivation 2. Basic concepts 3. Primal affine scaling algorithm 4. Dual affine scaling algorithm Motivation Simplex method works well in general, but suffers from exponential-time
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 informationSome Useful Links and Software Sites on Optimization
Appendix A Some Useful Links and Software Sites on Optimization A.1 General Optimization/Operations Research Sites 1. Optimization FAQ (LP and NLP FAQ) [14] contains a lot of information and html links
More informationCSC 8301 Design & Analysis of Algorithms: Linear Programming
CSC 8301 Design & Analysis of Algorithms: Linear Programming Professor Henry Carter Fall 2016 Iterative Improvement Start with a feasible solution Improve some part of the solution Repeat until the solution
More informationLinear Programming. Linear Programming. Linear Programming. Example: Profit Maximization (1/4) Iris Hui-Ru Jiang Fall Linear programming
Linear Programming 3 describes a broad class of optimization tasks in which both the optimization criterion and the constraints are linear functions. Linear Programming consists of three parts: A set of
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 informationWhat is linear programming (LP)? NATCOR Convex Optimization Linear Programming 1. Solving LP problems: The standard simplex method
NATCOR Convex Optimization Linear Programming 1 Julian Hall School of Mathematics University of Edinburgh jajhall@ed.ac.uk 14 June 2016 What is linear programming (LP)? The most important model used in
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 2010 Lecture 5 Min-Cost Flows & Total Unimodularity
Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/cot6936_s12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id=174
More informationLecture 3: Totally Unimodularity and Network Flows
Lecture 3: Totally Unimodularity and Network Flows (3 units) Outline Properties of Easy Problems Totally Unimodular Matrix Minimum Cost Network Flows Dijkstra Algorithm for Shortest Path Problem Ford-Fulkerson
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationLinear programming and the efficiency of the simplex algorithm for transportation polytopes
Linear programming and the efficiency of the simplex algorithm for transportation polytopes Edward D. Kim University of Wisconsin-La Crosse February 20, 2015 Loras College Department of Mathematics Colloquium
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 informationIntroduction to Algorithms I
Summer School on Algorithms and Optimization Organized by: ACM Unit, ISI and IEEE CEDA. Tutorial II Date: 05.07.017 Introduction to Algorithms I (Q1) A binary tree is a rooted tree in which each node has
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 information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationThe Touring Polygons Problem (TPP)
The Touring Polygons Problem (TPP) [Dror-Efrat-Lubiw-M]: Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a shortest path that starts at s, visits in order each
More informationCHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science
CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 5 May 23 This question paper has 4 printed sides. Part A has questions of 3 marks each. Part B has 7 questions
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationHollow Heaps. Aarhus University, Denmark. Tel Aviv University, Israel. Princeton University, USA. July 7, 2015
Hollow Heaps Thomas Dueholm Hansen 1 Haim Kaplan 2 Robert E. Tarjan 3 Uri Zwick 2 1 Department of Computer Science, Aarhus University, Denmark. 2 School of Computer Science, Tel Aviv University, Israel.
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationAlgorithmic and geometric aspects of combinatorial and continuous optimization
Algorithmic and geometric aspects of combinatorial and continuous optimization Antoine Deza, McMaster based on joint works with David Bremner, New Brunswick George Manoussakis, Orsay Shinji Mizuno, Tokyo
More informationOn the diameter of the Transportation Polytope
On the diameter of the Transportation Polytope JAN VAN DEN HEUVEL joint work with GRAHAM BRIGHTWELL (LSE) and LEEN STOUGIE (CWI Amsterdam, TU Eindhoven) Centre for Discrete and Applicable Mathematics Department
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 informationCopyright 2000, Kevin Wayne 1
Guessing Game: NP-Complete? 1. LONGEST-PATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES. SHORTEST-PATH: Given a graph G = (V, E), does there exists a simple
More informationOptimization. Lecture08 12/06/11
Optimization Lecture08 12/06/11 The RevisedSimplex Algorithm Assume againthatwearegivenan LP in canonicalform, whichwepad with slackvariables. Letusplacethe corresponding columns on the left of the initial
More informationIntroduction to Randomized Algorithms
Introduction to Randomized Algorithms Gopinath Mishra Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 700108, India. Organization 1 Introduction 2 Some basic ideas from
More informationLinear Programming. Readings: Read text section 11.6, and sections 1 and 2 of Tom Ferguson s notes (see course homepage).
Linear Programming Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory: Feasible Set, Vertices, Existence of Solutions. Equivalent formulations. Outline
More informationCS483 Analysis of Algorithms Lecture 09 Linear Programming 01
CS483 Analysis of Algorithms Lecture 09 Linear Programming 01 Jyh-Ming Lien April 09, 2009 this lecture note is based on Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani and to the Design
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
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 informationTopic: Local Search: Max-Cut, Facility Location Date: 2/13/2007
CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be
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 information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17 5.1 Introduction You should all know a few ways of sorting in O(n log n)
More informationThe Arrangement Method for Linear Programming
The Arrangement Method for Linear Programming Vladlen Koltun November 18, 2005 Abstract We present a new family of combinatorial algorithms for linear programming called the arrangement method. The method
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 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 information