# The simplex method and the diameter of a 0-1 polytope

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 The simplex method and the diameter of a 0-1 polytope Tomonari Kitahara and Shinji Mizuno May 2012 Abstract We will derive two main results related to the primal simplex method for an LP on a 0-1 polytope. One of the results is that, for any 0-1 polytope and any two vertices of it, there exists an LP instance for which the simplex method finds a path between them, whose length is at most the dimension of the polytope. This proves a well-known result that the diameter of any 0-1 polytope is bounded by its dimension. Next we show that the upper bound obtained by the authors for the number of distinct solutions generated by the simplex method is tight by constructing an LP instance on a 0-1 polytope. Keywords: Linear programming; the number of solutions; the simplex method; 0-1 polytope. 1 Introduction The simplex method developed by Dantzig [1] could efficiently solve a real word linear programming problem (LP), but any good upper bound for the number of iterations has not been known yet. Kitahara and Mizuno [4] extend Ye s result [8] for the Markov decision problem and obtain an upper bound for the number of distinct solutions generated by the simplex method Graduate School of Decision Science and Technology, Tokyo Institute of Technology, W9-62, Oo-Okayama, Meguro-ku, Tokyo, , Japan. Tel.: , Fax: , Graduate School of Decision Science and Technology, Tokyo Institute of Technology, W9-58, Oo-Okayama, Meguro-ku, Tokyo, , Japan. Tel.: , Fax: , 1

2 with Dantzig s rule of pivoting for the standard form LP (P 0 ) min c T x, subject to Ax = b, x 0. Here A is an m n matrix, b R m, c R n, and x R n. The upper bound in [4] is expressed as nm γ ( P log m γ ) P, δ P δ P where δ P and γ P are the minimum and maximum values of all the positive elements of basic feasible solutions of (P 0 ). Kitahara and Mizuno [3] show that the upper bound is almost tight by using a variant of Klee-Minty s LP. Recently Kitahara and Mizuno [5] obtain a new upper bound m γ P γ D δ P δ D (1) for the number of distinct solutions generated by the primal simplex method with any rule, which chooses an entering variable whose reduced cost is negative at each iteration. Here δ D and γ D are the minimum and the maximum absolute values of all the negative elements of dual basic feasible solutions for primal feasible bases. These results are derived from the basic property of the primal simplex method that the objective function value strictly decreases whenever a solution is updated, even if the problem is degenerate. Note that the number of distinct solutions is not identical to the number of iterations when the problem is degenerate. In this paper, we treat an LP on a 0-1 polytope S 1 R d, which is a convex hull of 0-1 vectors in R d. Let x s and x t be any two vertices of S 1. By using the basic property of the primal simplex method, we will show that there exists an LP instance, for which the simplex method finds a path between x s and x t whose length is at most d. This proves a well-known result by Naddef [6] that the diameter of any 0-1 polytope in R d is bounded by the dimension d. We also show that the upper bound (1) is tight in the sense that there exists an LP instance on a 0-1 polytope, for which the simplex method generates exactly m γ P γ D δ P distinct solutions. δ D 2

3 2 The simplex method for an LP on a 0-1 polytope In this section, we treat the following LP (P 1 ) min c T x, subject to x S, where S R d is a polytope, c R d is a constant vector, and x R d is a vector of variables. Let x 0 be a vertex of S. For solving the problem (P 1 ), we use the primal simplex method from the initial vertex x 0 with any rule, which chooses an entering variable whose reduced cost is negative at each iteration. The simplex method actually solves a standard form LP, which is equivalent to (P 1 ), and generates a sequence of its basic feasible solutions. In this section, we identify a vertex of S with a basic feasible solution of the standard form LP. The next lemma states a basic property of the simplex method, which is proved in Kitahara and Mizuno [5] for example. Lemma 1 The objective function value decreases whenever a basic feasible solution is updated by the primal simplex method with any rule, which chooses an entering variable whose reduced cost is negative at each iteration. Note that if the problem is degenerate, a basic feasible solution may not be updated when a basis is updated by the simplex method. Let M(P 1 ) be the maximum difference of objective function values between two vertices of S and L(P 1 ) be the minimum positive difference of objective function values between two adjacent vertices of S. Here two vertices are called adjacent when the segment connecting them is an edge of S. Since the objective function value decreases by at least L(P 1 ) whenever a vertex is updated from Lemma 1, the number of distinct vertices generated by the primal simplex method for solving (P 1 ) is bounded by Using this upper bound, we obtain the next theorem. M(P 1 ) L(P 1 ). (2) Theorem 1 Let S 1 R d be any 0-1 polytope and let c be any d-dimensional integral vector. Then the primal simplex method for solving the LP (P 2 ) min c T x, subject to x S 1 starting from any vertex of S 1 generates at most C distinct vertices, where C = d i=1 c i. 3

