A non-standart approach to Duality
|
|
- Kathryn Gregory
- 5 years ago
- Views:
Transcription
1 Department of Industrial and Systems Engineering Lehigh University Seminar Series, /27/2005
2 Outline 1 Duality Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation 2 Continuous Case Discrete Case LP formulation Superadditive Dual
3 References: Jean B. Lasserre, Duality and a Farkas lemma for integer programs. in: Optimization: Structure and Applications (E. Hunt and C.E.M. Pearce, Editors), Kluwer Academic Publishers (2004) Jean B. Lasserre, Integer programming duality and superadditive functions. Contemporary Mathematics 374, pp (2005)
4 Formulation Duality Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation I : P : LP f (b, c) := max x Ω(b) IP c x P d : f d (b, c) := max x Θ(b) Integration Summation Z ˆf (b, c) := e c x ds I d : ˆfd (b, c) := X Ω(b) x Θ(b) c x e c x where Ω(b) := {x R n : Ax = b, x 0} and Θ(b) := Ω(b) Z n.
5 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation The simple relation is that: or equivalently e f (b,c) = lim r ˆf (b, rc) 1/r, 1 f (b, c) = lim r r lnˆf (b, rc), e f d (b,c) = lim r ˆfd (b, rc) 1/r 1 f d (b, c) = lim r r ln ˆf d (b, rc)
6 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Let P, P d be some dual problems of P, P d. The well-known strong dual P can be obtained by Legendre-Fenchel Duality formulation. Let f : R n R, then the Fenchel conjugate: f (y) := sup x R n {x y f (x)} y R n If f is convex and lower semi-continuous f := f. Then, noting that f (y, c) is concave, P : f (b, c) := inf b f (λ, c)} = min λ A λ c} λ R m{λ λ R m{b No available transformation to get a strong P d (except the subadditive formulation, see my previous talk...) Let I, I d be the similar transforms of I, I d using Laplace-transform and Z-transform, respectively. Lasserre calls I, I d the natural duals: we can get closed form equations for ˆf (b, c) and ˆfd (b, c).
7 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Laplace transform f : C m + C of f : R m + R is Z f (λ) := e λ y f (y)dy R n + Applying to ˆf (b, c): ˆF(λ, c) := := Z e λ yˆf (y, c)dy R m + ny 1 (A λ c) k k=1
8 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Note that, ˆF(λ, c) is well defined when R(A λ c) > 0. To get I and hence a closed form ˆf (b, c), we solve the inverse Laplace transform problem: I : ˆf (b, c) := = 1 (2iπ) m 1 (2iπ) m Z γ+i γ i Z γ+i γ i e λ b ˆF(λ, c)dλ e λ b dλ ny (A λ c) k k=1 where γ is fixed and satisfies (A γ c) > 0. This complex integral can be solved directly by Cauchy residual techniques.
9 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation In fact, the multidimensional poles of ˆF are real and solve p B A B = c B for all bases of Ω(b). Then: ˆf (b, c) = X x b.f.s of Ω(b) e c x det(b) Y ( c k + p B A k ) k NB where B is the basis of the corresponding b.f.s. In other words, ˆf (b, c) is a weighted summation over the vertices of Ω(b).
10 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Z-transform f : C m + C of f : Z m + R is f (z) := X z y f (y) y Z m + Applying to ˆf d (b, c): ˆF d (z, c) := ny 1 1 e c k z A k k=1 which is well-defined if z A k > e c k k = 1,..., n
11 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation To get I d and hence a closed form ˆf d (b, c), we solve the inverse Z-transform problem: Z I d : ˆf 1 d (b, c) := ˆF (2iπ) m d (z, c)z b 1 dz z =γ where γ satisfies γ A k > e c k k = 1,..., n. Cauchy residue technique can be used, however, we have complex poles! Bases of ω(b) provide these poles. Each basis B provides det(b) complex poles in the form of: v z(k) = e p B+2iπ det(b) for k = 1,..., det(b) where v {v Z m v B = 0 mod det(b)}
12 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Combining these poles with discrete Brian and Vergne s formula: X ˆfd (b, c) = e c x U B (b, c) x b.f.s of Ω(b)
13 Integration & Counting Duality for Integration Brion and Vergne s continuous formula Duality for Summation Then, 1 f d (b, c) = lim r r ln ˆf d (b, rc) = max {c 1 x + lim x b.f.s of Ω(b) r r ln U B(b, rc)} = max {c x + 1 x b.f.s of Ω(b) q (deg(p b) deg(q b ))} = c x + ρ where q is the l.c.m of det(b): B is a feasible basis, P b and Q b are some real valued polynomials. Note that, ρ is the value of the Gomory group/asymptotic problem!
14 Continuous Case Duality Continuous Case Discrete Case LP formulation Superadditive Dual Note that a polynomial Q R[λ 1,..., λ m] can be written Q(λ) = X α S Q α λ α = X Q α λ α λαm m α S where S N m and Q α are real coefficients α S. Let A R m n, b R m. Then the folllowing two statements are equivalent: (a) The linear system Ax = b has a nonnegative solution x R n. (b) The polynomial b λ can be written b λ = nx Q j (λ)(a jλ), λ R m j=1 for some polynomials Q j R[λ 1,..., λ m], j = 1,..., n, all with nonnegative coefficients. Proof:
15 Discrete Case Duality Continuous Case Discrete Case LP formulation Superadditive Dual Let, wlog (as long as the feasible region is compact), A N m n, b N m. Then the folllowing two statements are equivalent: (a) The linear system Ax = b has a solution x N n. (b) The polynomial z b 1 can be written z b 1 = nx Q j (z)(z A j 1), z R m j=1 for some polynomials Q j R[z 1,..., z m], j = 1,..., n, all with nonnegative coefficients. Moreover, the total degree of each polynomial Q j can be bounded by b = P mx m j=1 b j min A ik. k=1,...,n Proof: i=1
16 Discrete Case Duality Continuous Case Discrete Case LP formulation Superadditive Dual Let q 0 be the vector of nonnegative coefficients of all polynomials Q j s. If D := {Mq = r, q 0} then, there exist such polynomials. Note that Mq = r state that the nx polynomials z b 1 and Q j (z)(z A j 1) are identical by equating the respective coefficients. j=1
17 Discrete Case Duality Continuous Case Discrete Case LP formulation Superadditive Dual Each Q j may be restricted to contain only monomials {z α : α b A j, α N m } Hence, in D, q R s and M R p s where p = s = my (b i + 1) i=1 nx my s j with s j = (b i A ij + 1), j = 1,..., n j=1 i=1 Note that, p is the number of monomials z α with α b and s j is the number of monomials z α with α A j b. Example: Note that M is totally unimodular.
18 Continuous Case Discrete Case LP formulation Superadditive Dual An LP equivalent to P d Let e sj = (1,..., 1) R s j, j = 1,..., n and let E N n s be the n-block diagonal matrix, whose each diagonal block is a row vector e sj. Then, 1 f d (b, c) = max{c Eq Mq = r, q 0} 2 If q is an optimal solution, then x := Eq is the associated optimal solution of P d. Proof:
19 A class of superadditive functions Continuous Case Discrete Case LP formulation Superadditive Dual Let D N m be a finite set s.t 0 D and if α D β D, β α. D be the set of functions π : N m R {+ } s.t. π(0) = 0 and π(α) < + if α D, or π(α) = +, otherwise. Given π D, f π : N m R {+ } is defined as f π(x) := inf {π(α + x) π(α)}, x α D Nm Lemma: For every π D : 1 f π D 2 f π π, and f π is superadditive 3 if π is superadditive, then π = f π. Proof:
20 Superadditive Dual Duality Continuous Case Discrete Case LP formulation Superadditive Dual Let D := {α N m α b}. Then the dual of max{c Eq Mq = r, q 0} is min γ s.t γ(b) γ(0) γ(α + A j ) γ(α) c j, α + A j D, j = 1,..., n Letting π(α) = γ(α) γ(0), α D and extending π to N m, the dual becomes ρ 1 = min π D s.t π(b) π(α + A j ) π(α) c j, α D, j = 1,..., n
21 Superadditive Dual Duality Continuous Case Discrete Case LP formulation Superadditive Dual Now, assume that f d (b, c) > and consider the following problem ρ 2 = inf π D s.t f π(b) f π(a j ) c j, j = 1,..., n where f π : N m R defined as before for every π D. Then, f d (b, c) = ρ 1 = ρ 2 = f π (b) for some π D Proof: Example:
22 Superadditive Dual Duality Continuous Case Discrete Case LP formulation Superadditive Dual Note the similar dual formulation of Wolsey min π s.t π(b) π(λ) + π(µ) π(λ + µ), 0 λ + µ b π(a j ) c j, j = 1,..., n π(0) = 0 where the first constraint set state that π : D R is superadditive. The number of variables are the same, however, this one has O(p 2 ) constraints whereas the introduced one has O(np).
DUALITY AND INTEGER PROGRAMMING. Jean B. LASSERRE
LABORATOIRE d ANALYSE et d ARCHITECTURE des SYSTEMES DUALITY AND INTEGER PROGRAMMING Jean B. LASSERRE 1 Current solvers (CPLEX, XPRESS-MP) are rather efficient and can solve many large size problems with
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 informationDUALITY AND A FARKAS LEMMA FOR INTEGER PROGRAMS
DUALITY AND A FARKAS LEMMA FOR INTEGER PROGRAMS JEAN B. LASSERRE Abstract. We consider the integer program max{c x Ax = b, x N n }. A formal parallel between linear programming and continuous integration
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 informationChapter 2 Duality and a Farkas lemma for integer programs
Chapter 2 Duality and a Farkas lemma for integer programs Jean B. Lasserre Abstract We consider the integer program max{c x Ax = b, x N n }.A formal parallel between linear programming and continuous integration,
More informationSpringer Series in Operations Research and Financial Engineering. Series Editors: Thomas V. Mikosch Sidney I. Resnick Stephen M.
Springer Series in Operations Research and Financial Engineering Series Editors: Thomas V. Mikosch Sidney I. Resnick Stephen M. Robinson Springer Series in Operations Research and Financial Engineering
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More informationIP Duality. Menal Guzelsoy. Seminar Series, /21-07/28-08/04-08/11. Department of Industrial and Systems Engineering Lehigh University
IP Duality Department of Industrial and Systems Engineering Lehigh University COR@L Seminar Series, 2005 07/21-07/28-08/04-08/11 Outline Duality Theorem 1 Duality Theorem Introduction Optimality Conditions
More informationDuality for Mixed-Integer Linear Programs
Duality for Mixed-Integer Linear Programs M. Guzelsoy T. K. Ralphs Original May, 006 Revised April, 007 Abstract The theory of duality for linear programs is well-developed and has been successful in advancing
More informationThe Value function of a Mixed-Integer Linear Program with a Single Constraint
The Value Function of a Mixed Integer Linear Programs with a Single Constraint MENAL GUZELSOY TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu University of Wisconsin February
More informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
More informationOn the Value Function of a Mixed Integer Linear Program
On the Value Function of a Mixed Integer Linear Program MENAL GUZELSOY TED RALPHS ISE Department COR@L Lab Lehigh University ted@lehigh.edu AIRO, Ischia, Italy, 11 September 008 Thanks: Work supported
More informationVALID INEQUALITIES FOR MIXED-INTEGER LINEAR PROGRAMMING PROBLEMS
VALID INEQUALITIES FOR MIXED-INTEGER LINEAR PROGRAMMING PROBLEMS BY EMRE YAMANGIL A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial fulfillment
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Ricardo Fukasawa University of Waterloo rfukasaw@math.uwaterloo.ca September 16, 2010 Oktay Günlük IBM Research
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationThe Value function of a Mixed-Integer Linear Program with a Single Constraint
The Value Function of a Mixed Integer Linear Programs with a Single Constraint MENAL GUZELSOY TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu OPT 008, Atlanta, March 4, 008 Thanks:
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 informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationMathematical Optimisation, Chpt 2: Linear Equations and inequalities
Introduction Gauss-elimination Orthogonal projection Linear Inequalities Integer Solutions Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Peter J.C. Dickinson p.j.c.dickinson@utwente.nl
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 informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationINTEGRATION WORKSHOP 2004 COMPLEX ANALYSIS EXERCISES
INTEGRATION WORKSHOP 2004 COMPLEX ANALYSIS EXERCISES PHILIP FOTH 1. Cauchy s Formula and Cauchy s Theorem 1. Suppose that γ is a piecewise smooth positively ( counterclockwise ) oriented simple closed
More information1. Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials.
Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials A rational function / is a quotient of two polynomials P, Q with 0 By Fundamental Theorem of algebra, =
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 579 586 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Low rank perturbation
More informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash Ricardo Fukasawa IBM Research February 17, 2009 Oktay Günlük Abstract The master equality polyhedron (MEP) is a canonical set that generalizes
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationSemidefinite Programming
Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i
More informationSolutions to sample final questions
Solutions to sample final questions To construct a Green function solution, consider finding a solution to the equation y + k y δx x where x is a parameter In the regions x < x and x > x y + k y By searching
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationApproximate Farkas Lemmas in Convex Optimization
Approximate Farkas Lemmas in Convex Optimization Imre McMaster University Advanced Optimization Lab AdvOL Graduate Student Seminar October 25, 2004 1 Exact Farkas Lemma Motivation 2 3 Future plans The
More informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
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 informationPolynomiality of Linear Programming
Chapter 10 Polynomiality of Linear Programming In the previous section, we presented the Simplex Method. This method turns out to be very efficient for solving linear programmes in practice. While it is
More informationINTRODUCTION TO PADÉ APPROXIMANTS. E. B. Saff Center for Constructive Approximation
INTRODUCTION TO PADÉ APPROXIMANTS E. B. Saff Center for Constructive Approximation H. Padé (1863-1953) Student of Hermite Histhesiswon French Academy of Sciences Prize C. Hermite (1822-1901) Used Padé
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationReformulation and Sampling to Solve a Stochastic Network Interdiction Problem
Network Interdiction Stochastic Network Interdiction and to Solve a Stochastic Network Interdiction Problem Udom Janjarassuk Jeff Linderoth ISE Department COR@L Lab Lehigh University jtl3@lehigh.edu informs
More informationHomework 27. Homework 28. Homework 29. Homework 30. Prof. Girardi, Math 703, Fall 2012 Homework: Define f : C C and u, v : R 2 R by
Homework 27 Define f : C C and u, v : R 2 R by f(z) := xy where x := Re z, y := Im z u(x, y) = Re f(x + iy) v(x, y) = Im f(x + iy). Show that 1. u and v satisfies the Cauchy Riemann equations at (x, y)
More informationIntroduction to Mathematical Programming IE406. Lecture 13. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 13 Dr. Ted Ralphs IE406 Lecture 13 1 Reading for This Lecture Bertsimas Chapter 5 IE406 Lecture 13 2 Sensitivity Analysis In many real-world problems,
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationis equal to = 3 2 x, if x < 0 f (0) = lim h = 0. Therefore f exists and is continuous at 0.
Madhava Mathematics Competition January 6, 2013 Solutions and scheme of marking Part I N.B. Each question in Part I carries 2 marks. p(k + 1) 1. If p(x) is a non-constant polynomial, then lim k p(k) (a)
More informationMathematical Optimisation, Chpt 2: Linear Equations and inequalities
Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Peter J.C. Dickinson p.j.c.dickinson@utwente.nl http://dickinson.website version: 12/02/18 Monday 5th February 2018 Peter J.C. Dickinson
More informationJournal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics 234 (2) 538 544 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationAdditional Homework Problems
Additional Homework Problems Robert M. Freund April, 2004 2004 Massachusetts Institute of Technology. 1 2 1 Exercises 1. Let IR n + denote the nonnegative orthant, namely IR + n = {x IR n x j ( ) 0,j =1,...,n}.
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 informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationProblems for MATH-6300 Complex Analysis
Problems for MATH-63 Complex Analysis Gregor Kovačič December, 7 This list will change as the semester goes on. Please make sure you always have the newest version of it.. Prove the following Theorem For
More informationSemidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry
Semidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry assoc. prof., Ph.D. 1 1 UNM - Faculty of information studies Edinburgh, 16. September 2014 Outline Introduction Definition
More informationOptimization over Polynomials with Sums of Squares and Moment Matrices
Optimization over Polynomials with Sums of Squares and Moment Matrices Monique Laurent Centrum Wiskunde & Informatica (CWI), Amsterdam and University of Tilburg Positivity, Valuations and Quadratic Forms
More informationAdvanced SDPs Lecture 6: March 16, 2017
Advanced SDPs Lecture 6: March 16, 2017 Lecturers: Nikhil Bansal and Daniel Dadush Scribe: Daniel Dadush 6.1 Notation Let N = {0, 1,... } denote the set of non-negative integers. For α N n, define the
More informationHilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationCuts for mixed 0-1 conic programs
Cuts for mixed 0-1 conic programs G. Iyengar 1 M. T. Cezik 2 1 IEOR Department Columbia University, New York. 2 GERAD Université de Montréal, Montréal TU-Chemnitz Workshop on Integer Programming and Continuous
More information10 Karmarkars Algorithm
We want to solve the following linear program: min v = c t x subject to Ax = 0 and x. Here = {x R n e t x = 1, x 0} with e t = (1,..., 1) denotes the standard simplex in R n. Further assumptions: 1. A
More informationComplex Analysis, Stein and Shakarchi Meromorphic Functions and the Logarithm
Complex Analysis, Stein and Shakarchi Chapter 3 Meromorphic Functions and the Logarithm Yung-Hsiang Huang 217.11.5 Exercises 1. From the identity sin πz = eiπz e iπz 2i, it s easy to show its zeros are
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Awards Screening Test. February 25, Time Allowed: 90 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Awards Screening Test February 25, 2006 Time Allowed: 90 Minutes Maximum Marks: 40 Please read, carefully, the instructions on the following page before you
More informationA BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY
APPLICATIONES MATHEMATICAE 23,2 (1995), pp. 151 167 G. SCHEITHAUER and J. TERNO (Dresden) A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY Abstract. Many numerical computations
More informationMarch 2002, December Introduction. We investigate the facial structure of the convex hull of the mixed integer knapsack set
ON THE FACETS OF THE MIXED INTEGER KNAPSACK POLYHEDRON ALPER ATAMTÜRK Abstract. We study the mixed integer knapsack polyhedron, that is, the convex hull of the mixed integer set defined by an arbitrary
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationLagrange duality. The Lagrangian. We consider an optimization program of the form
Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationProving the Regularity of the Minimal Probability of Ruin via a Game of Stopping and Control
Proving the Regularity of the Minimal Probability of Ruin via a Game of Stopping and Control Erhan Bayraktar University of Michigan joint work with Virginia R. Young, University of Michigan K αρλoβασi,
More informationOptimization Theory. A Concise Introduction. Jiongmin Yong
October 11, 017 16:5 ws-book9x6 Book Title Optimization Theory 017-08-Lecture Notes page 1 1 Optimization Theory A Concise Introduction Jiongmin Yong Optimization Theory 017-08-Lecture Notes page Optimization
More informationLECTURE 10 LECTURE OUTLINE
LECTURE 10 LECTURE OUTLINE Min Common/Max Crossing Th. III Nonlinear Farkas Lemma/Linear Constraints Linear Programming Duality Convex Programming Duality Optimality Conditions Reading: Sections 4.5, 5.1,5.2,
More informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationThe moment-lp and moment-sos approaches
The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY
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 informationOQ4867. Let ABC be a triangle and AA 1 BB 1 CC 1 = {M} where A 1 BC, B 1 CA, C 1 AB. Determine all points M for which ana 1...
764 Octogon Mathematical Magazine, Vol. 24, No.2, October 206 Open questions OQ4867. Let ABC be a triangle and AA BB CC = {M} where A BC, B CA, C AB. Determine all points M for which 4 s 2 3r 2 2Rr AA
More informationDetermine for which real numbers s the series n>1 (log n)s /n converges, giving reasons for your answer.
Problem A. Determine for which real numbers s the series n> (log n)s /n converges, giving reasons for your answer. Solution: It converges for s < and diverges otherwise. To see this use the integral test,
More informationOn duality gap in linear conic problems
On duality gap in linear conic problems C. Zălinescu Abstract In their paper Duality of linear conic problems A. Shapiro and A. Nemirovski considered two possible properties (A) and (B) for dual linear
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationOn the Value Function of a Mixed Integer Linear Optimization Problem and an Algorithm for its Construction
On the Value Function of a Mixed Integer Linear Optimization Problem and an Algorithm for its Construction Ted K. Ralphs and Anahita Hassanzadeh Department of Industrial and Systems Engineering, Lehigh
More information. Then g is holomorphic and bounded in U. So z 0 is a removable singularity of g. Since f(z) = w 0 + 1
Now we describe the behavior of f near an isolated singularity of each kind. We will always assume that z 0 is a singularity of f, and f is holomorphic on D(z 0, r) \ {z 0 }. Theorem 4.2.. z 0 is a removable
More informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
More informationPart IB. Complex Analysis. Year
Part IB Complex Analysis Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section I 2A Complex Analysis or Complex Methods 7 (a) Show that w = log(z) is a conformal
More informationRenyi divergence and asymptotic theory of minimal K-point random graphs Alfred Hero Dept. of EECS, The University of Michigan, Summer 1999
Renyi divergence and asymptotic theory of minimal K-point random graphs Alfred Hero Dept. of EECS, The University of Michigan, Summer 999 Outline Rényi Entropy and Rényi Divergence ffl Euclidean k-minimal
More information1 Overview. 2 Extreme Points. AM 221: Advanced Optimization Spring 2016
AM 22: Advanced Optimization Spring 206 Prof. Yaron Singer Lecture 7 February 7th Overview In the previous lectures we saw applications of duality to game theory and later to learning theory. In this lecture
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Yogesh Awate Tepper School of Business, Carnegie Mellon University, Pittsburgh,
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationELE539A: Optimization of Communication Systems Lecture 16: Pareto Optimization and Nonconvex Optimization
ELE539A: Optimization of Communication Systems Lecture 16: Pareto Optimization and Nonconvex Optimization Professor M. Chiang Electrical Engineering Department, Princeton University March 16, 2007 Lecture
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationReal eigenvalues of nonsymmetric tensors
Comput Optim Appl (208) 70: 32 https://doi.org/0.007/s0589-07-9973-y Real eigenvalues of nonsymmetric tensors Jiawang Nie Xinzhen Zhang 2 Received: 30 May 207 / Published online: 4 December 207 Springer
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 informationSolutions Chapter 5. The problem of finding the minimum distance from the origin to a line is written as. min 1 2 kxk2. subject to Ax = b.
Solutions Chapter 5 SECTION 5.1 5.1.4 www Throughout this exercise we will use the fact that strong duality holds for convex quadratic problems with linear constraints (cf. Section 3.4). The problem of
More information