In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems.


 Prosper McCormick
 1 years ago
 Views:
Transcription
1 2 Basics In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems. 2.1 Notation Let A R m n be a matrix with row index set M = {1,...,m} and column index set N = {1,...,n}. Wewrite A =(a ij ),...,m j=1,...,n a 1j. : jth column of A a mj A,j = For subsets I M and J N we denote by A i, =(a i1,...,a n1 ):ith row of A. A I,J := (a ij ) i I j J the submatrix of A formed by the corresponding indices. We also set A,J := A M,J A I, := A I,N. For a subset X R n we denote by lin(x):={x = the linear hull of X. λ i v i : λ i R and v 1,...,v k X}
2 10 Basics 2.2 Convex Hulls Definition 2.1 (Convex Hull) Given a set X R n,theconvex hull of X, denotedbyconv(x) is defined to be the set of all convex combinations of vectors from X, thatis, conv(x):={x = λ i v i : λ i 0, λ i = 1 and v 1,...,v k X} Suppose that X R n is some set, for instance X is the set of incidence vectors of all spanning trees of a given graph (cf. Example 1.8). Suppose that we wish to find a vector x X maximizing c T x. If x = k λ iv i conv(x) is a convex combination of the vectors v 1,...,v k,then Hence, we have that for any set X R n. c T x = λ i c T v i max{c T v i : i = 1,...,k}. max{c T x : x X} = max{c T x : x conv(x)} Observation 2.2 Let X R n be any set and c R n be any vector. Then max{c T x : x X} = max{c T x : x conv(x)}. (2.1) Proof: See above. Observation 2.2 may seem of little use, since we have replaced adiscretefiniteproblem (left hand side of (2.1) by a continuous one (right hand side of (2.1)). However,inmany cases conv(x) has a nice structure that we can exploit in order to solve the problem. It turns out that most of the time conv(x) is a polyhedron {x : Ax b} (see Section 2.3) and that the problem max{c T x : x conv(x)} is a Linear Program. Example 2.3 We return to the IP given in Example 1.2: max x + y x,y Z We have already noted that the set X of feasible solutions for the IP is X = {(1,1),(2,1),(3,1),(1,2),(2,2),(3,2),(2,3)}. Observe that the constraint y 3isactuallysuperfluous,butthatisnotourmainconcern right now. What is more important is the fact that we obtain thesamefeasiblesetifweadd
3 2.2 Convex Hulls Figure 2.1: The addition of a the new constraint x y 1 (shownastheredline)leads to the same set feasible set. the constraint x y 1 asshowninfigure2.1.moreover,wehavethattheconvexhull conv(x) of all feasible solutions for the IP is described by the following inequalities: x + y 1 Observation 2.2 now implies that instead of solving the original IP we can also solve the Linear Program max x + y x + y 1 that is, a standard Linear Program without integrality constraints. In the above example we reduced the solution of an IP to solvingastandardlinearprogram. We will see later that in principle this reduction is always possible (provided the data of the IP is rational). However, there is a catch! The mentioned reduction might lead to an exponential increase in the problem size. Sometimes we might still overcomethis problem (see Section 5.4).
4 12 Basics 2.3 Polyhedra and Formulations Definition 2.4 (Polyhedron, polytope) A polyhedron is a subset of R n described by a finite set of linear inequalities, that is, a polyhedron is of the form P(A,b):={x R n : Ax b}, (2.2) where A is an m nmatrix and b R m is a vector. The polyhedron P is a rational polyhedron if A and b can be chosen to be rational. A bounded polyhedron is called polytope. In Section 1.3 we have seen a number of examples of Integer Linear Programs and we have spoken rather informally of a formulation of a problem. We now formalize the term formulation: Definition 2.5 (Formulation) ApolyhedronP R n is a formulation for a set X Z p R n p,ifx = P (Z p R n p ). It is clear, that in general there is an infinite number of formulations for a set X. This naturally raises the question about good and not so good formulations. We start with an easy example which provides the intuition howtojudgeformulations. Consider again the set X = {(1,1),(2,1),(3,1),(1,2),(2,2),(3,2),(2,3)} R 2 from Examples 1.2 and 2.3. Figure 2.2 shows our known two formulations P 1 and P 2 together with a third one P 3. ( ) x P 1 = : y ( ) x P 2 = : y x + y 1 Intuitively, we would rate P 2 much higher than P 1 or P 3.Infact,P 2 is an ideal formulation since, as we have seen in Example 2.3 we can simply solve a Linear Program over P 2,the optimal solution will be an extreme point which is a point from X. Definition 2.6 (Better and ideal formulations) Given a set X R n and two formulations P 1 and P 2 for X,wesaythatP 1 is better than P 2, if P 1 P 2. AformulationP for X is called ideal,ifp = conv(x). We will see later that the above definition is one of the keys to solving IPs. Example 2.7 In Example 1.7 we have seen two possibilities to formulate the UncapacitatedFacility Location Problem (UFL): m m n m m n min f j y j + c ij x ij min f j y j + c ij x ij j=1 j=1 j=1 j=1 x P 1 x P 2 x B nm,y B m x B nm,y B m,
5 2.4 Cones Figure 2.2: Different formulations for the integral set X = {(1,1),(2,1),(3,1),(1,2),(2,2),(3,2),(2,3)} where {( ) x P 1 = : y {( ) x P 2 = : y m j=1 x ij = 1 fori = 1,...,n x ij y j for i = 1,...,n and j = 1,...,m m j=1 x } ij = 1 fori = 1,...,n n x ij ny j for j = 1,...,m } We claim that P 1 is a better formulation than P 2.Ifx P 1,thenx ij y j for all i and j. Summing these constraints over i gives us n x ij ny j,sox P 2. Hence we have P 1 P 2.WenowshowthatP 1 P 2 thus proving that P 1 is a better formulation. We assume for simplicity that n/m = k is an integer. The argument can be extended to the case that m does not divide n by some technicalities. We partition the clients into m groups, each of which contains exactly k clients. The first group will be served by a (fractional) facility at y 1,thesecondgroupbya(fractional)facilityaty 2 and so on. More precisely, we set x ij = 1fori = k(j 1)+1,...,k(j 1)+k and j = 1,...,m and x ij = 0otherwise.Wealsosety j = k/n for j = 1,...,m. Fix j. Byconstruction n x ij = k = n n k = ny j.hence,thepoint(x,y) just constructed is contained in P 2.Ontheotherhand,(x,y) / P Cones Definition 2.8 (Cone, polyhedral cone) AnonemptysetC R n is called a (convex) cone, ifforallx,y C and all λ,µ 0 we have: λx + µy C. Aconeiscalledpolyhedral,ifthereexistsamatrixA such that C = {x : Ax 0}.
6 14 Basics Thus, cones are also polyhedra, albeit special ones. We will see that they play an important role in the representation of polyhedra. Suppose that we have a set S R n Then, the set cone(s):={λ 1 x λ k x k : x i S,λ i 0fori = 1,...,k} is obviously a cone. We call this the cone generated by S. It is easy to see that this is the smallest cone containing S. 2.5 Linear Programming We briefly recall the following fundamental results from Linear Programming which we will use in these notes. For proofs, we refer to standard booksaboutlinearprogramming such as [Sch86, Chv83]. Theorem 2.9 (Duality Theorem of Linear Programming) Let A be an m nmatrix, b R m and c R n.definethepolyhedrap = {x : Ax b} and Q = { y : A T y = c,y 0 }. (i) If x P and y Q then c T x b T y. (weak duality) (ii) In fact, we have max{c T x : x P } = min{b T y : y Q}, (2.3) provided that both sets P and Q are nonempty. (strong duality) Theorem 2.10 (Complementary Slackness Theorem) Let x be a feasible solution of max{c T x : Ax b} and y be a feasible solution of min{b T y : A T y = c,y 0}. Then x and y are optimal solutions for the maximization problem and minimization problem, respectively, if and only if they satisfy the complementary slackness conditions: for each i = 1,...,m,eithery i = 0 or A i, x i = b i. (2.4) Theorem 2.11 (Farkas Lemma) The set {x : Ax = b,x 0} is nonempty if and only if there is no vector y such that A T y 0 and b T y< Agenda These lecture notes are consist of two main parts. The goals ofpartiareasfollows: (i) Prove that for any rational polyhedron P(A,b) ={x : Ax b} and X = P Z n the set conv(x) is again a rational polyhedron. (ii) Use the fact max { c T x : x X } = max { c T x : x conv(x) } (see Observation 2.2) and (i) to show that the latter problem can be solved by means of LinearProgramming by showing that an optimum solution will always be found at an extreme point of the polyhedron conv(x) (which we show to be a point in X). (iii) Give tools to derive good formulations.
Mathematical 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 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 informationInteger Programming Theory
Integer Programming Theory Laura Galli October 17, 2017 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 informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.14.5, 4.8, 5.15.5, 6.16.3 Material
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More 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 informationLecture 4: Rational IPs, Polyhedron, Decomposition Theorem
IE 5: Integer Programming, Spring 29 24 Jan, 29 Lecture 4: Rational IPs, Polyhedron, Decomposition Theorem Lecturer: Karthik Chandrasekaran Scribe: Setareh Taki Disclaimer: These notes have not been subjected
More informationDiscrete Optimization 2010 Lecture 5 MinCost Flows & Total Unimodularity
Discrete Optimization 2010 Lecture 5 MinCost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 MinCost Flows
More informationOutline. Combinatorial Optimization 2. Finite Systems of Linear Inequalities. Finite Systems of Linear Inequalities. Theorem (Weyl s theorem :)
Outline Combinatorial Optimization 2 Rumen Andonov Irisa/Symbiose and University of Rennes 1 9 novembre 2009 Finite Systems of Linear Inequalities, variants of Farkas Lemma Duality theory in Linear Programming
More informationAMS : Combinatorial Optimization Homework Problems  Week V
AMS 553.766: Combinatorial Optimization Homework Problems  Week V For the following problems, A R m n will be m n matrices, and b R m. An affine subspace is the set of solutions to a a system of linear
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrapup: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S140425 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
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 information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
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 (LuenbergerYe Appendix B.1).........................
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More 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.12.6, 3.13.3, 3.5 Background material
More informationPolar Duality and Farkas Lemma
Lecture 3 Polar Duality and Farkas Lemma October 8th, 2004 Lecturer: Kamal Jain Notes: Daniel Lowd 3.1 Polytope = bounded polyhedron Last lecture, we were attempting to prove the MinkowskyWeyl Theorem:
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology Handout 3 18.433: Combinatorial Optimization February 8th, 2011 Michel X. Goemans 1. Lecture notes on bipartite matching Matching problems are among the fundamental
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, UrbanaChampaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, UrbanaChampaign 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 informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More information15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs
15.082J and 6.855J Lagrangian Relaxation 2 Algorithms Application to LPs 1 The Constrained Shortest Path Problem (1,10) 2 (1,1) 4 (2,3) (1,7) 1 (10,3) (1,2) (10,1) (5,7) 3 (12,3) 5 (2,2) 6 Find the shortest
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primaldual mincost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimumcost perfect matching
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 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 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 informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationLecture 3: Totally Unimodularity and Network Flows
Lecture 3: Totally Unimodularity and Network Flows (3 units) Outline Properties of Easy Problems Totally Unimodular Matrix Minimum Cost Network Flows Dijkstra Algorithm for Shortest Path Problem FordFulkerson
More informationCS522: Advanced Algorithms
Lecture 1 CS5: Advanced Algorithms October 4, 004 Lecturer: Kamal Jain Notes: Chris Re 1.1 Plan for the week Figure 1.1: Plan for the week The underlined tools, weak duality theorem and complimentary slackness,
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, UrbanaChampaign. Ruta (UIUC) CS473 1 Spring / 29
CS 473: Algorithms Ruta Mehta University of Illinois, UrbanaChampaign 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 informationMath 414 Lecture 2 Everyone have a laptop?
Math 44 Lecture 2 Everyone have a laptop? THEOREM. Let v,...,v k be k vectors in an ndimensional space and A = [v ;...; v k ] v,..., v k independent v,..., v k span the space v,..., v k a basis v,...,
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
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 informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets
EC 51 MATHEMATICAL METHODS FOR ECONOMICS Lecture : Convex Sets Murat YILMAZ Boğaziçi University In this section, we focus on convex sets, separating hyperplane theorems and Farkas Lemma. And as an application
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 informationDuality. Primal program P: Maximize n. Dual program D: Minimize m. j=1 c jx j subject to n. j=1. i=1 b iy i subject to m. i=1
Duality Primal program P: Maximize n j=1 c jx j subject to n a ij x j b i, i = 1, 2,..., m j=1 x j 0, j = 1, 2,..., n Dual program D: Minimize m i=1 b iy i subject to m a ij x j c j, j = 1, 2,..., n i=1
More informationDualfitting analysis of Greedy for Set Cover
Dualfitting analysis of Greedy for Set Cover We showed earlier that the greedy algorithm for set cover gives a H n approximation We will show that greedy produces a solution of cost at most H n OPT LP
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 informationORIE 6300 Mathematical Programming I September 2, Lecture 3
ORIE 6300 Mathematical Programming I September 2, 2014 Lecturer: David P. Williamson Lecture 3 Scribe: Divya Singhvi Last time we discussed how to take dual of an LP in two different ways. Today we will
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
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 informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationInteger Programming Chapter 9
Integer Programming Chapter 9 University of Chicago Booth School of Business Kipp Martin October 25, 2017 1 / 40 Outline Key Concepts MILP Set Monoids LP set Relaxation of MILP Set Formulation Quality
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal LatticeFree Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal LatticeFree Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
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 informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A 4 credit unit course Part of Theoretical Computer Science courses at the Laboratory of Mathematics There will be 4 hours
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 informationA miniintroduction to convexity
A miniintroduction to convexity Geir Dahl March 14, 2017 1 Introduction Convexity, or convex analysis, is an area of mathematics where one studies questions related to two basic objects, namely convex
More informationarxiv: v1 [math.co] 15 Dec 2009
ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.unilj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationConvexity: an introduction
Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and
More informationLecture 7. s.t. e = (u,v) E x u + x v 1 (2) v V x v 0 (3)
COMPSCI 632: Approximation Algorithms September 18, 2017 Lecturer: Debmalya Panigrahi Lecture 7 Scribe: Xiang Wang 1 Overview In this lecture, we will use PrimalDual method to design approximation algorithms
More informationLinear Programming. Larry Blume. Cornell University & The Santa Fe Institute & IHS
Linear Programming Larry Blume Cornell University & The Santa Fe Institute & IHS Linear Programs The general linear program is a constrained optimization problem where objectives and constraints are all
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2  LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September  06 October 2017 Ábrahám
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2  LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September  06 October 2017 Ábrahám
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 informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationLecture 10,11: General Matching Polytope, Maximum Flow. 1 Perfect Matching and Matching Polytope on General Graphs
CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 2009) Lecture 10,11: General Matching Polytope, Maximum Flow Lecturer: Mohammad R Salavatipour Date: Oct 6 and 8, 2009 Scriber: Mohammad
More 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 informationLinear Programming Motivation: The Diet Problem
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Network Flows & Applications NPcompleteness Now Linear Programming and the Simplex Method Hung Q. Ngo (SUNY at Buffalo) CSE 531 1
More informationPolytopes Course Notes
Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and VPolytopes.....................
More informationAdvanced Linear Programming. Organisation. Lecturers: Leen Stougie, CWI and Vrije Universiteit in Amsterdam
Advanced Linear Programming Organisation Lecturers: Leen Stougie, CWI and Vrije Universiteit in Amsterdam Email: stougie@cwi.nl Marjan van den Akker Universiteit Utrecht marjan@cs.uu.nl Advanced Linear
More informationDecision Aid Methodologies In Transportation Lecture 1: Polyhedra and Simplex method
Decision Aid Methodologies In Transportation Lecture 1: Polyhedra and Simplex method Chen Jiang Hang Transportation and Mobility Laboratory April 15, 2013 Chen Jiang Hang (Transportation and Mobility Decision
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 informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This writeup presents the main ideas involved. It is a slight update (mostly
More informationHeuristic Optimization Today: Linear Programming. Tobias Friedrich Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam
Heuristic Optimization Today: Linear Programming Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam Linear programming Let s first define it formally: A linear program is an optimization
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationLesson 17. Geometry and Algebra of Corner Points
SA305 Linear Programming Spring 2016 Asst. Prof. Nelson Uhan 0 Warm up Lesson 17. Geometry and Algebra of Corner Points Example 1. Consider the system of equations 3 + 7x 3 = 17 + 5 = 1 2 + 11x 3 = 24
More informationPolyhedral Computation Today s Topic: The Double Description Algorithm. Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010
Polyhedral Computation Today s Topic: The Double Description Algorithm Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010 1 Convexity Review: FarkasType Alternative Theorems Gale
More information2. Optimization problems 6
6 2.1 Examples... 7... 8 2.3 Convex sets and functions... 9 2.4 Convex optimization problems... 10 2.1 Examples 71 An (NP) optimization problem P 0 is defined as follows Each instance I P 0 has a feasibility
More informationShiqian Ma, MAT258A: Numerical Optimization 1. Chapter 2. Convex Optimization
Shiqian Ma, MAT258A: Numerical Optimization 1 Chapter 2 Convex Optimization Shiqian Ma, MAT258A: Numerical Optimization 2 2.1. Convex Optimization General optimization problem: min f 0 (x) s.t., f i
More informationLecture 4: Linear Programming
COMP36111: Advanced Algorithms I Lecture 4: Linear Programming Ian PrattHartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline The Linear Programming Problem Geometrical analysis The Simplex
More informationLecture 12: Feasible direction methods
Lecture 12 Lecture 12: Feasible direction methods Kin Cheong Sou December 2, 2013 TMA947 Lecture 12 Lecture 12: Feasible direction methods 1 / 1 Feasibledirection methods, I Intro Consider the problem
More informationC&O 355 Lecture 16. N. Harvey
C&O 355 Lecture 16 N. Harvey Topics Review of FourierMotzkin Elimination Linear Transformations of Polyhedra Convex Combinations Convex Hulls Polytopes & Convex Hulls FourierMotzkin Elimination Joseph
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I Instructor: Shaddin Dughmi Announcements Posted solutions to HW1 Today: Combinatorial problems
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 WeiTa Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationCS 435, 2018 Lecture 2, Date: 1 March 2018 Instructor: Nisheeth Vishnoi. Convex Programming and Efficiency
CS 435, 2018 Lecture 2, Date: 1 March 2018 Instructor: Nisheeth Vishnoi Convex Programming and Efficiency In this lecture, we formalize convex programming problem, discuss what it means to solve it efficiently
More informationNotes for Lecture 20
U.C. Berkeley CS170: Intro to CS Theory Handout N20 Professor Luca Trevisan November 13, 2001 Notes for Lecture 20 1 Duality As it turns out, the maxflow mincut theorem is a special case of a more general
More information1 Linear Programming. 1.1 Optimizion problems and convex polytopes 1 LINEAR PROGRAMMING
1 LINEAR PROGRAMMING 1 Linear Programming Now, we will talk a little bit about Linear Programming. We say that a problem is an instance of linear programming when it can be effectively expressed in the
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 information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NPcomplete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
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 informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More information12.1 Formulation of General Perfect Matching
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,
More informationApproximation Algorithms
Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang
More information3 NoWait Job Shops with Variable Processing Times
3 NoWait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical nowait job shop setting, we are given a set of processing times for each operation. We may select
More informationLecture 5: Properties of convex sets
Lecture 5: Properties of convex sets Rajat Mittal IIT Kanpur This week we will see properties of convex sets. These properties make convex sets special and are the reason why convex optimization problems
More informationLPModelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008
LPModelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following
More informationCS671 Parallel Programming in the ManyCore Era
1 CS671 Parallel Programming in the ManyCore Era Polyhedral Framework for Compilation: Polyhedral Model Representation, Data Dependence Analysis, Scheduling and Data Locality Optimizations December 3,
More informationProblem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 23 students that is, submit one homework with all of your names.
More information