4 Proof: Since any vertex of S 1 is a 0-1 vector, the difference of objective function values between two vertices of S 1 is bounded by d i=1 c i, that is, M(P 2 ) C. The objective function value at any vertex is an integer, because the vector c is integral. So the minimum positive difference of objective function values between two adjacent vertices is at least one, that is, L(P 2 ) 1. Hence the number of distinct vertices generated by the primal simplex method starting from any initial vertex is bounded by C from (2). A finite sequence {x k k = 0, 1, 2,..., l} of vertices of S 1 is called a path of the length l on S 1, if any two consecutive vertices x k and x k+1 are adjacent. A sequence of distinct vertices generated by the simplex method is a path. We obtain the next result for the length of a path between two vertices on a 0-1 polytope. Theorem 2 Let S 1 R d be any 0-1 polytope and x s and x t be any two vertices of S 1. Then there exists an LP instance, for which the simplex method with Bland s rule [2] (or any anticycling rule) finds a path between x s and x t whose length is at most d. Proof: Let x t = (x t 1, x t 2,..., x t d )T. We define a vector c = (c 1, c 2,..., c d ) T by { 1 if x t c i = i = 1, 1 if x t i = 0. Obviously x t is the unique optimal vertex of (P 2 ). The simplex method starting from x s with Bland s rule always finds the optimal vertex x t in a finite number of iterations. Then the number of distinct vertices generated by the simplex method is at most C = d c i = d i=1 from Theorem 1. Hence the simplex method finds a path between x s and x t whose length is at most d. The diameter of a polytope is the maximum length of the shortest paths between its two vertices. From the theorem above, we can easily obtain a well-known result by Naddef [6] for the diameter of any 0-1 polytope. 4

5 Corollary 1 The diameter of any 0-1 polytope in R d is at most d. By using this result, Naddef [6] shows that the Hirsch conjecture is true for 0-1 polytopes, although Santos [7] recently constructs a counterexample of the conjecture for general polytopes. 3 Tightness of the upper bound by Kitahara and Mizuno Recall that the standard form LP is expressed as (P 0 ) min c T x, subject to Ax = b, x 0. Let x 0 be a basic feasible solution of the problem (P 0 ). For solving the problem (P 0 ) from the initial basic feasible solution x 0, we use the primal simplex method with any rule, which chooses an entering variable whose reduced cost is negative at each iteration. Then the objective function value decreases whenever an iterate is updated. Kitahara and Mizuno [5] show that the maximum difference of objective function values between two basic feasible solutions of (P 0 ) is bounded by mγ P γ D and that the minimum positive difference of objective function values between two adjacent basic feasible solutions of (P 0 ) is at least δ P δ D, that is, M(P 0 ) mγ P γ D and L(P 0 ) δ P δ D. Hence the ratio (2) is bounded by (1) which is an upper bound derived in [5] for the number of distinct solutions generated by the primal simplex method. We show that the upper bound is tight in the next theorem. Theorem 3 The upper bound (1) is tight in the sense that there exists an LP instance on a 0-1 polytope for which the primal simplex method generates exactly m γ P γ D δ P distinct solutions. δ D Proof: We define an LP instance on the m-dimensional cube or its standard form LP min e T x, subject to x e, x 0 (P 3 ) min e T x, subject to x + u = e, x 0, u 0, 5

6 where x = (x 1, x 2,..., x m ) T is a vector of variables, u = (u 1, u 2,..., u m ) T is a vector of slacks, and e = (1, 1,..., 1) T. The dual problem of (P 3 ) is (D 3 ) max e T y, subject to y e, y 0, where y = (y 1, y 2,..., m) T is a vector of dual variables. It is easy to see that for any subset K {1, 2,..., m} the point (x K, u K ) defined by x K i = 1, u K i = 0 for any i K, x K i = 0, u K i = 1 for any i / K, x K = (x K 1, x K 2,..., x K m) T (3), u K = (u K 1, u K 2,..., u K m) T is a basic feasible solution of (P 3 ) and conversely any basic feasible solution is expressed as (3) for some K {1, 2,..., n}. Thus the feasible region of the problem (P 3 ) is a 0-1 polytope and we have that δ P = 1 and γ P = 1, where δ P and γ P are the minimum and maximum values of all the positive elements of basic feasible solutions of (P 3 ). Similarly for any subset K {1, 2,..., m} the point y K defined by y K i = 1 for any i K, y K i = 0 for any i / K, y K = (y K 1, y K 2,..., y K m) T is a basic solution of (D 3 ) and any basic solution is expressed as above. Hence δ D = 1 and γ D = 1, where δ D and γ D are the minimum and the maximum absolute values of all the negative elements of basic feasible solutions of (D 3 ) for primal feasible bases. Note that the dual basic solution y K is feasible only when K = {1, 2,..., n}. So the optimal solution of (P 3 ) is Suppose that the initial solution is x = (1, 1,..., 1) T, u = (0, 0,..., 0) T. x 0 = (0, 0,..., 0) T, u 0 = (1, 1,..., 1) T. 6

7 Since the feasible region of (P 3 ) is the m-dimensional cube, the length of the shortest path between (x 0, u 0 ) and (x, u ) is m. So the primal simplex method starting from the initial solution (x 0, u 0 ) finds the optimal solution (x, u ) by generating at least m distinct solutions. On the other hand, the number of distinct solutions generated is at most m γ P γ D δ P, which is equal δ D to m. Hence the primal simplex method generates exactly m γ P γ D δ P distinct δ D solutions. Acknowledgment This research is supported in part by Grant-in-Aid for Young Scientists (B) and Grant-in-Aid for Science Research (A) of Japan Society for the Promotion of Science. References [1] G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, [2] R. G. Bland, New finite pivoting rules for the simplex method, Mathematics of Operations Research 2 (1977) [3] T. Kitahara and S. Mizuno, Klee-Minty s LP and Upper Bounds for Dantzig s Simplex Method, Operations Research Letters 39 (2011) [4] T. Kitahara and S. Mizuno, A Bound for the Number of Different Basic Solutions Generated by the Simplex Method, To appear in Mathematical Programming. [5] T. Kitahara and S. Mizuno, An Upper Bound for the Number of Different Solutions Generated by the Primal Simplex Method with Any Selection Rule of Entering Variables, To appear in Asia-Pacific Journal of Operational Research. [6] D. Naddef, The Hirsch Conjecture is True for (0,1)-Polytopes, Mathematical Programming 45 (1989) [7] F. Santos, A counterexample to the Hirsch conjecture, Technical paper, available at

8 [8] Y. Ye, The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate, Mathematics of Operations Research 36 (2011)

### The Simplex Algorithm

The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

### Section 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

### Linear 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

### MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of

### Lecture 16 October 23, 2014

CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 16 October 23, 2014 Scribe: Colin Lu 1 Overview In the last lecture we explored the simplex algorithm for solving linear programs. While

### Math 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).........................

### Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows

### Convex Optimization CMU-10725

Convex Optimization CMU-10725 Ellipsoid Methods Barnabás Póczos & Ryan Tibshirani Outline Linear programs Simplex algorithm Running time: Polynomial or Exponential? Cutting planes & Ellipsoid methods for

### Algorithmic Game Theory and Applications. Lecture 6: The Simplex Algorithm

Algorithmic Game Theory and Applications Lecture 6: The Simplex Algorithm Kousha Etessami Recall our example 1 x + y

### On the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes

On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,

### J Linear Programming Algorithms

Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.]

