Linear Programming- Manufacturing with
|
|
- Felicity Jordan
- 5 years ago
- Views:
Transcription
1 / 36
2 Casting process 2 / 36
3 The of Casting top facet ordinary facet Every ordinary facet f has a corresponding facet in the mold, which we denote by ˆf. castable object top facet 3 / 36
4 The of Casting 4 / 36 Question: Given an object P, can it be removed from its mold by a single translation? In other words, we want to decide whether a direction d exists such that P can be translated to infinity in direction d without intersecting the interior of the mold during the translation. Observation: Every ordinary facet f must move away from, or slide along, its corresponding facet ˆf of the mold.
5 The of Casting Angle between two vectors in 3d: The angle of the vectors is the smaller of the two angles measured in the plane determined by them. 5 / 36
6 Lemma 4.1 P can be removed from its mold in direction d if and only if d makes an angle of at least π/2 with the outward normal of all ordinary facets of P. f p d η( ˆf ) P 6 / 36
7 1-1 corresponding between direction and points z z = 1 x y 7 / 36
8 By Lemma 4.1 η = ( η x, η y, η z ): outward normal of an ordinary facet d = (d x, d y, 1): removal direction ( η, d) π/2 η. d 0 η x d x + η y d y + η z 0 This inequality describe a half-plane in the plane z = 1. 8 / 36
9 An object P is castable, for a fixed top facet the of half-planes is non-empty. If the is solvable in O(A) time, then the castability can be solved in O(An) time. We will solve the intersect5ion in O(n) expected time. Theorem 4.2: In O(n 2 ) expected time and using O(n) storage it can be decided whether a polyhydron with n facets is castable. 9 / 36
10 Problem: Note: Given a set H = {h 1, h 2,..., h n } of half-planes, find the of them. Given a set of n linear constraints in two variables, is there a point in the plane, find all points that satisfy all the constraints. For casting, we do not need to find the of half-planes. Here we consider a more general. 10 / 36
11 Observations: Since a half-plane is convex, the of half-planes is convex. Since the is convex, every half-plane bounding line can contribute at most one edge. A few examples of s of half-planes: (i) (ii) (iii) (iv) (v) 11 / 36
12 We give a rather straightforward divide-and-conquer algorithm to compute the of a set of n half-planes. It is based on a routine INTERSECTCON- VEXREGIONS to compute the convex polygonal regions. We Anfirst straightforward give the overalldivide-and-conquer algorithm. algorithm: the of n half-planes Algorithm INTERSECTHALFPLANES(H) Input. A set H of n half-planes in the plane. Output. The convex polygonal region C := h H h. 1. if card(h)=1 2. then C the unique half-plane h H 3. else Split H into sets H 1 and H 2 of size n/2 and n/2. 4. C 1 INTERSECTHALFPLANES(H 1 ) 5. C 2 INTERSECTHALFPLANES(H 2 ) 6. C INTERSECTCONVEXREGIONS(C 1,C 2 ) What remains is to describe the procedure INTERSECTCONVEXREGIONS. But Time wait didn t complexity: we see this before, in Chapter 2? Indeed, Corollary 2.7 states that we can { compute the polygons in O(nlogn + k logn) time, where O(1) n is the total number of vertices if n = in 1 T (n) = the two polygons. We must be a bit careful 2T in(n/2) applying + O(n this result log n) to our if, n > 1 because the regions we have can be unbounded, or degenerate to a segment or a point. Hence, T (n) the regions O(n log are 2 not n). necessarily polygons. But it is not difficult to modify the algorithm from Chapter 2 so that it still works. 12 / 36
13 We give a rather straightforward divide-and-conquer algorithm to compute the of a set of n half-planes. It is based on a routine INTERSECTCON- VEXREGIONS to compute the convex polygonal regions. We Anfirst straightforward give the overalldivide-and-conquer algorithm. algorithm: the of n half-planes Algorithm INTERSECTHALFPLANES(H) Input. A set H of n half-planes in the plane. Output. The convex polygonal region C := h H h. 1. if card(h)=1 2. then C the unique half-plane h H 3. else Split H into sets H 1 and H 2 of size n/2 and n/2. 4. C 1 INTERSECTHALFPLANES(H 1 ) 5. C 2 INTERSECTHALFPLANES(H 2 ) 6. C INTERSECTCONVEXREGIONS(C 1,C 2 ) What remains is to describe the procedure INTERSECTCONVEXREGIONS. But Time wait didn t complexity: we see this before, in Chapter 2? Indeed, Corollary 2.7 states that we can { compute the polygons in O(nlogn + k logn) time, where O(1) n is the total number of vertices if n = in 1 T (n) = the two polygons. We must be a bit careful 2T in(n/2) applying + O(n this result log n) to our if, n > 1 because the regions we have can be unbounded, or degenerate to a segment or a point. Hence, T (n) the regions O(n log are 2 not n). necessarily polygons. But it is not difficult to modify the algorithm from Chapter 2 so that it still works. 12 / 36
14 the of n half-planes Question: Can we compute the convex polygons in o(n log n) time? Answer: Yes, we can. v e 1 e2 13 / 36
15 the of n half-planes Question: Can we compute the convex polygons in o(n log n) time? Answer: Yes, we can. v e 1 e2 13 / 36
16 convex polygons h 3 h 2 h 1 right boundary h 4 h 5 left boundary L left (C) = h 3,h 4,h 5 L right (C) = h 2,h 1 14 / 36
17 convex polygons We use a plane sweep algorithm: Note: At most 4 line segments intersect the sweep line. left edge C2 left edge C1 C 2 C 1 right edge C1 = nil right edge C2 15 / 36
18 convex polygons At each event point some new edge e appears on the boundary. To handle the edge e: several cases: e belongs to C1 or to C2, and whether it is on the left or the right boundary. We consider the case when e is on the left boundary of C1. p: the upper endpoint of e. Three case (based on C): (1) the edge with p as upper endpoint, (2) the edge with e left_edge_c2 as upper endpoint, and (3) the edge with e right_edge_c2 as upper endpoint. 16 / 36
19 convex polygons It performs the following actions. (i) p (ii) p right edge C2 e right edge C2 e 17 / 36
20 convex polygons p e left edge C2 18 / 36
21 convex polygons Theorem 4.3 The convex polygonal regions in the plane can be computed in O(n) time. T (n) = T (n) O(n log n). Corollary 4.4 { O(1) if n = 1 2T (n/2) + O(n) if n > 1 The common of a set of n half-planes in the plane can be computed in O(n log n) time and linear storage. 19 / 36
22 convex polygons Theorem 4.3 The convex polygonal regions in the plane can be computed in O(n) time. T (n) = T (n) O(n log n). Corollary 4.4 { O(1) if n = 1 2T (n/2) + O(n) if n > 1 The common of a set of n half-planes in the plane can be computed in O(n log n) time and linear storage. 19 / 36
23 convex polygons Theorem 4.3 The convex polygonal regions in the plane can be computed in O(n) time. T (n) = T (n) O(n log n). Corollary 4.4 { O(1) if n = 1 2T (n/2) + O(n) if n > 1 The common of a set of n half-planes in the plane can be computed in O(n log n) time and linear storage. 19 / 36
24 convex polygons Theorem 4.3 The convex polygonal regions in the plane can be computed in O(n) time. T (n) = T (n) O(n log n). Corollary 4.4 { O(1) if n = 1 2T (n/2) + O(n) if n > 1 The common of a set of n half-planes in the plane can be computed in O(n log n) time and linear storage. 19 / 36
25 Incremental Previous Section: We computed the of n half-planes in O(n log n) time. The has Ω(n log n) lower bound. So, we cannot solve the casting faster in this way. Note that, for casting we only need to know if the is empty or not. In this section: An "expected" linear time algorithm presented to solve the using linear programming. 20 / 36
26 Incremental optimization : Maximize c 1 x 1 + c 2 x c d x d (objective function) Subject to a 1,1 x a 1,d x d b 1 a 2,1 x a 2,d x d b 2. a n,1 x a n,d x d b n (constraints) 21 / 36
27 Incremental optimization : Objective function: f(x 1,..., x d ) = c 1 x 1 + c 2 x c d x d = c. x. c = (c 1,..., c d ), x = (x 1,..., x d ). feasible region c solution 22 / 36
28 in R 2 LP in the plane: H: n half-plane or in other words n linear constraints f c (p): Objective function = c x p x + c y p y, c = (c x, c y ), p = (p x, p y ). Goal: find p R 2 s.t. p H and f c (p) is maximized. Cases: (i) (ii) ρ (iii) (iv) e v 23 / 36
29 in R 2 Unique Answer: solution 24 / 36
30 in R 2 Bound the feasible region: we add to half-plane to the set of half-planes { px M if c m 1 = x > 0 p x M Otherwise { py M if c m 2 = y > 0 p y M Otherwise Notations: (H, c): a linear program. H i = {m 1, m 2, h 1, h 2,..., h i }. C i = m 1 m 2 h 1 h 2 h i. Clearly C 0 C 1 C 2 C n = C. v i : the optimal solution for C i. If C i =, for some i, then the is infeasible ( is empty). 25 / 36
31 in R 2 Bound the feasible region: we add to half-plane to the set of half-planes { px M if c m 1 = x > 0 p x M Otherwise { py M if c m 2 = y > 0 p y M Otherwise Notations: (H, c): a linear program. H i = {m 1, m 2, h 1, h 2,..., h i }. C i = m 1 m 2 h 1 h 2 h i. Clearly C 0 C 1 C 2 C n = C. v i : the optimal solution for C i. If C i =, for some i, then the is infeasible ( is empty). 25 / 36
32 in R 2 incremental algorithm Lemma 4.5 We have (i) If v i 1 h i, then v i = v i 1. (ii) If v i 1 h i, then either C i = or v i l i, where l i is the line bounding h i. Proof. (i): Clear, since C i C i 1. (ii): q C i 1 v i v i 1 26 / 36
33 in R 2 incremental algorithm Lemma 4.5 We have (i) If v i 1 h i, then v i = v i 1. (ii) If v i 1 h i, then either C i = or v i l i, where l i is the line bounding h i. Proof. (i): Clear, since C i C i 1. (ii): q C i 1 v i v i 1 26 / 36
34 in R 2 incremental algorithm 27 / 36 (i) h 5 h 3 h 4 (ii) h 6 h 5 h 3 h 4 c v 4 = v 5 h 1 h 2 h 1 v 5 v 6 h 2
35 in R 2 incremental algorithm New Simpler : Find the point p on l i that maximizes f c (p), subject to the constraints p h, for h H i 1. Maximize f c (x) subject to x σ(h, l i ), h H i 1 and l i h is bounded to the left x σ(h, l i ), h H i 1 and l i h is bounded to the right x σ(h,l i ) h σ(h,l i ) l i 28 / 36
36 in R 2 incremental algorithm 1-dimensional linear program: Maximize f c (x) subject to x σ(h, l i ), h H i 1 and l i h is bounded to the left x σ(h, l i ), h H i 1 and l i h is bounded to the right x left = max {σ(h, l i ) : l i h is bounded to the left} h H i 1 x right = min {σ(h, l i ) : h H i 1 l i h is bounded to the right} Lemma 4.6 A 1-dimensional linear program can be solved in linear time. Hence, if case (ii) of Lemma 4.5 arises, then we can compute v i, in O(i) time. 29 / 36
37 in R 2 incremental algorithm 4 G 2DBOUNDEDLP Algorithm: 1. Let v 0 be the corner of C Let h 1,...,h n be the half-planes of H. 3. for i 1 to n 4. do if v i 1 h i 5. then v i v i 1 6. else v i the point p on l i that maximizes f c (p), subject to the constraints in H i if p does not exist 8. then Report that the linear program is infeasible and quit. 9. return v n We now analyze the performance of our algorithm. Lemma 4.7 Algorithm 2DBOUNDEDLP computes the solution to a bounded linear program with n constraints and two variables in O(n 2 ) time and linear storage. Lemma 4.7 Algorithm 2DBOUNDEDLP computes the solution to a bounded linear program with n constraints and two variables in O(n 2 ) time and linear storage. Proof. To prove that the algorithm correctly finds the solution, we have to show that after every stage whenever we have added a new half-plane h i the point v i is still the optimum point for C i. This follows immediately from Lemma / 36
38 in R 2 incremental algorithm 4 G 2DBOUNDEDLP Algorithm: 1. Let v 0 be the corner of C Let h 1,...,h n be the half-planes of H. 3. for i 1 to n 4. do if v i 1 h i 5. then v i v i 1 6. else v i the point p on l i that maximizes f c (p), subject to the constraints in H i if p does not exist 8. then Report that the linear program is infeasible and quit. 9. return v n We now analyze the performance of our algorithm. Lemma 4.7 Algorithm 2DBOUNDEDLP computes the solution to a bounded linear program with n constraints and two variables in O(n 2 ) time and linear storage. Lemma 4.7 Algorithm 2DBOUNDEDLP computes the solution to a bounded linear program with n constraints and two variables in O(n 2 ) time and linear storage. Proof. To prove that the algorithm correctly finds the solution, we have to show that after every stage whenever we have added a new half-plane h i the point v i is still the optimum point for C i. This follows immediately from Lemma / 36
39 in R 2 incremental algorithm A bad case: h 1 h 2 c v 2 v 3 v n v 5 v 4 h 5 h 3 h 4 h n 31 / 36
40 32 / 36 the of the half-planes yet. We now meet a quite intriguing phenomenon. in R 2 Although we have no way to Randomized determine an ordering of H that is guaranteed to lead to a good running time, we have a very simple way out of our. We simply pick a random ordering of H. Of course, we could have bad luck and pick an order that leads Randomized to a quadratic running algorithms time. But with some luck, we pick an order that makes it run much faster. Indeed, we shall prove below that most orders lead to a fast Use algorithm. randomness For completeness, to avoid we first bad repeat cases. the algorithm. Algorithm 2DRANDOMIZEDBOUNDEDLP(H, c,m 1,m 2 ) Input. A linear program (H {m 1,m 2 }, c), where H is a set of n half-planes, c R 2, and m 1, m 2 bound the solution. Output. If (H {m 1,m 2 }, c) is infeasible, then this fact is reported. Otherwise, the lexicographically smallest point p that maximizes f c (p) is reported. 1. Let v 0 be the corner of C Compute a random permutation h 1,...,h n of the half-planes by calling RANDOMPERMUTATION(H[1 n]). 3. for i 1 to n 4. do if v i 1 h i 5. then v i v i 1 6. else v i the point p on l i that maximizes f c (p), subject to the constraints in H i if p does not exist 8. then Report that the linear program is infeasible and quit. 9. return v n
41 in R 2 Lemma 4.8 The 2-dimensional linear programming with n constraints can be solved in O(n) randomized expected time using worst-case linear storage. Proof. X i = { 1 if vi 1 h i 0 otherwise Total time = n (O(i) X i ) i=1 ( n ) E(Total time) = E (O(i) X i ) = i=1 n (O(i) E(X i )). i=1 33 / 36
42 in R 2 Lemma 4.8 The 2-dimensional linear programming with n constraints can be solved in O(n) randomized expected time using worst-case linear storage. Proof. X i = { 1 if vi 1 h i 0 otherwise Total time = n (O(i) X i ) i=1 ( n ) E(Total time) = E (O(i) X i ) = i=1 n (O(i) E(X i )). i=1 33 / 36
43 in R 2 Lemma 4.8 The 2-dimensional linear programming with n constraints can be solved in O(n) randomized expected time using worst-case linear storage. Proof (Cont.). Any upper bound for E(x i )? E(X i ) = P r(v i 1 h i ) 2 (by backward analysis) i E(Total time) = n (O(i) E(X i )) i=1 n i=1 ( O(i) 2 ) O(n). i 34 / 36
44 in R 2 Lemma 4.8 The 2-dimensional linear programming with n constraints can be solved in O(n) randomized expected time using worst-case linear storage. Proof (Cont.). Any upper bound for E(x i )? E(X i ) = P r(v i 1 h i ) 2 (by backward analysis) i E(Total time) = n (O(i) E(X i )) i=1 n i=1 ( O(i) 2 ) O(n). i 34 / 36
45 in R 2 Lemma 4.8 The 2-dimensional linear programming with n constraints can be solved in O(n) randomized expected time using worst-case linear storage. Proof (Cont.). Any upper bound for E(x i )? E(X i ) = P r(v i 1 h i ) 2 (by backward analysis) i E(Total time) = n (O(i) E(X i )) i=1 n i=1 ( O(i) 2 ) O(n). i 34 / 36
46 in R 2 Backward Analysis: Why P r(v i 1 h i ) 2 i? c v n half-planes defining v n 35 / 36
47 in R 2 Backward Analysis: Why P r(v i 1 h i ) 2 i? c v n 35 / 36
48 36 / 36
49 36 / 36
4 Linear Programming. Manufacturing with Molds
4 Linear Programming Manufacturing with Molds Most objects we see around us today from car bodies to plastic cups and cutlery are made using some form of automated manufacturing. Computers play an important
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 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 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! 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 informationThree Dimensional Geometry. Linear Programming
Three Dimensional Geometry Linear Programming A plane is determined uniquely if any one of the following is known: The normal to the plane and its distance from the origin is given, i.e. equation of a
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 informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More informationVoronoi diagram and Delaunay triangulation
Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi
More informationIntroduction to optimization
Introduction to optimization G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Optimization Industrial
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 informationVoronoi diagrams Delaunay Triangulations. Pierre Alliez Inria
Voronoi diagrams Delaunay Triangulations Pierre Alliez Inria Voronoi Diagram Voronoi Diagram Voronoi Diagram The collection of the non-empty Voronoi regions and their faces, together with their incidence
More informationSAMPLING AND THE MOMENT TECHNIQUE. By Sveta Oksen
SAMPLING AND THE MOMENT TECHNIQUE By Sveta Oksen Overview - Vertical decomposition - Construction - Running time analysis - The bounded moments theorem - General settings - The sampling model - The exponential
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 informationStabbers of line segments in the plane
Stabbers of line segments in the plane M. Claverol D. Garijo C. I. Grima A. Márquez C. Seara August 3, 2010 Abstract The problem of computing a representation of the stabbing lines of a set S of segments
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 informationChapter 8. Voronoi Diagrams. 8.1 Post Oce Problem
Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest
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 informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More 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 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 informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
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 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 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 informationCOMPUTATIONAL GEOMETRY
Thursday, September 20, 2007 (Ming C. Lin) Review on Computational Geometry & Collision Detection for Convex Polytopes COMPUTATIONAL GEOMETRY (Refer to O'Rourke's and Dutch textbook ) 1. Extreme Points
More informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com 1.0 Introduction Linear programming
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationSublinear Time and Space Algorithms 2016B Lecture 7 Sublinear-Time Algorithms for Sparse Graphs
Sublinear Time and Space Algorithms 2016B Lecture 7 Sublinear-Time Algorithms for Sparse Graphs Robert Krauthgamer 1 Approximating Average Degree in a Graph Input: A graph represented (say) as the adjacency
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More information1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls
1/60 Geometric Algorithms Lecture 1: Introduction Convex Hulls Geometric algorithms scope 2/60 Geometry algorithms (practice): Study of geometric problems that arise in various applications and how algorithms
More informationLine Arrangement. Chapter 6
Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 1 Why LP? Linear programming (LP, also called linear
More informationColoring. Radhika Gupta. Problem 1. What is the chromatic number of the arc graph of a polygonal disc of N sides?
Coloring Radhika Gupta 1 Coloring of A N Let A N be the arc graph of a polygonal disc with N sides, N > 4 Problem 1 What is the chromatic number of the arc graph of a polygonal disc of N sides? Or we would
More informationComputational Geometry
Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
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 information9 Bounds for the Knapsack Problem (March 6)
9 Bounds for the Knapsack Problem (March 6) In this lecture, I ll develop both upper and lower bounds in the linear decision tree model for the following version of the (NP-complete) Knapsack 1 problem:
More informationMa/CS 6b Class 11: Kuratowski and Coloring
Ma/CS 6b Class 11: Kuratowski and Coloring By Adam Sheffer Kuratowski's Theorem Theorem. A graph is planar if and only if it does not have K 5 and K 3,3 as topological minors. We know that if a graph contains
More informationLine segment intersection. Family of intersection problems
CG Lecture 2 Line segment intersection Intersecting two line segments Line sweep algorithm Convex polygon intersection Boolean operations on polygons Subdivision overlay algorithm 1 Family of intersection
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 informationDelaunay Triangulations
Delaunay Triangulations (slides mostly by Glenn Eguchi) Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally approximate height of points not
More informationConnected Components of Underlying Graphs of Halving Lines
arxiv:1304.5658v1 [math.co] 20 Apr 2013 Connected Components of Underlying Graphs of Halving Lines Tanya Khovanova MIT November 5, 2018 Abstract Dai Yang MIT In this paper we discuss the connected components
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 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 informationCAD & Computational Geometry Course plan
Course plan Introduction Segment-Segment intersections Polygon Triangulation Intro to Voronoï Diagrams & Geometric Search Sweeping algorithm for Voronoï Diagrams 1 Voronoi Diagrams Voronoi Diagrams or
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
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 information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More 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 informationLine Arrangements. Applications
Computational Geometry Chapter 9 Line Arrangements 1 Line Arrangements Applications On the Agenda 2 1 Complexity of a Line Arrangement Given a set L of n lines in the plane, their arrangement A(L) is the
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 informationThe Farthest Point Delaunay Triangulation Minimizes Angles
The Farthest Point Delaunay Triangulation Minimizes Angles David Eppstein Department of Information and Computer Science UC Irvine, CA 92717 November 20, 1990 Abstract We show that the planar dual to the
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 informationIn this lecture, we ll look at applications of duality to three problems:
Lecture 7 Duality Applications (Part II) In this lecture, we ll look at applications of duality to three problems: 1. Finding maximum spanning trees (MST). We know that Kruskal s algorithm finds this,
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 informationRubber bands. Chapter Rubber band representation
Chapter 1 Rubber bands In the previous chapter, we already used the idea of looking at the graph geometrically, by placing its nodes on the line and replacing the edges by rubber bands. Since, however,
More informationSFU CMPT Lecture: Week 8
SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing
More informationLinear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra Haim Kaplan Natan Rubin Micha Sharir Abstract We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly
More information4 Integer Linear Programming (ILP)
TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )
The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationGeometric Algorithms. 1. Objects
Geometric Algorithms 1. Definitions 2. Line-Segment properties 3. Inner Points of polygons 4. Simple polygons 5. Convex hulls 6. Closest pair of points 7. Diameter of a point set 1. Objects 2-dimensional
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More information11 Linear Programming
11 Linear Programming 11.1 Definition and Importance The final topic in this course is Linear Programming. We say that a problem is an instance of linear programming when it can be effectively expressed
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 informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )
1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationCuts of the Hypercube
Cuts of the Hypercube Neil Calkin, Kevin James, J. Bowman Light, Rebecca Myers, Eric Riedl, Veronica July 3, 8 Abstract This paper approaches the hypercube slicing problem from a probabilistic perspective.
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationConvex Hulls in Three Dimensions. Polyhedra
Convex Hulls in Three Dimensions Polyhedra Polyhedron 1.A polyhedron is the generalization of a 2- D polygon to 3-D A finite number of flat polygonal faces The boundary or surface of a polyhedron - Zero-dimensional
More informationMathematics. Linear Programming
Mathematics Linear Programming Table of Content 1. Linear inequations. 2. Terms of Linear Programming. 3. Mathematical formulation of a linear programming problem. 4. Graphical solution of two variable
More informationPartitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces António Leslie Bajuelos 1, Ana Paula Tomás and Fábio Marques 3 1 Dept.
More informationLecture 16: Voronoi Diagrams and Fortune s Algorithm
contains q changes as a result of the ith insertion. Let P i denote this probability (where the probability is taken over random insertion orders, irrespective of the choice of q). Since q could fall through
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationComputational Geometry. HKU ACM ICPC Training 2010
Computational Geometry HKU ACM ICPC Training 2010 1 What is Computational Geometry? Deals with geometrical structures Points, lines, line segments, vectors, planes, etc. A relatively boring class of problems
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. 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 informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
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 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 informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More informationNew Directions in Linear Programming
New Directions in Linear Programming Robert Vanderbei November 5, 2001 INFORMS Miami Beach NOTE: This is a talk mostly on pedagogy. There will be some new results. It is not a talk on state-of-the-art
More informationAMATH 383 Lecture Notes Linear Programming
AMATH 8 Lecture Notes Linear Programming Jakob Kotas (jkotas@uw.edu) University of Washington February 4, 014 Based on lecture notes for IND E 51 by Zelda Zabinsky, available from http://courses.washington.edu/inde51/notesindex.htm.
More informationAPPROXIMATING THE MAXMIN AND MINMAX AREA TRIANGULATIONS USING ANGULAR CONSTRAINTS. J. Mark Keil, Tzvetalin S. Vassilev
Serdica J. Computing 4 00, 3 334 APPROXIMATING THE MAXMIN AND MINMAX AREA TRIANGULATIONS USING ANGULAR CONSTRAINTS J. Mark Keil, Tzvetalin S. Vassilev Abstract. We consider sets of points in the two-dimensional
More informationLecture 5: Duality Theory
Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane
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 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 informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 2. Linear Programs Barnabás Póczos & Ryan Tibshirani Please ask questions! Administrivia Lecture = 40 minutes part 1-5 minutes break 35 minutes part 2 Slides: http://www.stat.cmu.edu/~ryantibs/convexopt/
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 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
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 information4 Greedy Approximation for Set Cover
COMPSCI 532: Design and Analysis of Algorithms October 14, 2015 Lecturer: Debmalya Panigrahi Lecture 12 Scribe: Allen Xiao 1 Overview In this lecture, we introduce approximation algorithms and their analysis
More informationTopological properties of convex sets
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 5: Topological properties of convex sets 5.1 Interior and closure of convex sets Let
More informationOn the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane Rom Pinchasi August 2, 214 Abstract We prove the following isoperimetric inequality in R 2, conjectured by Glazyrin
More information