Subexponential Lower Bounds for the Simplex Algorithm
|
|
- Marcus Hampton
- 5 years ago
- Views:
Transcription
1 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 Lower Bounds for the SimplexJanuary Algorithm 0, /
2 Outline 1 LPs and Simplex algorithm MDPs and Policy iteration 3 Random Edge 4 Random Facet and Least Entered 5 All is well that ends well? Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, 011 /
3 LPs and Simplex algorithm LPs and Simplex algorithm Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
4 Outline LPs and Simplex algorithm 1 LPs and Simplex algorithm Linear programming Simplex algorithm Pivoting rules Technique MDPs and Policy iteration 3 Random Edge 4 Random Facet and Least Entered 5 All is well that ends well? Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
5 LPs and Simplex algorithm Linear programming Linear programming Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
6 Context LPs and Simplex algorithm Linear programming Optimization of a linear objective subject to linear (in)equality constraints One of the most important computational problems Simplex Algorithm introduced by Dantzig in 1947 for solving LPs Weakly polytime algorithms: Ellipsoid Method by Khachiyan, Interior Point Method by Karmarkar No strongly polytime algorithm known Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
7 LPs and Simplex algorithm Linear programming Linear programming max s.t. c T x Ax = b x 0 min s.t. b T y A T y c Simplex algorithm (Dantzig 1947) Ellipsoid algorithm (Khachiyan 1979) Interior-point algorithm (Karmakar 1984) Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
8 LPs and Simplex algorithm Simplex algorithm Simplex algorithm Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
9 Context LPs and Simplex algorithm Simplex algorithm Introduced by Dantzig in 1947 for solving LPs Fixpoint iteration algorithm Asymptotic complexity depends on the number of iterations Parameterized by pivoting rules Hirsch conjecture Oliver Friedmann (LMU) Subexponential Lower Bounds for the SimplexJanuary Algorithm 0, /
10 Simplex algorithm LPs and Simplex algorithm Simplex algorithm Dantzig 1947 Move up, along an edge, to a neighboring vertex, until reaching the top 10 /
11 LPs and Simplex algorithm Pivoting rules Pivoting rules 11 /
12 Pivoting rules LPs and Simplex algorithm Pivoting rules Simplex method is parameterized by a pivoting rule. Pivoting rule = method of chosing adjacent vertices with better objective only single-switching deterministic vs. memorizing vs. randomized oblivious 1 /
13 Deterministic rules LPs and Simplex algorithm Pivoting rules Dantzig s rule Bland s rule Lexicographic rule many more... Theorem (Klee-Minty (197) et al. ) All known to require an exponential number of steps in the worst case. 13 /
14 Randomized rules LPs and Simplex algorithm Pivoting rules Random-Facet: recursively find the optimum (see later) due to Kalai ( 9), and Matoušek, Sharir and Welzl ( 96) Random-Edge: choose a random improving edge Theorem (Friedmann-Hansen-Zwick (SODA 011,...)) There are (different) explicit LPs on which Random-Facet and Random-Edge require an expected subexponential number of iterations. 14 /
15 Memorizing rule LPs and Simplex algorithm Pivoting rules (taken from David Avis paper) Theorem (Friedmann (IPCO 011)) There are explicit LPs on which Least-Entered requires a subexponential number of iterations. 15 /
16 LPs and Simplex algorithm Technique Technique 16 /
17 LPs and Simplex algorithm Lower bound technique Technique 1 Lower bounds for Markov decision process policy iteration Induce linear programs 3 Correspondence of simplex algorithm and policy iteration originally : lower bounds for parity games first 17 /
18 MDPs and Policy iteration MDPs and Policy iteration 18 /
19 Outline MDPs and Policy iteration 1 LPs and Simplex algorithm MDPs and Policy iteration Markov decision processes Policy iteration MDPs as LPs Summary 3 Random Edge 4 Random Facet and Least Entered 5 All is well that ends well? 19 /
20 MDPs and Policy iteration Markov decision processes Markov decision processes 0 /
21 MDPs and Policy iteration Markov decision process Markov decision processes due to Shapley 53, Bellman 57, Howard 60,... 1 a 1 c e b 1 d 1 f 0 Controller (circle) chooses outgoing action Randomizer (square) determines successive state Objective: maximize expected total reward max E[ r(a i )] i=0 1 /
22 MDPs and Policy iteration Markov decision process Markov decision processes due to Shapley 53, Bellman 57, Howard 60,... 1 a 1 c e policy σ = choice of an action from each state b 1 d 1 f 0 Controller (circle) chooses outgoing action Randomizer (square) determines successive state Objective: maximize expected total reward max E[ r(a i )] i=0 1 /
23 MDPs and Policy iteration Policy iteration Policy iteration /
24 Context MDPs and Policy iteration Policy iteration Introduced by Howard in 1960 to solve Markov Decision Processes Transferred to many other areas by several authors Fixpoint iteration algorithm Asymptotic complexity depends on the number of iterations Parameterized by improvement rules 3 /
25 Policy valuations MDPs and Policy iteration Policy iteration a 1 b 1 c 5 1 d val σ (a) = 1 b + 1 c = val σ (b) = + a = val σ (c) = 6 + e = val σ (d) = 1 b + 1 f = val σ (e) = 1 c + 1 f = e 1 f val σ (f) = 0 4 /
26 Policy valuations MDPs and Policy iteration Policy iteration a 1 b 1 c 5 1 d val σ (a) = 1 b + 1 c = 14 val σ (b) = + a = 16 val σ (c) = 6 + e = val σ (d) = 1 b + 1 f = 8 val σ (e) = 1 c + 1 f = 6 e 1 f val σ (f) = /
27 MDPs and Policy iteration (Improving) Switches Policy iteration A σ-switch is an edge e E 0 \ σ not chosen by σ. Facts about switches Comparability: val σ val σ[e] or val σ[e] val σ for every σ-switch. Easy check: val σ val σ[(v,w)] iff val σ (σ(v)) < val σ (w). Improving switches: I(σ) = {e val σ val σ[e] } Theorem Switching: J I(σ) implies val σ val σ[j]. Optimality: I(σ) = implies σ is optimal. 5 /
28 MDPs and Policy iteration Policy iteration algorithm Policy iteration Howard (1960), Hoffman-Karp (1966), Puri (1995), Vöge / Jurdziński (000)... Strategy improvement / Policy iteration 1: while σ is not optimal do : σ σ[j] for some J I(σ) 3: end while Complexity: depends on the number of iterations. 6 /
29 Policy iteration MDPs and Policy iteration Policy iteration 1 a 1 c e b 1 d 1 f val σ (a) = 1 b + 1 c = val σ (b) = + a = val σ (c) = 6 + e = val σ (d) = 1 b + 1 f = val σ (e) = 1 c + 1 f = val σ (f) = 0 7 /
30 Policy iteration MDPs and Policy iteration Policy iteration 1 a 1 c e b 1 d 1 f val σ (a) = 1 b + 1 c = 14 val σ (b) = + a = 16 val σ (c) = 6 + e = 1 val σ (d) = 1 b + 1 f = 8 val σ (e) = 1 c + 1 f = 6 val σ (f) = /
31 Policy iteration MDPs and Policy iteration Policy iteration a 1 b 1 c 5 1 d val σ (a) = 1 b + 1 c = val σ (b) = + a = val σ (c) = 5 + d = val σ (d) = 1 b + 1 f = val σ (e) = 1 c + 1 f = e 1 f val σ (f) = 0 7 /
32 Policy iteration MDPs and Policy iteration Policy iteration a 1 b 1 c 5 1 d val σ (a) = 1 b + 1 c = 16 val σ (b) = + a = 18 val σ (c) = 5 + d = val σ (d) = 1 b + 1 f = 9 val σ (e) = 1 c + 1 f = 7 e 1 f val σ (f) = /
33 Complexity MDPs and Policy iteration Policy iteration Policy Iteration is parameterized by an improvement rule. Improvement Rule = method of chosing improving switches Single-switching vs. Multi-switching Deterministic vs. Memorizing vs. Randomized Oblivious 8 /
34 Diameter MDPs and Policy iteration Policy iteration Question: theoretically possible to have polynomially many iterations? Let G be a game and n be the number of nodes. Definition: the diameter of G is the least number of iterations required to solve G Diameter Theorem The diameter of G is less or equal to n. 9 /
35 MDPs and Policy iteration MDPs as LPs MDPs as LPs 30 /
36 MDPs and Policy iteration Dual LP of unichain MDP MDPs as LPs (D) min s.t. i V y i y i j V p j,ay j r a, i V, a A i V - set of all states A - set of all actions, A i - set of actions from state i r a - reward of action a, p i,a - transition probability from action a to state i y i - value of state i 31 /
37 MDPs and Policy iteration Primal LP of unichain MDP MDPs as LPs (P ) max s.t. a A r ax a a A i x a a A p i,ax a = 1, i V x a 0, a A x a - expected number of times of taking action a, when starting from all positions 3 /
38 MDPs and Policy iteration Summary Summary 33 /
39 MDPs and Policy iteration Pivoting on the induced LP Summary Theorem Vertex of bfs in the primal LP corresponds to policy in the MDP. Improving switches correspond to pivoting steps. Theorem Optimal solution of the dual LP corresponds to optimal policies in the MDP. Policy corresponds to basic solution of the dual. 34 /
40 MDPs and Policy iteration Summary Policy iteration vs. Simplex method Policy iteration Simplex method Pivoting single- and single-switch Rules multi-switch only Diameter linear unknown / Hirsch conjecture 35 /
41 Random Edge Random Edge 36 /
42 Outline Random Edge 1 LPs and Simplex algorithm MDPs and Policy iteration 3 Random Edge Random edge rule Motivation Construction 4 Random Facet and Least Entered 5 All is well that ends well? 37 /
43 Random Edge Random edge rule Random edge rule 38 /
44 Random edge rule Random Edge Random edge rule Random-Edge rule Perform single switch arbitrarly at random. Context Abstract lower bound: Ω( 3 n) (Matoušek, Szabó 006) 39 /
45 Random Edge Motivation Motivation 40 /
46 Random Edge Construction principles Motivation 1 Process always reaches the sink (unichain MDPs) Priority rewards on the nodes ( n) 5 5 ( n) 5 ( n) 5 ( n) 5 41 /
47 Cycle gadgets Random Edge Motivation 1 ɛ ɛ a b c d val σ (b) val σ (d) 4 /
48 Cycle gadgets Random Edge Motivation 1 ɛ ɛ a b c d val σ (b) = val σ (a) 4 /
49 Random Edge Motivation Binary Counting - How does it work? /
50 Random Edge Motivation Binary Counting - How does it work? Setting /
51 Random Edge Motivation Binary Counting - How does it work? Setting Resetting /
52 Random Edge Motivation Binary Counting - How does it work? Setting Resetting Activating /
53 Binary Counters Random Edge Motivation Binary Counting proceeds in three phases. 1 Set the least unset bit Reset all lower (inactive) bits 3 Activate recently set bit How to separate active from inactive bits? By access control. Attach access control structure to every bit Set bits are activated Recently set bit is not activated After resetting lower bits, recently set bit is activated 44 /
54 Random Edge Construction Construction 45 /
55 Full construction Random Edge Construction wn+1 t 1 un+1. yi+1 4i + 10 g ci+1,j 3 bi+1 4 li+1 bi+1,j 3 di+1 4i + 9 ui+1 wi+1 ai+1 4 ai+1,j 3 xi+1 4i + 7 h yi 4i + 6 g ci,j 3 bi 4 li bi,j 3 di 4i + 5 ui wi ai 4 ai,j 3 xi 4i + 3 h. y1 10 g c1,j 3 b1 4 l1 b1,j 3 d1 9 u1 w1 a1 4 a1,j 3 x1 7 h r 6 s 46 /
56 Cycle Gadget Random Edge Construction 47 /
57 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
58 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
59 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
60 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
61 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
62 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
63 Cycle Gadget Random Edge Construction Cycles close one edge at a time 47 /
64 Cycle Gadget Random Edge Construction Cycles close one edge at a time Shorter cycles close faster 47 /
65 Cycle Gadget Random Edge Construction 47 /
66 Cycle Gadget Random Edge Construction Cycles open simultaneously 47 /
67 Cycle Gadget Random Edge Construction Cycles open simultaneously 47 /
68 Cycle Gadget Random Edge Construction Cycles open simultaneously 47 /
69 Cycle Gadget Random Edge Construction Cycles open simultaneously 47 /
70 Cycle Gadget Random Edge Construction Cycles open simultaneously 47 /
71 Random Edge Construction Increment phases: from to Setting: { B k counting cycle closes C k helper cycle closes Resetting: 3 Activating: { U lane realigns A i and B i cycles (i < k) open A k access cycle closes W lane realigns C i cycles of unset bits open 48 /
72 Analysis Random Edge Construction Cycles (opening and closing) and lanes compete with each other. Supposed candidate has to win with high probability. Solution: increase length of higher cycles, resulting in O(n 4 ) vertices. Work in progress: improved construction. 49 /
73 Lower bound Random Edge Construction Theorem (F.-Hansen-Zwick (011)) The number of improving step performed by Random-Edge on the MDPs (and LPs), which contain O(n 4 ) vertices and edges, is Ω(n). 50 /
74 Random Facet and Least Entered Random Facet and Least Entered 51 /
75 Outline Random Facet and Least Entered 1 LPs and Simplex algorithm MDPs and Policy iteration 3 Random Edge 4 Random Facet and Least Entered Random Facet on LPs and MDPs Random Facet construction Least Entered 5 All is well that ends well? 5 /
76 Random Facet and Least Entered Random Facet on LPs and MDPs Random Facet on LPs and MDPs 53 /
77 The algorithm Random Facet and Least Entered Random Facet on LPs and MDPs due to Kalai ( 9), and Matoušek, Sharir and Welzl ( 96) procedure Random-Facet(H,B) if H = B then return B else Choose h H \ B at random B Random-Facet(H \ {h}, B) if h is violated by B then B Basis(B {h}) return Random-Facet(H, B ) else return B end if end if end procedure procedure Random-Facet(G,σ) if E 0 = σ then return σ else Choose e E 0 \ σ at random σ Random-Facet(G \ {e}, σ) if val σ val σ [e] then σ σ [e] return Random-Facet(G, σ ) else return σ end if end if end procedure Random Facet for LPs Random Facet for MDPs 54 /
78 Context Random Facet and Least Entered Random Facet on LPs and MDPs Known results Upper bound: O(n) (Kalai 199) Abstract lower bound: Ω( n) (Matoušek 1994) Theorem (F.-Hansen-Zwick (011)) Random-Facet for MDPs and LPs is subexponential. 55 /
79 Random Facet and Least Entered Random Facet construction Random Facet construction 56 /
80 Random Facet and Least Entered Randomized counting Random Facet construction 57 /
81 Random Facet and Least Entered Randomized counting exclude bit Random Facet construction /
82 Random Facet and Least Entered Randomized counting exclude bit Random Facet construction count recursively 57 /
83 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively 57 /
84 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively 57 /
85 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively Analysis 57 /
86 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively Analysis Counting equivalent to counting /
87 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively Analysis Counting equivalent to counting Counting equivalent to counting /
88 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively Analysis Counting equivalent to counting Counting equivalent to counting 0 0 Recurrence f(n) = f(n 1) + 1 n 1 n i=0 f(i) 57 /
89 Random Facet and Least Entered Randomized counting Random Facet construction exclude bit set bit count recursively count recursively Analysis Counting equivalent to counting Counting equivalent to counting 0 0 Recurrence f(n) = f(n 1) + 1 n 1 n i=0 f(i) Complexity f(n) e n 1 π n 1 4 for n 57 /
90 Random Facet and Least Entered Random Facet construction Simplified construction (for parity games) t : 1 c3 : 8 b3 : b3 : lr d3 : 3 a3 : a3 : l r c : 6 b : b : lr d : 3 a : a : l r c1 : 4 b1 : b1 : lr d1 : 3 a1 : a1 : l r 58 /
91 Lower bound Random Facet and Least Entered Random Facet construction Theorem (F.-Hansen-Zwick (011)) The number of improving step performed by Random-Facet on the MDPs (and LPs) is Ω( n/ log(n)). 59 /
92 Random Facet and Least Entered Least Entered Least Entered 60 /
93 Random Facet and Least Entered Zadeh s pivoting rule Least Entered Zadeh s Least-Entered rule Perform single switch that has been applied least often. 61 /
94 Fair counting Random Facet and Least Entered Least Entered Problem: Flipping higher bits happens less often than flipping lower bits Zadeh s rule switches higher bits before they are supposed to be switched Solution: Represent every bit by two representatives Only one representative is actively working Inactive representative switches back and forth to catch up with the rest Both representatives change roles after flipping the represented bit 6 /
95 Full construction Random Facet and Least Entered Least Entered t kn+1 n+9 k [i+;n] ki+1 t h 0 i i+8 h 1 i i+8 s d 0 i 6 d 1 i 6 s k [1;n] b 0 i,0 1 ε ε ε 1 ε b 1 i,0 k [1;n] A 0 i A 1 i 1 ε 1 ε t b 0 i,1 b 1 i,1 t c0 i t k c1 i 7 [1;n] 7 ki i+7 t k [1;n] s 63 /
96 Lower bound Random Facet and Least Entered Least Entered Theorem (Friedmann (011)) The number of improving step performed by Least-Entered on the MDPs, which contain O(n ) vertices and edges, is Ω(n). 64 /
97 All is well that ends well? All is well that ends well? 65 /
98 All is well that ends well? Concluding remarks Game-theortic perspective helpful for the construction of lower bounds Lower bounds transfer to many other classes of determined games Random-Edge lower bound can be used as lower bound for Switch-Half 66 /
99 All is well that ends well? Relation to other games LP-type problems (LPtype) Turn-based Stochastic Games (TSG) 1 players Linear Programming (LP) Discounted Payoff Games (DPG) players Mean Payoff Games (MPG) players Markov Decision Processes (MDP) 1 1 players Parity Games (PG) players Deterministic Markov Decision Processes (DMDP) 1 player NP conp P 67 /
100 All is well that ends well? Open problems Polytime algorithm for two-player games and the like Strongly polytime algorithm for LPs (and MDPs) Resolving the Hirsch conjecture Find game-theoretic model with unresolved diameter bounds 68 /
101 All is well that ends well? The slide usually called the end. Thank you for listening! 69 /
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
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.
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 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 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 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 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 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 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 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 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 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 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 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 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 informationAlgorithms for simple stochastic games
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2009 Algorithms for simple stochastic games Elena Valkanova University of South Florida Follow this and additional
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 information(67686) Mathematical Foundations of AI July 30, Lecture 11
(67686) Mathematical Foundations of AI July 30, 2008 Lecturer: Ariel D. Procaccia Lecture 11 Scribe: Michael Zuckerman and Na ama Zohary 1 Cooperative Games N = {1,...,n} is the set of players (agents).
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)
More informationComplexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework Henrik Björklund, Sven Sandberg, and Sergei Vorobyov Information Technology Department, Box 337, Uppsala University,
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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationThe PGSolver Collection of Parity Game Solvers
Report The PGSolver Collection of Parity Game Solvers Version 3 Oliver Friedmann Martin Lange Institut für Informatik Ludwig-Maximilians-Universität München, Germany March 5, 2014 1 1 5 5 8 5 1 7 2 0 Contents
More informationSimple Stochastic Parity Games
Simple Stochastic Parity Games Krishnendu Chatterjee, Marcin Jurdziński, and Thomas A. Henzinger Department of Electrical Engineering and Computer Sciences University of California, Berkeley, USA Abstract.
More informationIntroduction to Linear Programming
Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940
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 informationA Feasible Region Contraction Algorithm (Frca) for Solving Linear Programming Problems
A Feasible Region Contraction Algorithm (Frca) for Solving Linear Programming Problems E. O. Effanga Department of Mathematics/Statistics and Comp. Science University of Calabar P.M.B. 1115, Calabar, Cross
More informationPolyhedral Compilation Foundations
Polyhedral Compilation Foundations Louis-Noël Pouchet pouchet@cse.ohio-state.edu Dept. of Computer Science and Engineering, the Ohio State University Feb 15, 2010 888.11, Class #4 Introduction: Polyhedral
More informationDr. Amotz Bar-Noy s Compendium of Algorithms Problems. Problems, Hints, and Solutions
Dr. Amotz Bar-Noy s Compendium of Algorithms Problems Problems, Hints, and Solutions Chapter 1 Searching and Sorting Problems 1 1.1 Array with One Missing 1.1.1 Problem Let A = A[1],..., A[n] be an array
More informationEARLY INTERIOR-POINT METHODS
C H A P T E R 3 EARLY INTERIOR-POINT METHODS An interior-point algorithm is one that improves a feasible interior solution point of the linear program by steps through the interior, rather than one that
More informationarxiv: v1 [cs.ds] 5 May 2017
Efficient Parallel Strategy Improvement for Parity Games John Fearnley arxiv:1705.02313v1 [cs.ds] 5 May 2017 Department of Computer Science, University of Liverpool, UK Abstract. We study strategy improvement
More informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More information11. APPROXIMATION ALGORITHMS
Coping with NP-completeness 11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: weighted vertex cover LP rounding: weighted vertex cover generalized load balancing knapsack problem
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationLinear Programming 1
Linear Programming 1 Fei Li March 5, 2012 1 With references of Algorithms by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani. Many of the problems for which we want algorithms are optimization tasks.
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 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 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 informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
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 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 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 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 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 informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 1: Introduction to Optimization. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 013 Lecture 1: Introduction to Optimization Instructor: Shaddin Dughmi Outline 1 Course Overview Administrivia 3 Linear Programming Outline 1 Course Overview
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 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 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 informationMaterial handling and Transportation in Logistics. Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena
Material handling and Transportation in Logistics Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena Introduction to Graph Theory Graph Theory As Mathematical
More informationExercises Computational Complexity
Exercises Computational Complexity March 22, 2017 Exercises marked with a are more difficult. 1 Chapter 7, P and NP Exercise 1. Suppose some pancakes are stacked on a surface such that no two pancakes
More informationMultiple-choice (35 pt.)
CS 161 Practice Midterm I Summer 2018 Released: 7/21/18 Multiple-choice (35 pt.) 1. (2 pt.) Which of the following asymptotic bounds describe the function f(n) = n 3? The bounds do not necessarily need
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 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 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 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 information7 Algorithms for Parity Games
7 Algorithms for Parity Games Hartmut Klauck School of Mathematics Institute for Advanced Study, Princeton 7.1 Introduction It is the aim of this chapter to review some of the algorithmic approaches to
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 information! Linear programming"! Duality "! Smallest enclosing disk"
! Linear programming"! Duality "! Smallest enclosing disk" 14. 24.! Define:" " i types of foods (1!i!d).! " j types of vitamins (1!j!n)." " x i the amount of food of type i." " a ji the amount of vitamin
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 informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 50
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 50 CS 473: Algorithms, Spring 2018 Introduction to Linear Programming Lecture 18 March
More informationLinear Optimization and Extensions: Theory and Algorithms
AT&T Linear Optimization and Extensions: Theory and Algorithms Shu-Cherng Fang North Carolina State University Sarai Puthenpura AT&T Bell Labs Prentice Hall, Englewood Cliffs, New Jersey 07632 Contents
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 informationModule 16: Data Flow Analysis in Presence of Procedure Calls Lecture 32: Iteration. The Lecture Contains: Iteration Space.
The Lecture Contains: Iteration Space Iteration Vector Normalized Iteration Vector Dependence Distance Direction Vector Loop Carried Dependence Relations Dependence Level Iteration Vector - Triangular
More informationComputational Geometry
Casting a polyhedron CAD/CAM systems CAD/CAM systems allow you to design objects and test how they can be constructed Many objects are constructed used a mold Casting Casting A general question: Given
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
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 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 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 informationFaster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification
Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification Krishnendu Chatterjee Monika Henzinger Abstract We present faster and dynamic
More informationCS521 \ Notes for the Final Exam
CS521 \ Notes for final exam 1 Ariel Stolerman Asymptotic Notations: CS521 \ Notes for the Final Exam Notation Definition Limit Big-O ( ) Small-o ( ) Big- ( ) Small- ( ) Big- ( ) Notes: ( ) ( ) ( ) ( )
More informationPlanning and Control: Markov Decision Processes
CSE-571 AI-based Mobile Robotics Planning and Control: Markov Decision Processes Planning Static vs. Dynamic Predictable vs. Unpredictable Fully vs. Partially Observable Perfect vs. Noisy Environment What
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 informationArtificial Intelligence
Artificial Intelligence Shortest Path Problem G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 3 GG A.I. 1/42 Outline 1 The Shortest Path Problem Introduction
More informationNew Results on Simple Stochastic Games
New Results on Simple Stochastic Games Decheng Dai 1 and Rong Ge 2 1 Tsinghua University, ddc02@mails.tsinghua.edu.cn 2 Princeton University, rongge@cs.princeton.edu Abstract. We study the problem of solving
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 informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
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 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 informationEND-TERM EXAMINATION
(Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt
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 informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
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 information