### arxiv: v1 [math.co] 27 Feb 2015

Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,

### Recap, and outline of Lecture 18

Recap, and outline of Lecture 18 Previously Applications of duality: Farkas lemma (example of theorems of alternative) A geometric view of duality Degeneracy and multiple solutions: a duality connection

### 6. 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

### 5. Consider the tree solution for a minimum cost network flow problem shown in Figure 5.

FIGURE 1. Data for a network flow problem. As usual the numbers above the nodes are supplies (negative values represent demands) and numbers shown above the arcs are unit shipping costs. The darkened arcs

### Graphs that have the feasible bases of a given linear

Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700

### CSc 545 Lecture topic: The Criss-Cross method of Linear Programming

CSc 545 Lecture topic: The Criss-Cross method of Linear Programming Wanda B. Boyer University of Victoria November 21, 2012 Presentation Outline 1 Outline 2 3 4 Please note: I would be extremely grateful

### An FPTAS for minimizing the product of two non-negative linear cost functions

Math. Program., Ser. A DOI 10.1007/s10107-009-0287-4 SHORT COMMUNICATION An FPTAS for minimizing the product of two non-negative linear cost functions Vineet Goyal Latife Genc-Kaya R. Ravi Received: 2

### Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

### / 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

Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible

### Mathematical 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

