Advanced Algorithms 南京大学 尹一通
|
|
- Clarence Jones
- 5 years ago
- Views:
Transcription
1 Advanced Algorithms 南京大学 尹一通
2 LP-based Algorithms LP rounding: Relax the integer program to LP; round the optimal LP solution to a nearby feasible integral solution. The primal-dual schema: Find a pair of solutions to the primal and dual programs which are close to each other.
3 Vertex Cover Instance: An undirected graph G(V,E) Find the smallest C V that every edge has at least one endpoint in C. e 1 v1 e 2 e 1 e 3 v3 v2 e 2 e 3 v1 v2 e 5 e 6 e 4 v4 incidence graph e 4 e 5 e 6 v3 v4 instance of set cover with frequency =2
4 Instance: An undirected graph G(V,E) Find the smallest C V that every edge has at least one endpoint in C. Find a maximal matching M; return the set C ={v: uv M} of matched vertices; maximality C is vertex cover e 1 matching M OPTVC (weak duality) e 2 e 3 e 4 v1 v2 v3 C 2 M 2OPT e 5 e 6 v4
5 Duality e 1 vertex cover: matching: e 2 e 3 e 4 e 5 e 6 constraints v e xv 1 variables ye {0,1} v1 v2 v3 v4 variables xv {0,1} constraints e v ye 1
6 Duality Instance: graph G(V,E) primal: dual: minimize subject to v2v v2e maximize subject to x v x v 1, x v 2 {0, 1}, e2e e3v y e y v apple 1, y e 2 {0, 1}, 8e 2 E 8v 2 V 8v 2 V 8e 2 E vertex covers matchings
7 Duality for LP-Relaxation Instance: graph G(V,E) primal: dual: minimize subject to v2v v2e maximize subject to e2e e3v x v x v 1, x v 0, y e y v apple 1, y e 0, 8e 2 E 8v 2 V 8v 2 V 8e 2 E
8 Estimate the Optima minimize subject to 7x 1 + x 2 + 5x 3 x 1 x 2 + 3x x 1 + 2x 2 x = x 1,x 2,x OPT any feasible solution
9 Estimate the Optima minimize 7x 1 + x 2 + 5x 3 subject to y 1 x 1 x 2 + 3x 3 10 y y 2 5x 1 + 2x 2 x 3 6 y 2 x 1,x 2,x y 1 +6y 2 OPT for any y 1 + 5y 2 7 y 1 + 2y 2 1 3y 1 y 2 5 y 1,y 2 0
10 Primal-Dual Primal min 7x 1 + x 2 + 5x 3 x 1 x 2 + 3x x 1 + 2x 2 x 3 6 x 1,x 2,x 3 0 Dual max 10y 1 +6y 2 dual feasible y 1 + 5y 2 7 primal OPT y 1 + 2y 2 1 3y 1 y 2 5 LP NP conp y 1,y 2 0
11 Surviving Problem price vitamin 1 c1 c2 cn a11 a12 a1n healthy b1 vitamin m am1 am2 amn bm solution: x1 x2 xn minimize the total price while keeping healthy
12 Surviving Problem min c T x Ax b x 0 price vitamin 1 c1 c2 cn a11 a12 a1n healthy b1 vitamin m am1 am2 amn bm solution: x1 x2 xn minimize the total price while keeping healthy
13 LP Duality Primal: min c T x Dual: max b T y Ax b y T A c T x 0 y 0 dual solution: price c1 c2 cn healthy y1 vitamin 1 a11 a12 a1n b1 ym vitamin m am1 am2 amn bm m types of vitamin pills, design a pricing system competitive to n natural foods, max the total price
14 LP Duality Primal: min c T x Dual: max b T y Ax b y T A c T x 0 y 0 Monogamy: dual(dual(lp)) = LP Weak Duality: feasible primal solution x and dual solution y y T b y T A x c T x
15 LP Duality Primal: min c T x Dual: max b T y Ax b y T A c T x 0 y 0 Weak Duality Theorem: feasible primal solution x and dual solution y y T b c T x
16 LP Duality Primal: min c T x Dual: max b T y Ax b y T A c T x 0 y 0 Strong Duality Theorem: Primal LP has finite optimal solution x * iff dual LP has finite optimal solution y *. y *T b = c T x *
17 Primal: min c T x Dual: max b T y Ax b x 0 y T A c T y 0 feasible primal solution x and dual solution y y T b y T A x c T x Strong Duality Theorem x and y are both optimal iff y T b = y T A x = c T x i: either Ai x = bi or yi = 0 j: either y T A j = cj or xj = m m n b i y i a ij x j A y i i=1 n c j x j = i=1 n j=1 j=1 j=1 i=1! m a ij y i x j
18 Complementary Slackness Primal: min c T x Ax b x 0 Dual: max b T y y T A c T y 0 Complementary Slackness Conditions: feasible primal solution x and dual solution y x and y are both optimal iff i: either Ai x = bi or yi = 0 j: either y T A j = cj or xj = 0
19 Relaxed Complementary Slackness Primal: min c T x Dual: max b T y Ax b x 0 y T A c T y 0 feasible primal solution x and dual solution y for α, β 1: i: either Ai x α bi or yi = 0 j: either y T A j cj/β or xj = 0 c T x αβ b T y αβ OPTLP n c j x j apple j=1 n j=1! m a ij y i x j = i=1 0 1 m a ij x i A y j i=1 j=1 apple m i=1 b i y i
20 Primal-Dual Schema Primal IP: min c T x Dual LP-relax: max b T y Ax b x Z 0 y T A c T y 0 Find a primal integral solution x and a dual solution y for α, β 1: i: either Ai x α bi or yi = 0 j: either y T A j cj/β or xj = 0 c T x αβ b T y αβ OPTLP αβ OPTIP
21 e 1 e 2 e 3 e 4 e 5 e 6 vertex cover: constraints v e xv 1 matching: variables ye {0,1} v1 v2 v3 v4 variables xv {0,1} constraints e v ye 1 primal: dual-relax: min min v2v x v x v 1, 8e 2 E v2e x v 2 {0, 1}, e2e y e y e apple 1, e3v 8v 2 V 8v 2 V y e 0, 8e 2 E feasible (x, y) such that: e: ye > 0 v e xv α v: xv = 1 e v ye = 1
22 primal: min v2v x v x v 1, 8e 2 E v2e x v 2 {0, 1}, 8v 2 V dual-relax: min e2e y e y e apple 1, e3v 8v 2 V y e 0, 8e 2 E event: v is tight (saturated) e v ye = 1 Initially x = 0, y = 0; while E to 1 pick an e E and raise ye until some v goes tight; set xv = 1 for those tight v and delete all e v from E; v e o every deleted e is incident to a v that xv = 1 e E: v e x v 1 all edges are eventually deleted x is feasible relaxed complementary slackness: e: either v e xv 2 or ye = 0 v: either e v ye = 1 or xv = 0 v2v x v apple 2 OPT
23 Initially x = 0, y = 0; while E to 1 pick an e E and raise ye until some v goes tight; set xv = 1 for those tight v and delete all e v from E; v e Find a maximal matching; return the set of matched vertices; the returned set is a vertex cover SOL 2 OPT
24 The Primal-Dual Schema Write down an LP-relaxation and its dual. min c T x Ax b x Z 0 Start with a primal infeasible solution x and a dual feasible solution y (usually x=0, y=0). Raise x and y until x is feasible: raise y until some dual constraints gets tight y T A j = cj ; raise xj (integrally) corresponding to the tight dual constraints. Show the complementary slackness conditions: i: either A i x α b i or y i = 0 j: either y T A j cj/β or xj = 0 max b T y y T A c T y 0 c T x αβ b T y αβ OPT
25 Integrality Gap LP relaxation of vertex cover : given G(V,E), minimize v V xv subject to v e xv 1, e E xv {0, 1}, v V xv [0, 1], Integrality gap = sup I OPT(I) OPT LP (I) For the LP relaxation of vertex cover: integrality gap = 2
26 Facility Location hospitals in Nanjing
27 Facility Location facilities: f i c ij clients: j i Instance: set F of facilities; set C of clients; Find a subset I F of opening facilities and a way φ: C I of connecting all clients to them such that the total cost facility opening costs f: F [0, ); connection costs c: F C [0, ); j2c c (j),j + i2i f i is minimized. uncapacitated facility location; NP-hard; AP(Approximation Preserving)-reduction from Set Cover; [Dinur, Steuer 2014] no poly-time (1-o(1))ln n-approx. algorithm unless NP = P.
28 Metric Facility Location facilities: clients: j i f i d ij Instance: set F of facilities; set C of clients; facility opening costs f: F [0, ); connection metric d: F C [0, ); Find a subset I F of opening facilities and a way φ: C I of connecting all clients to them such that the total cost triangle inequality: j2c d (j),j + i2i f i is minimized. 8i 1,i 2 2 F, 8j 1,j 2 2 C i1 i2 d i1 j 1 + d i2 j 1 + d i2 j 2 d i1 j 2 j1 j2
29 Instance: set F of facilities; set C of clients; facility opening costs f: F [0, ); connection metric d: F C [0, ); Find φ: C I F to minimize facilities: LP-relaxation: min x ij,y i 0, d ij y i 2 {0, 1} i f i j2c d (j),j + i2i i2f,j2c d ij x ij + i2f i2f x ij 2 {0, 1} clients: j y i x ij, x ij,y i 2 {0, 1}, indicates i I f i y i x ij 1, 8j 2 C f i indicates i = φ(j) 8i 2 F, j 2 C 8i 2 F, j 2 C
30 facilities: d ij clients: j i ij j f i Primal: min d ij x ij + f i y i i2f,j2c i2f y i x ij 0, 8i 2 F, j 2 C x ij 1, 8j 2 C i2f x ij,y i 2 {0, 1}, 8i 2 F, j 2 C Dual-relax: max j2c j j ij apple d ij, ij apple f i, j2c 8i 2 F, j 2 C 8i 2 F j, ij 0, 8i 2 F, j 2 C α j : amount of value paid by client j to all facilities βij αj - dij : payment to facility i by client j (after deduction) complimentary slackness conditions: (if ideally held) x ij =1 α j - β ij = d ij ; yi =1 j C βij = fi ; α j > 0 i F x ij = 1 ; βij > 0 yi = xij ;
31 min d ij x ij + f i y i i2f,j2c i2f y i x ij 0, 8i 2 F, j 2 C x ij 1, 8j 2 C i2f x ij,y i 2 {0, 1}, facilities: 8i 2 F, j 2 C i f i d ij ij j max clients: j j2c j j ij apple d ij, ij apple f i, j2c 8i 2 F, j 2 C 8i 2 F j, ij 0, 8i 2 F, j 2 C Initially α = 0, β = 0, no facility is open, no client is served; raise αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj;
32 facilities: i f i d ij ij j clients: j Initially α = 0, β = 0, no facility is open, no client is served; raise αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj; The events that occur at the same time are processed in arbitrary order. Fully paid facilities are tentatively open: j C βij = fi Fully paid edges to tentatively opening facilities are connected: αj - βij = dij Eventually all clients connect to tentatively opening facilities. A client may connect to more than one facilities!
33 Phase I: Initially α = 0, β = 0, no facility is open, no client is served; raise αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj; facilities: i f i d ij ij Phase II: construct graph G(V,E) where V={tentatively open facilities} and (i 1, i 2 ) E if facilities i 1, i 2 are connected to same client j in Phase I; find a maximal independent set I of G and permanently open facilities in I; connect facilities in I to the directly connected clients in Phase I; for every unconnected client (the indirectly connected clients): connect it to the nearest open facility; j clients: j i1 j1 i2 j2
34 Phase I: Initially α = 0, β = 0, no facility is open, no client is served; raise αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj; Phase II: construct graph G(V,E) where V={tentatively open facilities} and (i 1, i 2 ) E if facilities i 1, i 2 are connected to same client j in Phase I; find a maximal independent set I of G and permanently open facilities in I; connect facilities in I to the directly connected clients in Phase I; for every unconnected client (the indirectly connected clients): connect it to the nearest open facility; i1 j1 i2 j2 I is independent set Every client is connected to exact one open facilities. (feasible)
35 facilities: i f i d ij ij j clients: j Primal: min d ij x ij + f i y i i2f,j2c i2f y i x ij 0, 8i 2 F, j 2 C x ij 1, 8j 2 C i2f x ij,y i 2 {0, 1}, 8i 2 F, j 2 C Dual-relax: max j2c j j ij apple d ij, ij apple f i, j2c 8i 2 F, j 2 C 8i 2 F j, ij 0, 8i 2 F, j 2 C α j : amount of value paid by client j to all facilities βij αj - dij : payment to facility i by client j (after deduction) complimentary slackness conditions: (if ideally held) x ij =1 α j - β ij = d ij ; yi =1 j C βij = fi ; α j > 0 i F x ij = 1 ; βij > 0 yi = xij ;
36 Phase I: Initially α = 0, β = 0, no facility is open, no client is served; raise n αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj; Phase II: construct graph G(V,E) where V={tentatively open facilities} and (i 1, i 2 ) E if facilities i 1, i 2 are connected to same client j in Phase I; find a maximal independent set I of G and permanently open facilities in I; connect facilities in I to the directly connected clients in Phase I; for every unconnected client (the indirectly connected clients): connect it to the nearest open facility; SOL= apple f i + i2i j:directly connected (j) = ( j:directly connected j d (j)j + triangle inequality apple 3 + maximality of I j:indirectly connected i that βij = αj - dij if j is directly connected nearest facility in I j:indirectly connected d (j)j j if j is indirectly connected i1 j1 i2 j2 apple 3 j2c j 3 OPT
37 Phase I: Initially α = 0, β = 0, no facility is open, no client is served; raise αj for all client j simultaneously at a uniform continuous rate: upon αj = dij for a closed facility i: edge (i,j) is paid; fix βij = αj - dij as αj being raised; upon j C βij = fi : tentatively open facility i; connect all clients j with paid (i,j) to facility i and stop raising αj; upon αj = dij for a tentatively open facility i: connect client j to facility i and stop raising αj; Phase II: construct graph G(V,E) where V={tentatively open facilities} and (i 1, i 2 ) E if facilities i 1, i 2 are connected to same client j in Phase I; find a maximal independent set I of G and permanently open facilities in I; connect facilities in I to the directly connected clients in Phase I; for every unconnected client (the indirectly connected clients): connect it to the nearest open facility; SOL 3 OPT i1 j1 i2 j2 can be implemented discretely: in O(m log m) time, m= F C sort all edges (i,j) F C by non-decreasing dij dynamically maintain the time of next event by heap
38 Instance: set F of facilities; set C of clients; facility opening costs f: F [0, ); connection metric d: F C [0, ); Find φ: C I F to minimize j2c d (j),j + i2i f i min i2f,j2c d ij x ij + i2f x ij,y i 2 {0, 1}, f i y i y i x ij 0, x ij 1, 8j 2 C i2f facilities: i f i d ij clients: j 8i 2 F, j 2 C 8i 2 F, j 2 C Integrality gap = 3 no poly-time <1.463-approx. algorithm unless NP=P [Li 2011] approx. algorithm
Integer Programming (IP)
Integer Programming (IP) An LP problem with an additional constraint that variables will only get an integral value, maybe from some range. BIP binary integer programming: variables should be assigned
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationDual fitting approximation for Set Cover, and Primal Dual approximation for Set Cover
duality 1 Dual fitting approximation for Set Cover, and Primal Dual approximation for Set Cover Guy Kortsarz duality 2 The set cover problem with uniform costs Input: A universe U and a collection of subsets
More informationLectures 6, 7 and part of 8
Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,
More informationLecture 15 (Oct 6): LP Duality
CMPUT 675: Approximation Algorithms Fall 2014 Lecturer: Zachary Friggstad Lecture 15 (Oct 6): LP Duality Scribe: Zachary Friggstad 15.1 Introduction by Example Given a linear program and a feasible solution
More informationLecture 6,7 (Sept 27 and 29, 2011 ): Bin Packing, MAX-SAT
,7 CMPUT 675: Approximation Algorithms Fall 2011 Lecture 6,7 (Sept 27 and 29, 2011 ): Bin Pacing, MAX-SAT Lecturer: Mohammad R. Salavatipour Scribe: Weitian Tong 6.1 Bin Pacing Problem Recall the bin pacing
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 https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More informationLinear Programming. Scheduling problems
Linear Programming Scheduling problems Linear programming (LP) ( )., 1, for 0 min 1 1 1 1 1 11 1 1 n i x b x a x a b x a x a x c x c x z i m n mn m n n n n! = + + + + + + = Extreme points x ={x 1,,x n
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationLecture 11 October 7, 2013
CS 4: Advanced Algorithms Fall 03 Prof. Jelani Nelson Lecture October 7, 03 Scribe: David Ding Overview In the last lecture we talked about set cover: Sets S,..., S m {,..., n}. S has cost c S. Goal: Cover
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More informationIn the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight.
In the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight. In the multi-dimensional knapsack problem, additional
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationNetwork Design and Game Theory Spring 2008 Lecture 6
Network Design and Game Theory Spring 2008 Lecture 6 Guest Lecturer: Aaron Archer Instructor: Mohammad T. Hajiaghayi Scribe: Fengming Wang March 3, 2008 1 Overview We study the Primal-dual, Lagrangian
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.
More informationCO759: Algorithmic Game Theory Spring 2015
CO759: Algorithmic Game Theory Spring 2015 Instructor: Chaitanya Swamy Assignment 1 Due: By Jun 25, 2015 You may use anything proved in class directly. I will maintain a FAQ about the assignment on the
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationTopic: Primal-Dual Algorithms Date: We finished our discussion of randomized rounding and began talking about LP Duality.
CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Primal-Dual Algorithms Date: 10-17-07 14.1 Last Time We finished our discussion of randomized rounding and
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationMaximum flow problem
Maximum flow problem 7000 Network flows Network Directed graph G = (V, E) Source node s V, sink node t V Edge capacities: cap : E R 0 Flow: f : E R 0 satisfying 1. Flow conservation constraints e:target(e)=v
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationExcluded t-factors in Bipartite Graphs:
Excluded t-factors in Bipartite Graphs: A nified Framework for Nonbipartite Matchings and Restricted -matchings Blossom and Subtour Elimination Constraints Kenjiro Takazawa Hosei niversity, Japan IPCO017
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
More informationThe Simplex Algorithm
8.433 Combinatorial Optimization The Simplex Algorithm October 6, 8 Lecturer: Santosh Vempala We proved the following: Lemma (Farkas). Let A R m n, b R m. Exactly one of the following conditions is true:.
More informationThe Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006
The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP Different spaces and objective functions but in general same optimal
More informationLinear Programming Duality
Summer 2011 Optimization I Lecture 8 1 Duality recap Linear Programming Duality We motivated the dual of a linear program by thinking about the best possible lower bound on the optimal value we can achieve
More informationLecture 5. x 1,x 2,x 3 0 (1)
Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationLecture 20: LP Relaxation and Approximation Algorithms. 1 Introduction. 2 Vertex Cover problem. CSCI-B609: A Theorist s Toolkit, Fall 2016 Nov 8
CSCI-B609: A Theorist s Toolkit, Fall 2016 Nov 8 Lecture 20: LP Relaxation and Approximation Algorithms Lecturer: Yuan Zhou Scribe: Syed Mahbub Hafiz 1 Introduction When variables of constraints of an
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationPlanning and Optimization
Planning and Optimization C23. Linear & Integer Programming Malte Helmert and Gabriele Röger Universität Basel December 1, 2016 Examples Linear Program: Example Maximization Problem Example maximize 2x
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationDiscrete (and Continuous) Optimization Solutions of Exercises 2 WI4 131
Discrete (and Continuous) Optimization Solutions of Exercises 2 WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 9: Duality and Complementary Slackness Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationThe Strong Duality Theorem 1
1/39 The Strong Duality Theorem 1 Adrian Vetta 1 This presentation is based upon the book Linear Programming by Vasek Chvatal 2/39 Part I Weak Duality 3/39 Primal and Dual Recall we have a primal linear
More informationCS261: A Second Course in Algorithms Lecture #9: Linear Programming Duality (Part 2)
CS261: A Second Course in Algorithms Lecture #9: Linear Programming Duality (Part 2) Tim Roughgarden February 2, 2016 1 Recap This is our third lecture on linear programming, and the second on linear programming
More informationLecture 10: Linear programming. duality. and. The dual of the LP in standard form. maximize w = b T y (D) subject to A T y c, minimize z = c T x (P)
Lecture 10: Linear programming duality Michael Patriksson 19 February 2004 0-0 The dual of the LP in standard form minimize z = c T x (P) subject to Ax = b, x 0 n, and maximize w = b T y (D) subject to
More informationAlgorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on
6117CIT - Adv Topics in Computing Sci at Nathan 1 Algorithms The intelligence behind the hardware Outline! Approximation Algorithms The class APX! Some complexity classes, like PTAS and FPTAS! Illustration
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More information6. Linear Programming
Linear Programming 6-1 6. Linear Programming Linear Programming LP reduction Duality Max-flow min-cut, Zero-sum game Integer Programming and LP relaxation Maximum Bipartite Matching, Minimum weight vertex
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
More information3. Duality: What is duality? Why does it matter? Sensitivity through duality.
1 Overview of lecture (10/5/10) 1. Review Simplex Method 2. Sensitivity Analysis: How does solution change as parameters change? How much is the optimal solution effected by changing A, b, or c? How much
More informationDual bounds: can t get any better than...
Bounds, relaxations and duality Given an optimization problem z max{c(x) x 2 }, how does one find z, or prove that a feasible solution x? is optimal or close to optimal? I Search for a lower and upper
More informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
More informationSummary of the simplex method
MVE165/MMG630, The simplex method; degeneracy; unbounded solutions; infeasibility; starting solutions; duality; interpretation Ann-Brith Strömberg 2012 03 16 Summary of the simplex method Optimality condition:
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More information15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu)
15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) First show l = c by proving l c and c l. For a maximum matching M in G, let V be the set of vertices covered by M. Since any vertex in
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationApproximation Basics
Approximation Basics, Concepts, and Examples Xiaofeng Gao Department of Computer Science and Engineering Shanghai Jiao Tong University, P.R.China Fall 2012 Special thanks is given to Dr. Guoqiang Li for
More informationConvex Optimization and Support Vector Machine
Convex Optimization and Support Vector Machine Problem 0. Consider a two-class classification problem. The training data is L n = {(x 1, t 1 ),..., (x n, t n )}, where each t i { 1, 1} and x i R p. We
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
Approximation Algorithms Seminar 1 Set Cover, Steiner Tree and TSP Siert Wieringa siert.wieringa@tkk.fi Approximation Algorithms Seminar 1 1/27 Contents Approximation algorithms for: Set Cover Steiner
More informationCSCI5654 (Linear Programming, Fall 2013) Lecture-8. Lecture 8 Slide# 1
CSCI5654 (Linear Programming, Fall 2013) Lecture-8 Lecture 8 Slide# 1 Today s Lecture 1. Recap of dual variables and strong duality. 2. Complementary Slackness Theorem. 3. Interpretation of dual variables.
More informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationConic Linear Optimization and its Dual. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #04 1 Conic Linear Optimization and its Dual Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
More informationP,NP, NP-Hard and NP-Complete
P,NP, NP-Hard and NP-Complete We can categorize the problem space into two parts Solvable Problems Unsolvable problems 7/11/2011 1 Halting Problem Given a description of a program and a finite input, decide
More informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationSolutions to Exercises
1/13 Solutions to Exercises The exercises referred to as WS 1.1(a), and so forth, are from the course book: Williamson and Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011,
More informationCOMP3121/9101/3821/9801 Lecture Notes. Linear Programming
COMP3121/9101/3821/9801 Lecture Notes Linear Programming LiC: Aleks Ignjatovic THE UNIVERSITY OF NEW SOUTH WALES School of Computer Science and Engineering The University of New South Wales Sydney 2052,
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationAdvanced Algorithms 南京大学 尹一通
Advanced Algorithms 南京大学 尹一通 Constraint Satisfaction Problem variables: (CSP) X = {x 1, x2,..., xn} each variable ranges over a finite domain Ω an assignment σ ΩX assigns each variable a value in Ω constraints:
More informationApproximation Algorithms and Hardness of Approximation. IPM, Jan Mohammad R. Salavatipour Department of Computing Science University of Alberta
Approximation Algorithms and Hardness of Approximation IPM, Jan 2006 Mohammad R. Salavatipour Department of Computing Science University of Alberta 1 Introduction For NP-hard optimization problems, we
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 22 October 22, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 16 Table of Contents 1 The Simplex Method, Part II Ming Zhong (JHU) AMS Fall 2018 2 /
More informationWelfare Maximization with Friends-of-Friends Network Externalities
Welfare Maximization with Friends-of-Friends Network Externalities Extended version of a talk at STACS 2015, Munich Wolfgang Dvořák 1 joint work with: Sayan Bhattacharya 2, Monika Henzinger 1, Martin Starnberger
More informationLagrangian Duality and Convex Optimization
Lagrangian Duality and Convex Optimization David Rosenberg New York University February 11, 2015 David Rosenberg (New York University) DS-GA 1003 February 11, 2015 1 / 24 Introduction Why Convex Optimization?
More informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationSensitivity Analysis and Duality
Sensitivity Analysis and Duality Part II Duality Based on Chapter 6 Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationNP-Complete Problems. More reductions
NP-Complete Problems More reductions Definitions P: problems that can be solved in polynomial time (typically in n, size of input) on a deterministic Turing machine Any normal computer simulates a DTM
More informationLecture 5 January 16, 2013
UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationLocal Search Based Approximation Algorithms. Vinayaka Pandit. IBM India Research Laboratory
Local Search Based Approximation Algorithms The k-median problem Vinayaka Pandit IBM India Research Laboratory joint work with Naveen Garg, Rohit Khandekar, and Vijay Arya The 2011 School on Approximability,
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More information4. The Dual Simplex Method
4. The Dual Simplex Method Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 4 p.1/34 Basic Idea (1) Algorithm as explained so far known
More informationAlgorithmic Game Theory and Applications. Lecture 7: The LP Duality Theorem
Algorithmic Game Theory and Applications Lecture 7: The LP Duality Theorem Kousha Etessami recall LP s in Primal Form 1 Maximize c 1 x 1 + c 2 x 2 +... + c n x n a 1,1 x 1 + a 1,2 x 2 +... + a 1,n x n
More informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationToday: Linear Programming (con t.)
Today: Linear Programming (con t.) COSC 581, Algorithms April 10, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 29.4 Reading assignment for
More information