Algebraic and Geometric ideas in the theory of Discrete Optimization
|
|
- Diana Park
- 6 years ago
- Views:
Transcription
1 Algebraic and Geometric ideas in the theory of Discrete Optimization Jesús A. De Loera, UC Davis Three Lectures based on the book: Algebraic & Geometric Ideas in the Theory of Discrete Optimization (SIAM-MOS 2013) By J. De Loera, R. Hemmecke & M. Köppe July 15, 2013 () July 15, / 25
2 Algebraic and Geometric Ideas in the Theory of Discrete Optimization offers several research technologies not yet well known among practitioners of discrete optimization, minimizes prerequisites for learning these methods, and provides a transition from linear discrete optimization to nonlinear discrete optimization. This book can be used as a textbook for advanced undergraduates or beginning graduate students in mathematics, computer science, or operations research or as a tutorial for mathematicians, engineers, and scientists engaged in computation who wish to delve more deeply into how and why algorithms do or do not work. Jesús A. De Loera is a professor of mathematics and a member of the Graduate Groups in Computer Science and Applied Mathematics at University of California, Davis. His research has been recognized by an Alexander von Humboldt Fellowship, the UC Davis Chancellor Fellow award, and the 2010 INFORMS Computing Society Prize. He is an associate editor of SIAM Journal on Discrete Mathematics and Discrete Optimization. Raymond Hemmecke is a professor of combinatorial optimization at Technische Universität München. His research interests include algebraic statistics, computer algebra, and bioinformatics. J. A. De Loera, R. Hemmecke, M. Köppe Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA USA Fax siam@siam.org Mathematical Optimization Society 3600 Market Street, 6th Floor Philadelphia, PA USA x319 Fax service@mathopt.org Algebraic and Geometric Ideas in the Theory of Discrete Optimization Jesús A. De Loera Raymond Hemmecke Matthias Köppe Matthias Köppe is a professor of mathematics and a member of the Graduate Groups in Computer Science and Applied Mathematics at University of California, Davis. He is an associate editor of Mathematical Programming, Series A and Asia-Pacific Journal of Operational Research. Algebraic and Geometric Ideas in the Theory of Discrete Optimization This book presents recent advances in the mathematical theory of discrete optimization, particularly those supported by methods from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside the standard curriculum in optimization. MO14 MOS -SIA MS Jesús A. De Loera Raymond Hemmecke Matthias Köppe eries ISBN on O ptim izatio n MO14 () July 15, / 25
3 () July 15, / 25
4 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
5 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
6 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
7 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
8 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
9 Menu for Lectures For Lecture ONE: Motivation and Main Statements Non-Linear Polynomials and Discrete Optimization. Some Theorems on Non-Linear Discrete Optimization For Lecture TWO: A taste of the Math Generating Function Methods Graver Bases Methods For Lecture THREE: Using Polynomials when one does not expect them! Hilbert Nullstellensatz and Colorability problems. Central Path of Interior Point Methods. () July 15, / 25
10 Polynomials and Discrete Optimization Historical Transitioning from linear to non-linear constraints in models () July 15, / 25
11 Now we have INTEGER or BINARY variables max f (x) subject to g i (x) 0, i = 1, 2,..., k, h j (x) = 0, j = 1, 2,..., m, x R n1 Z n2. Here the objective function f and the constraint functions g i, h j are assumed to be arbitrary real-valued functions. KEY POINT: The study of these problems requires more ideas from Algebra, Geometry and Topology. (1) LET US GO BACK IN TIME... () July 15, / 25
12 A Classical Example from the beginning of Discrete Optimization Initial work by Kantorovich (1939), T.C Koopmans (1941), von Neumann (1947). The Transportation problem: A company builds laptops in four factories, each with certain supply power. Four cities have laptop demands. There is a cost c i,j for transporting a laptop from factory i to city j. What is the best assignment of transport in order to minimize the cost? SUPPLIES BY FACTORIES DEMANDS ON FOUR CITIES A silly way to solve this: run through all possibilities! Well how do I do this?? Not so easy... If supply and demand are all ONE and if number of cities and () 9 July 15, / 25
13 A Classical Example from the beginning of Discrete Optimization Initial work by Kantorovich (1939), T.C Koopmans (1941), von Neumann (1947). The Transportation problem: A company builds laptops in four factories, each with certain supply power. Four cities have laptop demands. There is a cost c i,j for transporting a laptop from factory i to city j. What is the best assignment of transport in order to minimize the cost? SUPPLIES BY FACTORIES DEMANDS ON FOUR CITIES A silly way to solve this: run through all possibilities! Well how do I do this?? Not so easy... If supply and demand are all ONE and if number of cities and () 9 July 15, / 25
14 A Classical Example from the beginning of Discrete Optimization Initial work by Kantorovich (1939), T.C Koopmans (1941), von Neumann (1947). The Transportation problem: A company builds laptops in four factories, each with certain supply power. Four cities have laptop demands. There is a cost c i,j for transporting a laptop from factory i to city j. What is the best assignment of transport in order to minimize the cost? SUPPLIES BY FACTORIES DEMANDS ON FOUR CITIES A silly way to solve this: run through all possibilities! Well how do I do this?? Not so easy... If supply and demand are all ONE and if number of cities and () 9 July 15, / 25
15 Modeling with LINEAR equations and inequalities Let x i,j be a variable indicating number of laptops factory i provides to city j. x i,j can only take non-negative integer values, x i,j 0. Then Since factory i produces a i laptops we have n x i,j = a i, for all i = 1,..., n. j=1 and since city j needs b j laptops n x i,j = b j, for all j = 1,..., n. i=1 Now we minimize c i,j x i,j. () July 15, / 25
16 Modeling with LINEAR equations and inequalities Let x i,j be a variable indicating number of laptops factory i provides to city j. x i,j can only take non-negative integer values, x i,j 0. Then Since factory i produces a i laptops we have n x i,j = a i, for all i = 1,..., n. j=1 and since city j needs b j laptops n x i,j = b j, for all j = 1,..., n. i=1 Now we minimize c i,j x i,j. () July 15, / 25
17 Modeling with LINEAR equations and inequalities Let x i,j be a variable indicating number of laptops factory i provides to city j. x i,j can only take non-negative integer values, x i,j 0. Then Since factory i produces a i laptops we have n x i,j = a i, for all i = 1,..., n. j=1 and since city j needs b j laptops n x i,j = b j, for all j = 1,..., n. i=1 Now we minimize c i,j x i,j. () July 15, / 25
18 Modeling with LINEAR equations and inequalities Let x i,j be a variable indicating number of laptops factory i provides to city j. x i,j can only take non-negative integer values, x i,j 0. Then Since factory i produces a i laptops we have n x i,j = a i, for all i = 1,..., n. j=1 and since city j needs b j laptops n x i,j = b j, for all j = 1,..., n. i=1 Now we minimize c i,j x i,j. () July 15, / 25
19 Overview LINEAR Discrete Optimization (circa 1990) Efficient computation with Convex Sets & Lattices Efficient Optimization () July 15, / 25
20 At the beginning there was... Linear programs Special integer programs Integer programs max c x max c x max c x s.t. Ax b s.t. Ax b s.t. Ax b all x i integer all x i integer max c Matrix A is SPECIAL! () July 15, / 25
21 At the beginning there was... Linear programs Special integer programs Integer programs max c x max c x max c x s.t. Ax b s.t. Ax b s.t. Ax b all x i integer all x i integer max c Matrix A is SPECIAL! max c () July 15, / 25
22 At the beginning there was... Linear programs Special integer programs Integer programs max c x max c x max c x s.t. Ax b s.t. Ax b s.t. Ax b all x i integer all x i integer max c Matrix A is SPECIAL! max c () July 15, / 25
23 At the beginning there was... Linear programs Special integer programs Integer programs max c x max c x max c x s.t. Ax b s.t. Ax b s.t. Ax b all x i integer all x i integer max c Easy (polynomial-time solvable) Matrix A is SPECIAL! Medium (can be easy or hard) Network problems Fixed dimension knapsacks 0-1 matrices max c Hard (NP-hard) () July 15, / 25
24 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
25 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
26 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
27 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
28 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 max c x 0 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
29 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 max c x 0 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
30 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 max c x 0 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
31 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 max c x 0 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
32 Integer Linear Programming: The state of the art Traditional Algorithms Dual (polyhedral) techniques Enumeration Adhoc methods max c x 2 x 0 x 1 max c x 0 Cutting plane algorithms based on polyhedral theory Branch-and-bound special structure (e.g. network, matroids, etc.) Mathematical modelling Strong initial IP formulation () July 15, / 25
33 MANY CHALLENGES!! LIFE IS NON-LINEAR!! () July 15, / 25
34 Example: Non-linear transportation polytopes 1 In the traditional transportation problem cost at an edge is a constant. Thus we optimize a linear function. 2 but due to congestion or heavy traffic or heavy communication load the transportation cost on an edge could be a non-linear function of the flow at each edge. 3 For example cost at each edge is f ij (x ij ) = c ij x ij a ij for suitable constant a ij. This results on a non-linear function f ij which is much harder to minimize. () July 15, / 25
35 Example: Non-linear transportation polytopes 1 In the traditional transportation problem cost at an edge is a constant. Thus we optimize a linear function. 2 but due to congestion or heavy traffic or heavy communication load the transportation cost on an edge could be a non-linear function of the flow at each edge. 3 For example cost at each edge is f ij (x ij ) = c ij x ij a ij for suitable constant a ij. This results on a non-linear function f ij which is much harder to minimize. () July 15, / 25
36 Example: Non-linear transportation polytopes 1 In the traditional transportation problem cost at an edge is a constant. Thus we optimize a linear function. 2 but due to congestion or heavy traffic or heavy communication load the transportation cost on an edge could be a non-linear function of the flow at each edge. 3 For example cost at each edge is f ij (x ij ) = c ij x ij a ij for suitable constant a ij. This results on a non-linear function f ij which is much harder to minimize. () July 15, / 25
37 Reality is NON-LINEAR and worse!! Non-linear Discrete Optimization max/min f (x 1,..., x d ) subject to g j (x 1,..., x d ) 0, for j = 1... s, and with with x i integer with f, g j Non-Linear BAD NEWS: The problem is INCREDIBLY HARD Theorem It is UNDECIDABLE already when f,g i s are arbitrary polynomials (Jeroslow, 1979). EVEN WORSE Theorem: It undecidable even with number of variables=10. (Matiyasevich and Davis 1982). WHAT CAN BE DONE IN THIS GENERAL CONTEXT?? Prove good theorems? Are there efficient algorithms? No theorem or algorithm performance can be proved without ASSUMPTIONS Let us see two nice theorems that were proved in the last years () July 15, / 25
38 Reality is NON-LINEAR and worse!! Non-linear Discrete Optimization max/min f (x 1,..., x d ) subject to g j (x 1,..., x d ) 0, for j = 1... s, and with with x i integer with f, g j Non-Linear BAD NEWS: The problem is INCREDIBLY HARD Theorem It is UNDECIDABLE already when f,g i s are arbitrary polynomials (Jeroslow, 1979). EVEN WORSE Theorem: It undecidable even with number of variables=10. (Matiyasevich and Davis 1982). WHAT CAN BE DONE IN THIS GENERAL CONTEXT?? Prove good theorems? Are there efficient algorithms? No theorem or algorithm performance can be proved without ASSUMPTIONS Let us see two nice theorems that were proved in the last years () July 15, / 25
39 Reality is NON-LINEAR and worse!! Non-linear Discrete Optimization max/min f (x 1,..., x d ) subject to g j (x 1,..., x d ) 0, for j = 1... s, and with with x i integer with f, g j Non-Linear BAD NEWS: The problem is INCREDIBLY HARD Theorem It is UNDECIDABLE already when f,g i s are arbitrary polynomials (Jeroslow, 1979). EVEN WORSE Theorem: It undecidable even with number of variables=10. (Matiyasevich and Davis 1982). WHAT CAN BE DONE IN THIS GENERAL CONTEXT?? Prove good theorems? Are there efficient algorithms? No theorem or algorithm performance can be proved without ASSUMPTIONS Let us see two nice theorems that were proved in the last years () July 15, / 25
40 Reality is NON-LINEAR and worse!! Non-linear Discrete Optimization max/min f (x 1,..., x d ) subject to g j (x 1,..., x d ) 0, for j = 1... s, and with with x i integer with f, g j Non-Linear BAD NEWS: The problem is INCREDIBLY HARD Theorem It is UNDECIDABLE already when f,g i s are arbitrary polynomials (Jeroslow, 1979). EVEN WORSE Theorem: It undecidable even with number of variables=10. (Matiyasevich and Davis 1982). WHAT CAN BE DONE IN THIS GENERAL CONTEXT?? Prove good theorems? Are there efficient algorithms? No theorem or algorithm performance can be proved without ASSUMPTIONS Let us see two nice theorems that were proved in the last years () July 15, / 25
41 Reality is NON-LINEAR and worse!! Non-linear Discrete Optimization max/min f (x 1,..., x d ) subject to g j (x 1,..., x d ) 0, for j = 1... s, and with with x i integer with f, g j Non-Linear BAD NEWS: The problem is INCREDIBLY HARD Theorem It is UNDECIDABLE already when f,g i s are arbitrary polynomials (Jeroslow, 1979). EVEN WORSE Theorem: It undecidable even with number of variables=10. (Matiyasevich and Davis 1982). WHAT CAN BE DONE IN THIS GENERAL CONTEXT?? Prove good theorems? Are there efficient algorithms? No theorem or algorithm performance can be proved without ASSUMPTIONS Let us see two nice theorems that were proved in the last years () July 15, / 25
42 How about polyhedral constraints non-linear objective?? Let f be a multivariate polynomial function, max s.t. f(x) Ax b Special programs max f(x) s.t. Ax b all x i integer max s.t. f(x) Ax b all x i integer Matrix A is SPECIAL! () July 15, / 25
43 How about polyhedral constraints non-linear objective?? Let f be a multivariate polynomial function, max s.t. f(x) Ax b Hard (NP-hard) Special programs max f(x) s.t. Ax b all x i integer max s.t. f(x) Ax b all x i integer Hard (NP-hard) Matrix A is SPECIAL! () July 15, / 25
44 How about polyhedral constraints non-linear objective?? Let f be a multivariate polynomial function, max s.t. f(x) Ax b Hard (NP-hard) Special programs max f(x) s.t. Ax b all x i integer max s.t. f(x) Ax b all x i integer Hard (NP-hard) Matrix A is SPECIAL! () July 15, / 25
45 How about polyhedral constraints non-linear objective?? Let f be a multivariate polynomial function, max s.t. f(x) Ax b Hard (NP-hard) Special programs max f(x) s.t. Ax b all x i integer max s.t. f(x) Ax b all x i integer Hard (NP-hard) Matrix A is SPECIAL!??? () July 15, / 25
46 How about polyhedral constraints non-linear objective?? Let f be a multivariate polynomial function, max s.t. f(x) Ax b Hard (NP-hard) Special programs max s.t. f(x) Ax b all x i integer max s.t. f(x) Ax b all x i integer Hard (NP-hard) Matrix A is SPECIAL!??? We study TWO special cases () July 15, / 25
47 MAIN DISH TWO EXAMPLES OF ALGEBRAIC-GEOMETRIC IDEAS FOR DISCRETE OPTIMIZATION () July 15, / 25
48 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
49 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
50 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
51 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
52 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
53 Problem type max f (x 1,..., x d ) subject to (x 1,..., x d ) P Z d, where P is a polytope (bounded polyhedron) given by linear constraints, f is a (multivariate) polynomial function non-negative over P Z d, the dimension d is fixed. Prior Work Integer Linear Programming can be solved in polynomial time (H. W. Lenstra Jr, 1983) Convex polynomials f can be minimized in polynomial time (Khachiyan and Porkolab, 2000) WHAT CAN BE PROVED IN THIS CASE?? Lemma Optimizing an arbitrary degree-4 polynomial f over the lattice points of a polygon is NP-hard NP-complete to decide whether, given three positive integers a, b, c, there exists a positive integer x < c such that x 2 is congruent with a modulo b. () July 15, / 25
54 Theorem (FPTAS for Integer Polynomial Maximization) JDL, Hemmecke, Köppe, Weismantel, 2006 Let the dimension d be fixed. There exists an algorithm whose input data are a polytope P R d, given by rational linear inequalities, and a polynomial f Z[x 1,..., x d ] with integer coefficients and maximum total degree D that is non-negative on P Z d with the following properties. 1 For a given k, it computes in running time polynomial in k, the encoding size of P and f, and D lower and upper bounds L k f (x max ) U k satisfying ( ) k U k L k P Z d 1 f (x max ). 2 For k = (1 + 1/ɛ) log( P Z d ), the bounds satisfy U k L k ɛ f (x max ), and they can be computed in time polynomial in the input size, the total degree D, and 1/ɛ. 3 By iterated bisection of P Z d, it constructs a feasible solution x ɛ P Z d with f (xɛ ) f (x max ) ɛf (x max ). () July 15, / 25
55 Theorem (FPTAS for Integer Polynomial Maximization) JDL, Hemmecke, Köppe, Weismantel, 2006 Let the dimension d be fixed. There exists an algorithm whose input data are a polytope P R d, given by rational linear inequalities, and a polynomial f Z[x 1,..., x d ] with integer coefficients and maximum total degree D that is non-negative on P Z d with the following properties. 1 For a given k, it computes in running time polynomial in k, the encoding size of P and f, and D lower and upper bounds L k f (x max ) U k satisfying ( ) k U k L k P Z d 1 f (x max ). 2 For k = (1 + 1/ɛ) log( P Z d ), the bounds satisfy U k L k ɛ f (x max ), and they can be computed in time polynomial in the input size, the total degree D, and 1/ɛ. 3 By iterated bisection of P Z d, it constructs a feasible solution x ɛ P Z d with f (xɛ ) f (x max ) ɛf (x max ). () July 15, / 25
56 Theorem (FPTAS for Integer Polynomial Maximization) JDL, Hemmecke, Köppe, Weismantel, 2006 Let the dimension d be fixed. There exists an algorithm whose input data are a polytope P R d, given by rational linear inequalities, and a polynomial f Z[x 1,..., x d ] with integer coefficients and maximum total degree D that is non-negative on P Z d with the following properties. 1 For a given k, it computes in running time polynomial in k, the encoding size of P and f, and D lower and upper bounds L k f (x max ) U k satisfying ( ) k U k L k P Z d 1 f (x max ). 2 For k = (1 + 1/ɛ) log( P Z d ), the bounds satisfy U k L k ɛ f (x max ), and they can be computed in time polynomial in the input size, the total degree D, and 1/ɛ. 3 By iterated bisection of P Z d, it constructs a feasible solution x ɛ P Z d with f (xɛ ) f (x max ) ɛf (x max ). () July 15, / 25
57 Theorem (FPTAS for Integer Polynomial Maximization) JDL, Hemmecke, Köppe, Weismantel, 2006 Let the dimension d be fixed. There exists an algorithm whose input data are a polytope P R d, given by rational linear inequalities, and a polynomial f Z[x 1,..., x d ] with integer coefficients and maximum total degree D that is non-negative on P Z d with the following properties. 1 For a given k, it computes in running time polynomial in k, the encoding size of P and f, and D lower and upper bounds L k f (x max ) U k satisfying ( ) k U k L k P Z d 1 f (x max ). 2 For k = (1 + 1/ɛ) log( P Z d ), the bounds satisfy U k L k ɛ f (x max ), and they can be computed in time polynomial in the input size, the total degree D, and 1/ɛ. 3 By iterated bisection of P Z d, it constructs a feasible solution x ɛ P Z d with f (xɛ ) f (x max ) ɛf (x max ). () July 15, / 25
58 Example : Multiobjective Transportation Problems 1 In the traditional transportation problem one cost per edge. Thus we optimize ONE linear function. 2 but the cost of an edge for the company may not be the same as for an environmentalist or the government!! We face many cost functions at the same time. 3 So we get three or more costs per edge and we are looking to find points where three or more linear functionals are minimized. 4 The three objective functions induce a partial order over the lattice points in the feasible region. 5 The multiobjective optimization approach is to find the minimal elements of a partially ordered set, the Pareto Optima. () July 15, / 25
59 Example : Multiobjective Transportation Problems 1 In the traditional transportation problem one cost per edge. Thus we optimize ONE linear function. 2 but the cost of an edge for the company may not be the same as for an environmentalist or the government!! We face many cost functions at the same time. 3 So we get three or more costs per edge and we are looking to find points where three or more linear functionals are minimized. 4 The three objective functions induce a partial order over the lattice points in the feasible region. 5 The multiobjective optimization approach is to find the minimal elements of a partially ordered set, the Pareto Optima. () July 15, / 25
60 Example : Multiobjective Transportation Problems 1 In the traditional transportation problem one cost per edge. Thus we optimize ONE linear function. 2 but the cost of an edge for the company may not be the same as for an environmentalist or the government!! We face many cost functions at the same time. 3 So we get three or more costs per edge and we are looking to find points where three or more linear functionals are minimized. 4 The three objective functions induce a partial order over the lattice points in the feasible region. 5 The multiobjective optimization approach is to find the minimal elements of a partially ordered set, the Pareto Optima. () July 15, / 25
61 Example : Multiobjective Transportation Problems 1 In the traditional transportation problem one cost per edge. Thus we optimize ONE linear function. 2 but the cost of an edge for the company may not be the same as for an environmentalist or the government!! We face many cost functions at the same time. 3 So we get three or more costs per edge and we are looking to find points where three or more linear functionals are minimized. 4 The three objective functions induce a partial order over the lattice points in the feasible region. 5 The multiobjective optimization approach is to find the minimal elements of a partially ordered set, the Pareto Optima. () July 15, / 25
62 Example : Multiobjective Transportation Problems 1 In the traditional transportation problem one cost per edge. Thus we optimize ONE linear function. 2 but the cost of an edge for the company may not be the same as for an environmentalist or the government!! We face many cost functions at the same time. 3 So we get three or more costs per edge and we are looking to find points where three or more linear functionals are minimized. 4 The three objective functions induce a partial order over the lattice points in the feasible region. 5 The multiobjective optimization approach is to find the minimal elements of a partially ordered set, the Pareto Optima. () July 15, / 25
63 Main results JDL, Hemmecke, Köppe, 2010 Theorem (Counting and enumeration theorem) Let the dimension n and the number k of objective functions be fixed. Using the input data A Z m n, an m-vector b, and linear functions f 1,..., f k Z n, (i) there exists a polynomial-time algorithm to exactly count the Pareto optima and the Pareto strategies; (ii) there exists a polynomial-space polynomial-delay prescribed-order enumeration algorithm to generate the full sequence of Pareto optima ordered lexicographically. (iii) There exists a polynomial-time algorithm to find a Pareto optimum v that minimizes the distance v ˆv from a prescribed point ˆv Z k for an arbitrary polyhedral norm. (Again in the spirit of Lenstra s 1983 polynomial-time algorithm for ILP in fixed dimension.) () July 15, / 25
64 Theorem: Convex Integer Optimization on Transportation Polytopes JDL, Hemmecke, Onn, Rothblum, Weismantel, 2009 Problem: Convex function c : R d R, find a nonnegative integer vector x N n maximizing max {c(w 1 x,..., w d x) : Ax = b, x N n }. INTERPRETATION: Given d linear objective functions w 1,..., w d, want to maximize their convex balancing c(w 1 x,..., w d x) over feasible lattice integer points. Theorem (convex balancing on transportation problems) For any fixed d, p there is a polynomial oracle-time algorithm that, given n, arrays w 1,..., w d Z p n, and convex c : R d R given by comparison oracle, solves the convex integer transportation problem with p many suppliers. max{ c(w 1 x,..., w d x) : x N p n, p x i,j = z j, i n x i,j = v i } j () July 15, / 25
65 Theorem: Convex Integer Optimization on Transportation Polytopes JDL, Hemmecke, Onn, Rothblum, Weismantel, 2009 Problem: Convex function c : R d R, find a nonnegative integer vector x N n maximizing max {c(w 1 x,..., w d x) : Ax = b, x N n }. INTERPRETATION: Given d linear objective functions w 1,..., w d, want to maximize their convex balancing c(w 1 x,..., w d x) over feasible lattice integer points. Theorem (convex balancing on transportation problems) For any fixed d, p there is a polynomial oracle-time algorithm that, given n, arrays w 1,..., w d Z p n, and convex c : R d R given by comparison oracle, solves the convex integer transportation problem with p many suppliers. max{ c(w 1 x,..., w d x) : x N p n, p x i,j = z j, i n x i,j = v i } j () July 15, / 25
66 Theorem: Convex Integer Optimization on Transportation Polytopes JDL, Hemmecke, Onn, Rothblum, Weismantel, 2009 Problem: Convex function c : R d R, find a nonnegative integer vector x N n maximizing max {c(w 1 x,..., w d x) : Ax = b, x N n }. INTERPRETATION: Given d linear objective functions w 1,..., w d, want to maximize their convex balancing c(w 1 x,..., w d x) over feasible lattice integer points. Theorem (convex balancing on transportation problems) For any fixed d, p there is a polynomial oracle-time algorithm that, given n, arrays w 1,..., w d Z p n, and convex c : R d R given by comparison oracle, solves the convex integer transportation problem with p many suppliers. max{ c(w 1 x,..., w d x) : x N p n, p x i,j = z j, i n x i,j = v i } j () July 15, / 25
67 Integer Optimization over N-fold Systems Fix any pair of integer matrices A and B with the same number of columns, of dimensions r q and s q, respectively. The n-fold matrix of the ordered pair A, B is the following (s + nr) nq matrix, [A, B] (n) := (1 n B) (I n A) = B B B B A A A N-fold systems DO appear in applications! Transportation problems with fixed number of suppliers are examples! Example: Consider the matrices A = [1 1] and B = I 2. [A, B] (4) = () July 15, / 25
68 Integer Optimization over N-fold Systems Fix any pair of integer matrices A and B with the same number of columns, of dimensions r q and s q, respectively. The n-fold matrix of the ordered pair A, B is the following (s + nr) nq matrix, [A, B] (n) := (1 n B) (I n A) = B B B B A A A N-fold systems DO appear in applications! Transportation problems with fixed number of suppliers are examples! Example: Consider the matrices A = [1 1] and B = I 2. [A, B] (4) = () July 15, / 25
69 Integer Optimization over N-fold Systems Fix any pair of integer matrices A and B with the same number of columns, of dimensions r q and s q, respectively. The n-fold matrix of the ordered pair A, B is the following (s + nr) nq matrix, [A, B] (n) := (1 n B) (I n A) = B B B B A A A N-fold systems DO appear in applications! Transportation problems with fixed number of suppliers are examples! Example: Consider the matrices A = [1 1] and B = I 2. [A, B] (4) = () July 15, / 25
70 Theorem Fix two integer matrices A, B of sizes r q and s q, respectively. Then there is a polynomial time algorithm that, given any n, an integer vectors b, a cost vector c, solves the corresponding n-fold integer programming problem. max{cx : [A, B] (n) x = b, x N nq }. Similarly, Given a constant number of cost vectors c 1,..., c k, a convex function f, then there is a polynomial time algorithm that given any n, an integer vectors b, a cost vector c, max{f (c 1 x, c 2 x,..., c k x) : [A, B] (n) x = b, x N nq }. Recent Advances: Extensions to convex minimization, stochastic integer optimization, by Hemmecke, J. Lee, S. Onn, M. Köppe, Note: Compare to polynomial-time of network flow integer programs (E. Tardos )!! () July 15, / 25
71 Theorem Fix two integer matrices A, B of sizes r q and s q, respectively. Then there is a polynomial time algorithm that, given any n, an integer vectors b, a cost vector c, solves the corresponding n-fold integer programming problem. max{cx : [A, B] (n) x = b, x N nq }. Similarly, Given a constant number of cost vectors c 1,..., c k, a convex function f, then there is a polynomial time algorithm that given any n, an integer vectors b, a cost vector c, max{f (c 1 x, c 2 x,..., c k x) : [A, B] (n) x = b, x N nq }. Recent Advances: Extensions to convex minimization, stochastic integer optimization, by Hemmecke, J. Lee, S. Onn, M. Köppe, Note: Compare to polynomial-time of network flow integer programs (E. Tardos )!! () July 15, / 25
72 Theorem Fix two integer matrices A, B of sizes r q and s q, respectively. Then there is a polynomial time algorithm that, given any n, an integer vectors b, a cost vector c, solves the corresponding n-fold integer programming problem. max{cx : [A, B] (n) x = b, x N nq }. Similarly, Given a constant number of cost vectors c 1,..., c k, a convex function f, then there is a polynomial time algorithm that given any n, an integer vectors b, a cost vector c, max{f (c 1 x, c 2 x,..., c k x) : [A, B] (n) x = b, x N nq }. Recent Advances: Extensions to convex minimization, stochastic integer optimization, by Hemmecke, J. Lee, S. Onn, M. Köppe, Note: Compare to polynomial-time of network flow integer programs (E. Tardos )!! () July 15, / 25
73 WHAT IS THE MATH INSIDE? Two clever algebraic encodings of the lattice points in Polyhedra!! Stay tuned for the second lecture! () July 15, / 25
74 WHAT IS THE MATH INSIDE? Two clever algebraic encodings of the lattice points in Polyhedra!! Stay tuned for the second lecture! () July 15, / 25
75 WHAT IS THE MATH INSIDE? Two clever algebraic encodings of the lattice points in Polyhedra!! Stay tuned for the second lecture! () July 15, / 25
76 Thank you Danke Merci Gracias () July 15, / 25
Robust Integer Programming
Robust Integer Programming Technion Israel Institute of Technology Outline. Overview our theory of Graver bases for integer programming (with Berstein, De Loera, Hemmecke, Lee, Romanchuk, Rothblum, Weismantel)
More informationPARETO OPTIMA OF MULTICRITERIA INTEGER LINEAR PROGRAMS
PARETO OPTIMA OF MULTICRITERIA INTEGER LINEAR PROGRAMS JESÚS A. DE LOERA, RAYMOND HEMMECKE, AND MATTHIAS KÖPPE Abstract. We settle the computational complexity of fundamental questions related to multicriteria
More informationNonlinear Discrete Optimization
Nonlinear Discrete Optimization Technion Israel Institute of Technology http://ie.technion.ac.il/~onn Billerafest 2008 - conference in honor of Lou Billera's 65th birthday (Update on Lecture Series given
More informationMultiway Tables and Integer Programming are Fixed-Parameter Tractable
Multiway Tables and Integer Programming are Fixed-Parameter Tractable Technion Israel Institute of Technology Outline 1. Overview our theory of Graver bases for integer programming (with Berstein, De Loera,
More informationMSRI Summer Graduate Workshop: Algebraic, Geometric, and Combinatorial Methods for Optimization. Part IV
MSRI Summer Graduate Workshop: Algebraic, Geometric, and Combinatorial Methods for Optimization Part IV Geometry of Numbers and Rational Generating Function Techniques for Integer Programming Matthias
More informationAdvances in Integer Programming
Advances in Integer Programming Technion Israel Institute of Technology http://ie.technion.ac.il/~onn (Non)-Linear Integer Programming The problem is: min/max { f(x) : Ax b, l x u, x in Z n } with data:
More informationIBM Research Report. Nonlinear Integer Programming. Otto-von-Guericke-Universität Magdeburg FMA/IMO Universitätsplatz Magdeburg Germany
RC24820 (W0812-035) December 4, 2008 Mathematics IBM Research Report Nonlinear Integer Programming Raymond Hemmecke 1, Matthias Köppe 2, Jon Lee 3, Robert Weismantel 1 1 Otto-von-Guericke-Universität Magdeburg
More informationMinimizing Cubic and Homogeneous Polynomials Over Integer Points in the Plane
Minimizing Cubic and Homogeneous Polynomials Over Integer Points in the Plane Robert Hildebrand IFOR - ETH Zürich Joint work with Alberto Del Pia, Robert Weismantel and Kevin Zemmer Robert Hildebrand (ETH)
More informationP=NP via Integer factorization and Optimization
P=NP via Integer factorization and Optimization Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract A polynomial-time algorithm for integer factorization, wherein integer
More informationFinal results on P vs NP via Integer Factorization and Optimization
Final results on P vs NP via Integer Factorization and Optimization Abstract Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca We reduce integer factorization problem to the
More informationInteger programming, Barvinok s counting algorithm and Gomory relaxations
Integer programming, Barvinok s counting algorithm and Gomory relaxations Jean B. Lasserre LAAS-CNRS, Toulouse, France Abstract We propose an algorithm based on Barvinok s counting algorithm for P max{c
More informationMinimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane Alberto Del Pia Department of Industrial and Systems Engineering & Wisconsin Institutes for Discovery, University of Wisconsin-Madison
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
More informationLecture 1 Introduction
L. Vandenberghe EE236A (Fall 2013-14) Lecture 1 Introduction course overview linear optimization examples history approximate syllabus basic definitions linear optimization in vector and matrix notation
More informationInteger Programming Methods LNMB
Integer Programming Methods LNMB 2017 2018 Dion Gijswijt homepage.tudelft.nl/64a8q/intpm/ Dion Gijswijt Intro IntPM 2017-2018 1 / 24 Organisation Webpage: homepage.tudelft.nl/64a8q/intpm/ Book: Integer
More informationInteger factorization is in P
Integer factorization is in P Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract A polynomial-time algorithm for integer factorization, wherein integer factorization
More informationCombinatorial Optimization
Combinatorial Optimization Lecture notes, WS 2010/11, TU Munich Prof. Dr. Raymond Hemmecke Version of February 9, 2011 Contents 1 The knapsack problem 1 1.1 Complete enumeration..................................
More informationP=NP via Integer Factorization and Optimization
P=NP via Integer Factorization and Optimization Abstract Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca We reduce integer factorization problem to the equivalent problem
More informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationTop Ehrhart coefficients of integer partition problems
Top Ehrhart coefficients of integer partition problems Jesús A. De Loera Department of Mathematics University of California, Davis Joint Math Meetings San Diego January 2013 Goal: Count the solutions
More informationA polynomial oracle-time algorithm for convex integer minimization
Math. Program., Ser. A DOI 10.1007/s10107-009-0276-7 FULL LENGTH PAPER A polynomial oracle-time algorithm for convex integer minimization Raymond Hemmecke Shmuel Onn Robert Weismantel Received: 16 October
More informationComplex Programming. Yuly Shipilevsky. Toronto, Ontario, Canada address:
Complex Programming Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract We introduce and suggest to research a special class of optimization problems, wherein an objective
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationInteger Programming Duality
Integer Programming Duality M. Guzelsoy T. K. Ralphs July, 2010 1 Introduction This article describes what is known about duality for integer programs. It is perhaps surprising that many of the results
More informationConvex sets, matrix factorizations and positive semidefinite rank
Convex sets, matrix factorizations and positive semidefinite rank Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of
More informationOptimization of Submodular Functions Tutorial - lecture I
Optimization of Submodular Functions Tutorial - lecture I Jan Vondrák 1 1 IBM Almaden Research Center San Jose, CA Jan Vondrák (IBM Almaden) Submodular Optimization Tutorial 1 / 1 Lecture I: outline 1
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationDOWNLOAD PDF LINEAR OPTIMIZATION AND APPROXIMATION
Chapter 1 : COBYLA - Constrained Optimization BY Linear Approximation â pyopt A linear optimization problem is the task of minimizing a linear real-valued function of finitely many variables subject to
More informationNonlinear optimization for matroid intersection and extensions
Y. Berstein J. Lee S. Onn R. Weismantel Nonlinear optimization for matroid intersection and extensions For Tom Liebling, on the occasion of his retirement Abstract We address optimization of nonlinear
More informationEnumerating integer points in polytopes: applications to number theory. Matthias Beck San Francisco State University math.sfsu.
Enumerating integer points in polytopes: applications to number theory Matthias Beck San Francisco State University math.sfsu.edu/beck It takes a village to count integer points. Alexander Barvinok Outline
More information10 Years BADGeometry: Progress and Open Problems in Ehrhart Theory
10 Years BADGeometry: Progress and Open Problems in Ehrhart Theory Matthias Beck (San Francisco State University) math.sfsu.edu/beck Thanks To... 10 Years BADGeometry: Progress and Open Problems in Ehrhart
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 02: Optimization (Convex and Otherwise) What is Optimization? An Optimization Problem has 3 parts. x F f(x) :
More information47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 2 Date: 03/18/2010
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture Date: 03/18/010 We saw in the previous lecture that a lattice Λ can have many bases. In fact, if Λ is a lattice of a subspace L with
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationOn the knapsack closure of 0-1 Integer Linear Programs
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti 1 Dipartimento di Ingegneria dell Informazione University of Padova Padova, Italy Andrea Lodi 2 Dipartimento di Elettronica, Informatica
More informationThe Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs Santanu S. Dey 1, Andres Iroume 1, and Guanyi Wang 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology
More informationLattice polygons. P : lattice polygon in R 2 (vertices Z 2, no self-intersections)
Lattice polygons P : lattice polygon in R 2 (vertices Z 2, no self-intersections) A, I, B A = area of P I = # interior points of P (= 4) B = #boundary points of P (= 10) Pick s theorem Georg Alexander
More informationMixed-radix Naccache Stern encryption
Mixed-radix Naccache Stern encryption Rémi Géraud and David Naccache Information security group, Département d informatique de l ÉNS, École normale supérieure, CNRS, PSL Research University, Paris, France.
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationInteger Linear Programming Modeling
DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem
More informationLecture 10 (Submodular function)
Discrete Methods in Informatics January 16, 2006 Lecture 10 (Submodular function) Lecturer: Satoru Iwata Scribe: Masaru Iwasa and Yukie Nagai Submodular functions are the functions that frequently appear
More informationOutline. Outline. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Scheduling CPM/PERT Resource Constrained Project Scheduling Model
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 and Mixed Integer Programg Marco Chiarandini 1. Resource Constrained Project Model 2. Mathematical Programg 2 Outline Outline 1. Resource Constrained
More informationUnit 2: Problem Classification and Difficulty in Optimization
Unit 2: Problem Classification and Difficulty in Optimization Learning goals Unit 2 I. What is the subject area of multiobjective decision analysis and multiobjective optimization; How does it relate to
More information0.1 Simplest example: Solving systems of linear equations
princeton univ. F 16 cos 521: Advanced Algorithm Design Lecture 5: Linear Thinking Lecturer: Sanjeev Arora Scribe: Sanjeev Arora According to conventional wisdom, linear thinking describes thought process
More informationComplexity of linear programming: outline
Complexity of linear programming: outline I Assessing computational e ciency of algorithms I Computational e ciency of the Simplex method I Ellipsoid algorithm for LP and its computational e ciency IOE
More informationWeek Cuts, Branch & Bound, and Lagrangean Relaxation
Week 11 1 Integer Linear Programming This week we will discuss solution methods for solving integer linear programming problems. I will skip the part on complexity theory, Section 11.8, although this is
More informationSubset selection with sparse matrices
Subset selection with sparse matrices Alberto Del Pia, University of Wisconsin-Madison Santanu S. Dey, Georgia Tech Robert Weismantel, ETH Zürich February 1, 018 Schloss Dagstuhl Subset selection for regression
More informationRational Generating Functions and Integer Programming Games
Rational Generating Functions and Integer Programming Games arxiv:0809.0689v1 [cs.gt] 3 Sep 2008 Matthias Köppe University of California, Davis, Department of Mathematics, One Shields Avenue, Davis, CA
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck Based on joint work with Thomas Zaslavsky Binghamton University (SUNY) In mathematics you don t understand
More informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationThe partial-fractions method for counting solutions to integral linear systems
The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral
More informationFinal Report on the Newton Institute Programme Polynomial Optimisation
Final Report on the Newton Institute Programme Polynomial Optimisation July 15th to August 19th 2013 1 Committees The organising committee consisted of: Adam N. Letchford (Department of Management Science,
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationLectures 6, 7 and part of 8
Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationCS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003
CS6999 Probabilistic Methods in Integer Programming Randomized Rounding April 2003 Overview 2 Background Randomized Rounding Handling Feasibility Derandomization Advanced Techniques Integer Programming
More informationTopics in Theoretical Computer Science April 08, Lecture 8
Topics in Theoretical Computer Science April 08, 204 Lecture 8 Lecturer: Ola Svensson Scribes: David Leydier and Samuel Grütter Introduction In this lecture we will introduce Linear Programming. It was
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Non-linear programming In case of LP, the goal
More informationOn the knapsack closure of 0-1 Integer Linear Programs. Matteo Fischetti University of Padova, Italy
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti University of Padova, Italy matteo.fischetti@unipd.it Andrea Lodi University of Bologna, Italy alodi@deis.unibo.it Aussois, January
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationENGI 5708 Design of Civil Engineering Systems
ENGI 5708 Design of Civil Engineering Systems Lecture 04: Graphical Solution Methods Part 1 Shawn Kenny, Ph.D., P.Eng. Assistant Professor Faculty of Engineering and Applied Science Memorial University
More informationInteger Quadratic Programming is in NP
Alberto Del Pia 1 Santanu S. Dey 2 Marco Molinaro 2 1 IBM T. J. Watson Research Center, Yorktown Heights. 2 School of Industrial and Systems Engineering, Atlanta Outline 1 4 Program: Definition Definition
More information1 Integer Decomposition Property
CS 598CSC: Combinatorial Optimization Lecture date: Feb 2, 2010 Instructor: Chandra Chekuri Scribe: Siva Theja Maguluri Material taken mostly from [1] (Chapter 19). 1 Integer Decomposition Property A polyhedron
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 17: Duality and MinMax Theorem Lecturer: Sanjeev Arora
princeton univ F 13 cos 521: Advanced Algorithm Design Lecture 17: Duality and MinMax Theorem Lecturer: Sanjeev Arora Scribe: Today we first see LP duality, which will then be explored a bit more in the
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationCounting with rational generating functions
Counting with rational generating functions Sven Verdoolaege and Kevin Woods May 10, 007 Abstract We examine two different ways of encoding a counting function, as a rational generating function and explicitly
More informationOptimization with additional variables and constraints
Optimization with additional variables and constraints Alpár Jüttner June 23, 2004 Abstract Norton, Plotkin and Tardos proved that - loosely spoken, an LP problem is solvable in time O(T q k+1 ) if deleting
More informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationLinear and Integer Optimization (V3C1/F4C1)
Linear and Integer Optimization (V3C1/F4C1) Lecture notes Ulrich Brenner Research Institute for Discrete Mathematics, University of Bonn Winter term 2016/2017 March 8, 2017 12:02 1 Preface Continuous updates
More informationComplex Programming. Yuly Shipilevsky. Toronto, Ontario, Canada address:
Complex Programming Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract We introduce and suggest to research a special class of optimization problems, wherein an objective
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More information1 Strict local optimality in unconstrained optimization
ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s
More information300-Level Math Courses
300-Level Math Courses Math 250: Elementary Differential Equations A differential equation is an equation relating an unknown function to one or more of its derivatives; for instance, f = f is a differential
More informationReconnect 04 Introduction to Integer Programming
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, Reconnect 04 Introduction to Integer Programming Cynthia Phillips, Sandia National Laboratories Integer programming
More informationToday: Linear Programming (con t.)
Today: Linear Programming (con t.) COSC 581, Algorithms April 10, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 29.4 Reading assignment for
More informationThe Triangle Closure is a Polyhedron
The Triangle Closure is a Polyhedron Amitabh Basu Robert Hildebrand Matthias Köppe November 7, 21 Abstract Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
More informationarxiv:math/ v1 [math.co] 3 Sep 2000
arxiv:math/0009026v1 [math.co] 3 Sep 2000 Max Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department San Francisco State University San Francisco, CA 94132 sergei@sfsu.edu
More informationCOUNTING INTEGER POINTS IN POLYHEDRA. Alexander Barvinok
COUNTING INTEGER POINTS IN POLYHEDRA Alexander Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html Let P R d be a polytope. We want to compute (exactly or approximately)
More informationComputing Markov bases, Gröbner bases, and extreme rays
Université catholique de Louvain Faculté des Sciences Appliquées Computing Markov bases, Gröbner bases, and extreme rays Thèse présentée en vue de l obtention du grade de Docteur en Sciences Appliquées
More informationA thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree
ON THE POLYHEDRAL GEOMETRY OF t DESIGNS A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts In Mathematics by Steven
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationRecognizing Graph Theoretic Properties with Polynomial Ideals
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2010 Recognizing Graph Theoretic Properties with Polynomial Ideals Jesus A. De Loera University
More informationScientific Computing: Optimization
Scientific Computing: Optimization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 March 8th, 2011 A. Donev (Courant Institute) Lecture
More information