### Repetition: Primal Dual for Set Cover

Repetition: Primal Dual for Set Cover Primal Relaxation: k min i=1 w ix i s.t. u U i:u S i x i 1 i {1,..., k} x i 0 Dual Formulation: max u U y u s.t. i {1,..., k} u:u S i y u w i y u 0 Harald Räcke 428

### Linear 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

### Interval-Vector Polytopes

Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract

### Approximation 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

### 3 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

### Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality

### 5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY

5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves

### 16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

### AM 121: Intro to Optimization Models and Methods Fall 2017

AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries

### be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that

( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices

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

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}

### arxiv: v1 [math.co] 12 Dec 2017

arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing

### Non-zero disjoint cycles in highly connected group labelled graphs

Non-zero disjoint cycles in highly connected group labelled graphs Ken-ichi Kawarabayashi Paul Wollan Abstract Let G = (V, E) be an oriented graph whose edges are labelled by the elements of a group Γ.

### Problem 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 2-3 students that is, submit one homework with all of your names.

### MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

### Introduction 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

### (67686) Mathematical Foundations of AI July 30, Lecture 11

(67686) Mathematical Foundations of AI July 30, 2008 Lecturer: Ariel D. Procaccia Lecture 11 Scribe: Michael Zuckerman and Na ama Zohary 1 Cooperative Games N = {1,...,n} is the set of players (agents).

### The Fibonacci hypercube

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven

### 9.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

### A Comparative study on Algorithms for Shortest-Route Problem and Some Extensions

International Journal of Basic & Applied Sciences IJBAS-IJENS Vol: No: 0 A Comparative study on Algorithms for Shortest-Route Problem and Some Extensions Sohana Jahan, Md. Sazib Hasan Abstract-- The shortest-route

### Bilinear Programming

Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu

### A List Heuristic for Vertex Cover

A List Heuristic for Vertex Cover Happy Birthday Vasek! David Avis McGill University Tomokazu Imamura Kyoto University Operations Research Letters (to appear) Online: http://cgm.cs.mcgill.ca/ avis revised:

### Line Graphs and Circulants

Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),

### Lecture 9: Linear Programming

Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative

### Isometric Cycles, Cutsets, and Crowning of Bridged Graphs

Isometric Cycles, Cutsets, and Crowning of Bridged Graphs Tao Jiang, 1 Seog-Jin Kim, 2 and Douglas B. West 3 1 DEPARTMENT OF MATHEMATICS AND STATISTICS MIAMI UNIVERSITY OXFORD, OHIO 45056 E-mail: jiangt@muohio.edu

### COVERING POINTS WITH AXIS PARALLEL LINES. KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009

COVERING POINTS WITH AXIS PARALLEL LINES KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge

### Lecture 12 March 4th

Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 12 March 4th Lecturer: Lior Pachter Scribe/ Editor: Wenjing Zheng/ Shaowei Lin 12.1 Alignment Polytopes Recall that the alignment

### Convex 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/

### Numerical 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

### Approximation Algorithms: The Primal-Dual Method. My T. Thai

Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the

### On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes Hans Raj Tiwary hansraj@cs.uni-sb.de FR Informatik Universität des Saarlandes D-66123 Saarbrücken, Germany Tel: +49 681 3023235

### COUNTING THE NUMBER OF WINNING BINARY STRINGS IN THE 1-DIMENSIONAL SAME GAME. Department of Mathematics Oberlin College Oberlin OH 44074

COUNTING THE NUMBER OF WINNING BINARY STRINGS IN THE 1-DIMENSIONAL SAME GAME CHRIS BURNS AND BENJAMIN PURCELL Department of Mathematics Oberlin College Oberlin OH 44074 Abstract. Ralf Stephan recently

### OPERATIONS 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

### Lecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching. 1 Primal/Dual Algorithm for weighted matchings in Bipartite Graphs

CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 009) Lecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching Lecturer: Mohammad R. Salavatipour Date: Sept 15 and 17, 009

### Complexity Results on Graphs with Few Cliques

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School

### FACES OF CONVEX SETS

FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.

### A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM. 1.

ACTA MATHEMATICA VIETNAMICA Volume 21, Number 1, 1996, pp. 59 67 59 A PARAMETRIC SIMPLEX METHOD FOR OPTIMIZING A LINEAR FUNCTION OVER THE EFFICIENT SET OF A BICRITERIA LINEAR PROBLEM NGUYEN DINH DAN AND

### Steiner Trees and Forests

Massachusetts Institute of Technology Lecturer: Adriana Lopez 18.434: Seminar in Theoretical Computer Science March 7, 2006 Steiner Trees and Forests 1 Steiner Tree Problem Given an undirected graph G

### STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA

Communications in Algebra, 34: 1049 1053, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500442005 STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M.

### Introductory Operations Research

Introductory Operations Research Theory and Applications Bearbeitet von Harvir Singh Kasana, Krishna Dev Kumar 1. Auflage 2004. Buch. XI, 581 S. Hardcover ISBN 978 3 540 40138 4 Format (B x L): 15,5 x

### Linear Programming and Integer Linear Programming

Linear Programming and Integer Linear Programming Kurt Mehlhorn May 26, 2013 revised, May 20, 2014 1 Introduction 2 2 History 3 3 Expressiveness 3 4 Duality 4 5 Algorithms 8 5.1 Fourier-Motzkin Elimination............................

### CS369G: Algorithmic Techniques for Big Data Spring

CS369G: Algorithmic Techniques for Big Data Spring 2015-2016 Lecture 11: l 0 -Sampling and Introduction to Graph Streaming Prof. Moses Charikar Scribe: Austin Benson 1 Overview We present and analyze the

### 16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making Lecture 16: Mathematical Programming I Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 8, 2010 E. Frazzoli

### Coverings and Matchings in r-partite Hypergraphs

Coverings and Matchings in r-partite Hypergraphs Douglas S. Altner Department of Mathematics, United States Naval Academy, Annapolis, Maryland, altner@usna.edu. J. Paul Brooks Department of Statistical

### Reverse Search for Parametric Linear Programming

Reverse Search for Parametric Linear Programg Colin N. Jones Automatic Control Laboratory Swiss Federal Institute of Technology Physikstrasse 3, CH-8092 Zurich Switzerland colin.jones@cantab.net Jan M.

### VARIANTS OF THE SIMPLEX METHOD

C H A P T E R 6 VARIANTS OF THE SIMPLEX METHOD By a variant of the Simplex Method (in this chapter) we mean an algorithm consisting of a sequence of pivot steps in the primal system using alternative rules

### 11.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

### Finding Strongly Connected Components

Yufei Tao ITEE University of Queensland We just can t get enough of the beautiful algorithm of DFS! In this lecture, we will use it to solve a problem finding strongly connected components that seems to

### arxiv: v1 [math.co] 28 Nov 2007

LATTICE OINTS IN MINKOWSKI SUMS CHRISTIAN HAASE, BENJAMIN NILL, ANDREAS AFFENHOLZ, AND FRANCISCO SANTOS arxiv:0711.4393v1 [math.co] 28 Nov 2007 ABSTRACT. Fakhruddin has proved that for two lattice polygons

### Pivot Rules for Linear Programming: A Survey on Recent Theoretical Developments

Pivot Rules for Linear Programming: A Survey on Recent Theoretical Developments T. Terlaky and S. Zhang November 1991 1 Address of the authors: Tamás Terlaky 1 Faculty of Technical Mathematics and Computer

### SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING

ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING

### Two Upper Bounds for the Erdős Szekeres Number with Conditions

Discrete Comput Geom (2013) 49:183 188 DOI 10.1007/s00454-012-9474-9 Two Upper Bounds for the Erdős Szekeres Number with Conditions Florian Strunk Received: 8 July 2011 / Revised: 2 July 2012 / Accepted:

### Algebraic-Geometric ideas in Discrete Optimization (Universidad de Sevilla, 2014)

Algebraic-Geometric ideas in Discrete Optimization (Universidad de Sevilla, 2014) Jesús A. De Loera, UC Davis Lectures based on the book: Algebraic & Geometric Ideas in the Theory of Discrete Optimization

### Bernd Gärtner Institut für Informatik Freie Universität Berlin. Günter M. Ziegler Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Randomized simplex algorithms on Klee-Minty cubes Bernd Gärtner Institut für Informatik Freie Universität Berlin Abstract We investigate the behavior of randomized simplex algorithms on special linear

### Outer-2-independent domination in graphs

Proc. Indian Acad. Sci. (Math. Sci.) Vol. 126, No. 1, February 2016, pp. 11 20. c Indian Academy of Sciences Outer-2-independent domination in graphs MARCIN KRZYWKOWSKI 1,2,, DOOST ALI MOJDEH 3 and MARYEM

### COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748

COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/cot6936_s12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id=174

### CS261: Problem Set #2

CS261: Problem Set #2 Due by 11:59 PM on Tuesday, February 9, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:

### THE HIRSCH CONJECTURE FOR DUAL TRANSPORTATION POLYHEDPA

NOT FOR QUOTATON WTHOUT PERMSSON OF THE AUTHOR THE HRSCH CONJECTURE FOR DUAL TRANSPORTATON POLYHEDPA M.L. Balinski FeSruary 983 CP- 8 3-9 CoZZaborative Papers report work which has not been performed solely

### Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem

Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem Uncapacitated Networks: Basic primal and dual solutions Flow conservation constraints

### Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University

Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck & Serkan Hoşten San Francisco State University math.sfsu.edu/beck Math Research Letters Growth Series of Lattices L R d lattice

### BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method

### The Rainbow Connection of a Graph Is (at Most) Reciprocal to Its Minimum Degree

The Rainbow Connection of a Graph Is (at Most) Reciprocal to Its Minimum Degree Michael Krivelevich 1 and Raphael Yuster 2 1 SCHOOL OF MATHEMATICS, TEL AVIV UNIVERSITY TEL AVIV, ISRAEL E-mail: krivelev@post.tau.ac.il

### The complement of PATH is in NL

340 The complement of PATH is in NL Let c be the number of nodes in graph G that are reachable from s We assume that c is provided as an input to M Given G, s, t, and c the machine M operates as follows:

### A modification of the simplex method reducing roundoff errors

A modification of the simplex method reducing roundoff errors Ralf Ulrich Kern Georg-Simon-Ohm-Hochschule Nürnberg Fakultät Informatik Postfach 21 03 20 90121 Nürnberg Ralf-Ulrich.Kern@ohm-hochschule.de

### Linear Programming and Clustering

and Advisor: Dr. Leonard Schulman, Caltech Aditya Huddedar IIT Kanpur Advisor: Dr. Leonard Schulman, Caltech Aditya Huddedar IIT Kanpur and Outline of Talk 1 Introduction 2 Motivation 3 Our Approach 4

### 1 The Traveling Salesperson Problem (TSP)

CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation

### Convexity: 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

### GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI

GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI Outline Review the column generation in Generalized Assignment Problem (GAP) GAP Examples in Branch and Price 2 Assignment Problem The assignment

### All 0-1 Polytopes are. Abstract. We study the facial structure of two important permutation polytopes

All 0-1 Polytopes are Traveling Salesman Polytopes L.J. Billera and A. Sarangarajan y Abstract We study the facial structure of two important permutation polytopes in R n2, the Birkho or assignment polytope

### 2. CONNECTIVITY Connectivity

2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =

### Generalized Network Flow Programming

Appendix C Page Generalized Network Flow Programming This chapter adapts the bounded variable primal simplex method to the generalized minimum cost flow problem. Generalized networks are far more useful

### Optimality 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 October 20, 2016 Abstract We consider the problem of minimizing

### 2. True or false: even though BFS and DFS have the same space complexity, they do not always have the same worst case asymptotic time complexity.

1. T F: Consider a directed graph G = (V, E) and a vertex s V. Suppose that for all v V, there exists a directed path in G from s to v. Suppose that a DFS is run on G, starting from s. Then, true or false:

### Lecture 8: The Traveling Salesman Problem

Lecture 8: The Traveling Salesman Problem Let G = (V, E) be an undirected graph. A Hamiltonian cycle of G is a cycle that visits every vertex v V exactly once. Instead of Hamiltonian cycle, we sometimes

### Binary Heaps in Dynamic Arrays

Yufei Tao ITEE University of Queensland We have already learned that the binary heap serves as an efficient implementation of a priority queue. Our previous discussion was based on pointers (for getting