Numerical Optimization
|
|
- April Blair
- 5 years ago
- Views:
Transcription
1 Linear Programming Computer Science and Automation Indian Institute of Science Bangalore , India. NPTEL Course on
2 min x s.t. Transportation Problem ij c ijx ij 3 j=1 x ij a i, i = 1, 2 2 i=1 x ij b j, j = 1, 2, 3 x ij 0 i, j a i : Capacity of the plant Fi b j : Demand of the outlet Rj c ij : Cost of shipping one unit of product from Fi to Rj x ij : Number of units of the product shipped from Fi to Rj (variables) The objective is to minimize ij c ijx ij 3 j=1 x ij a i, i = 1, 2 (constraints) 2 i=1 x ij b j, j = 1, 2, 3 (constraints) x ij 0 i, j (constraints)
3 The Diet Problem: Find the most economical diet that satisfies minimum nutritional requirements. Number of food items: n Number of nutritional ingredient: m Each person must consume at least b j units of nutrient j per day Unit cost of food item i: c i Each unit of food item i contains a ji units of the nutrient j Number of units of food item i consumed: x i Constraint corresponding to the nutrient j: Cost: a j1 x 1 + a j2 x a jn x n b j, x i 0 i c 1 x 1 + c 2 x c n x n
4 Problem: min s.t. c 1 x 1 + c 2 x c n x n a j1 x 1 + a j2 x a jn x n b j j x i 0 i Given: c = (c 1,..., c n ) T, A = (a 1... a n ), b = (b 1,..., b m ) T. Linear Programming Problem (LP): min s.t. c T x Ax b x 0 where A R m n, c R n and b R m. Assumption: m n, rank(a) = m Linear Constraints can be of the form Ax = b or Ax b
5 Constraint (Feasible) Set: Inequality constraint of the type {x : a T x b} or {x : a T x b} denotes a half space Equality constraint, {x : a T x = b}, represents an affine space Non-negativity constraint, x 0 Constraint set of an LP is a convex set Polyhedral Set X = {x : Ax b, x 0} Polytope: A bounded polyhedral set
6 Consider the constraint set in R 2 : {(x 1, x 2 ) : x 1 + x 2 2, x 1 1, x 1 0, x 2 0}
7 Consider the constraint set in R 2 : {(x 1, x 2 ) : x 1 1, x 2 x 1 }
8 Feasible set can be a singleton set Feasible Set = {(x 1, x 2 ) : x 1 + x 2 = 2, x 1 + x 2 = 1} = {A}
9 Feasible set can be empty! Feasible Set = {(x 1, x 2 ) : x 1 + x 2 2, x 1 + x 2 1} = φ
10 Definition Let X be a convex set. A point x X is said to be an extreme point (corner point or vertex) of X if x cannot be represented as a strict convex combination of two distinct points in X. Extreme Points: A, B, C and D. E is not an extreme point.
11 Extreme Point: A
12 Constraint Set: X = {(x 1, x 2 ) : x 1 + x 2 2, x 1 1, x 1 0, x 2 0} 4 constraints in R 2 Two constraints are binding (active) at every extreme point Fewer than two constraints are binding at other points
13 Consider the constraint set: X = {x : Ax b, x 0} where A R m n and rank(a) = m. m + n hyperplanes associated with m + n halfspaces m + n halfspaces define X An extreme point lies on n linearly independent defining hyperplanes of X If X is nonempty, the set of extreme points of X is not empty and has a finite number of points. An edge of X is formed by intersection of n 1 linearly independent hyperplanes Two extreme points of X are said to be adjacent if the line segment joining them is an edge of X
14 For example, B and C are adjacent points Adjacent extreme points have n 1 common binding linearly independent hyperplanes
15 Remarks: Consider the constraint set: X = {x : Ax = b, x 0} where A R m n and rank(a) = m. Let x X be an extreme point of X m equality constraints are active at x Therefore, n m additional hyperplanes (from the non-negativity constraints) are active at x
16 Geometric Solution of a LP: min c T x s.t. Ax b x 0 where A R m n, c R n and b R m.
17
18
19
20
21
22
23 Example: min 2x 1 x 2 s.t. x 1 + x 2 5 x 1 + 2x 2 6 x 1, x 2 0
24 Example: min 2x 1 x 2 s.t. x 1 + x 2 5 x 1 + 2x 2 6 x 1, x 2 0
25 Example: min 2x 1 x 2 s.t. x 1 + x 2 5 x 1 + 2x 2 6 x 1, x 2 0
26 Example: min 2x 1 x 2 s.t. x 1 + x 2 5 x 1 + 2x 2 6 x 1, x 2 0
27 Example: min s.t. c T x x X
28 Example: min s.t. c T x x X
29 Example: min s.t. c T x x X
30 Example: min s.t. c T x x X
31 Consider a linear programming problem LP: min c T x s.t. a T i x (, =, ) b i, i = 1,..., m x 0 Let X = {x : a T i x (, =, ) b i, i = 1,..., m, x 0}. Remarks: X is a closed convex set The set of optimal solutions is a convex set. The linear program may have no solution or a unique solution or infinitely many solutions. If x is an optimal solution to LP, then x must be a boundary point of X. If z = c T x, then {x : c T x = z} is a supporting hyperplane to X. If X is compact and if there is an optimal solution to LP, then at least one extreme point of X is an optimal solution to the linear programming problem.
32 LP in Standard Form: min s.t. c T x Ax = b x 0 where A R m n and rank(a) = m. Assumption: Feasible set is non-empty
33 Any linear program can be converted to the Standard Form. (a) max c T x = min c T x (b) Constraint of the type a T x b, x 0 can be written as a T x + y = b x 0 y 0
34 (c) Constraint of the type a T x b, x 0 can be written as a T x z = b x 0 z 0 (d) Free variables (x i R) can be defined as x i = x i + xi, x i + 0, xi 0
35 Example: min x 1 2x 2 3x 3 s.t. x 1 + 2x 2 + x 3 14 x 1 + 2x 2 + 4x 3 12 x 1 x 2 + x 3 = 2 x 1, x 2 unrestricted Write the constraints as equality x 3 3constraints x 1 + 2x 2 + x 3 + x 4 = 14, x 4 0 x 1 + 2x 2 + 4x 3 x 5 = 12, x 5 0 Define new variables x + 1, x 1, x+ 2, x 2 and x 3 such that x 1 = x + 1 x 1, where x+ 1 0, x 1 0 x 2 = x + 2 x 2, where x+ 2 0, x 2 0 x 3 = 3 x 3 so that x 3 0
36 Therefore, the program min x 1 2x 2 3x 3 s.t. x 1 + 2x 2 + x 3 14 x 1 + 2x 2 + 4x 3 12 x 1 x 2 + x 3 = 2 x 1, x 2 unrestricted x 3 3 can be converted to the standard form: min x + 1 x 1 2(x+ 2 x 2 ) + 3(3 + x 3) s.t. x + 1 x 1 + 2(x+ 2 x 2 ) x 3 + x 4 = 17 x + 1 x 1 + 2(x+ 2 x 2 ) 4x 3 x 5 = 24 x + 1 x 1 x+ 2 + x 2 x 3 = 5 x + 1, x 1, x+ 2, x 2, x 3, x 4, x 5 0
37 Consider the linear program in standard form (SLP): min s.t. c T x Ax = b x 0 where A R m n, rank(a) = rank(a b) = m. Let B R m m be formed using m linearly independent columns of A. Therefore, the system of equations, Ax = b can be written as, ( ) xb (B N) = b. Letting x N = 0, we get x N Bx B = b x B = B 1 b. (x B : Basic Variables) (x B 0) T : Basic solution w.r.t. the basis matrix B
38 Basic Feasible Solution If x B 0, then (x B w.r.t. the basis matrix B. 0) T is called a basic feasible solution of Ax = b x 0 Theorem Let X = {x : Ax = b, x 0}. x is an extreme point of X if and only if x is a basic feasible solution of Ax = b x 0.
39 Proof. (a) Let x be a basic feasible solution of Ax = b, x 0. Therefore, x = (x 1,..., x }{{ m, 0,..., 0). Let B = (a }}{{} 1 a 2... a m ) 0 n m where a 1,..., a m are linearly independent. So, x 1 a x m a m = b. Suppose x is not an extreme point of X. Let y, z X, y z and x = αy + (1 α)z, 0 < α < 1. Since y, z 0, we have y m+1 =... = y n = 0 z m+1 =... = z n = 0 } and y 1a y m a m = b z 1 a z m a m = b Since a 1,..., a m are linearly independent, x = y = z, a contradiction. So, x is an extreme point of X.
40 Proof.(continued) (b) Let x be an extreme point of X. x X Ax = b, x 0. There exist n linearly independent constraints active at x. m active constraints associated with Ax = b. n m active constraints associated with n m non-negativity constraints x is the unique solution of Ax = b, x N = 0. Ax = b Bx B + Nx N = b x B = B 1 b 0 Therefore, x = (x B x N ) T is a basic feasible solution. ( ) n Number of basic solutions m Enough to search the finite set of vertices of X to get an optimal solution
41 Theorem Let X be non-empty and compact constraint set of a linear program. Then, an optimal solution to the linear program exists and it is attained at a vertex of X. Proof. Objective function, c T x, of the linear program is continuous and the constraint set is compact. Therefore, by Weierstrass Theorem, optimal solution exists. The set of vertices, {x 1,..., x k }, of X is finite. Therefore, X is the convex hull of x 1,..., x k. Hence, for every x X, x = k i=1 α ix i where α i 0, k i=1 α i = 1. Let z = min 1 i k c T x i. Therefore, for any x X, z = c T x = k i=1 α ic T x i z k i=1 α i = z. So, the minimum value of c T x is attained at a vertex of X.
42 Consider the constraints: x 1 + x 2 2 x 1 1 x 1, x 2 0
43 The given constraints x 1 + x 2 2 x 1 1 x 1, x 2 0 can be written in the form, Ax = b, x 0: Let A = x 1 +x 2 + x 3 = 2 x 1 +x 4 = 1 x 1, x 2, x 3, x 4 0 ( ) ( = (a a 2 a 3 a 4 ) and b = 1 ).
44 ( ) A = = (a a 2 a 3 a 4 ) and b = ( ) 1 1 (1) B = (a 1 a 2 ) = 1 0 ( 2 1 ). x B = (x 1 x 2 ) T = B 1 b = (1 1) T and x N = (x 3 x 4 ) T = (0 0) T. x = (x B x N ) T corresponds to the vertex C.
45 ( ) A = = (a a 2 a 3 a 4 ) and b = ( ) 1 1 (2) B = (a 1 a 3 ) = 1 0 ( 2 1 ). x B = (x 1 x 3 ) T = B 1 b = (1 1) T and x N = (x 2 x 4 ) T = (0 0) T. x = (x B x N ) T corresponds to the vertex B.
46 ( ) ( A = = (a a 2 a 3 a 4 ) and b = 1 ( ) 1 0 (3) B = (a 1 a 4 ) = 1 1 ). x B = (x 1 x 4 ) T = B 1 b = (2 1) T and x N = (x 2 x 3 ) T = (0 0) T. x = (x B x N ) T is not a basic feasible point
47 ( ) A = = (a a 2 a 3 a 4 ) and b = ( ) 1 0 (4) B = (a 2 a 4 ) = 0 1 ( 2 1 ). x B = (x 2 x 4 ) T = B 1 b = (2 1) T and x N = (x 1 x 3 ) T = (0 0) T. x = (x B x N ) T corresponds to the vertex D.
48 ( ) A = = (a a 2 a 3 a 4 ) and b = ( ) 1 0 (5) B = (a 3 a 4 ) = 0 1 ( 2 1 ). x B = (x 3 x 4 ) T = B 1 b = (2 1) T and x N = (x 1 x 2 ) T = (0 0) T. x = (x B x N ) T corresponds to the vertex A.
49 Example: min 3x 1 x 2 s.t. x 1 + x 2 2 x 1 1 x 1, x 2 0
Linear Algebra Review: Linear Independence. IE418 Integer Programming. Linear Algebra Review: Subspaces. Linear Algebra Review: Affine Independence
Linear Algebra Review: Linear Independence IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 21st March 2005 A finite collection of vectors x 1,..., x k R n
More informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationConvex Sets with Applications to Economics
Convex Sets with Applications to Economics Debasis Mishra March 10, 2010 1 Convex Sets A set C R n is called convex if for all x, y C, we have λx+(1 λ)y C for all λ [0, 1]. The definition says that for
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
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 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 informationConvex Sets. Prof. Dan A. Simovici UMB
Convex Sets Prof. Dan A. Simovici UMB 1 / 57 Outline 1 Closures, Interiors, Borders of Sets in R n 2 Segments and Convex Sets 3 Properties of the Class of Convex Sets 4 Closure and Interior Points of Convex
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
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 information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
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 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 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 informationLinear Programming. Operations Research. Anthony Papavasiliou 1 / 21
1 / 21 Linear Programming Operations Research Anthony Papavasiliou Contents 2 / 21 1 Primal Linear Program 2 Dual Linear Program Table of Contents 3 / 21 1 Primal Linear Program 2 Dual Linear Program Linear
More informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3 - Sept. 7, 2012 Duality Theory
More information9.1 Linear Programs in canonical form
9.1 Linear Programs in canonical form LP in standard form: max (LP) s.t. where b i R, i = 1,..., m z = j c jx j j a ijx j b i i = 1,..., m x j 0 j = 1,..., n But the Simplex method works only on systems
More information1 Review of last lecture and introduction
Semidefinite Programming Lecture 10 OR 637 Spring 2008 April 16, 2008 (Wednesday) Instructor: Michael Jeremy Todd Scribe: Yogeshwer (Yogi) Sharma 1 Review of last lecture and introduction Let us first
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 informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
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 informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationPart 1. The Review of Linear Programming Introduction
In the name of God Part 1. The Review of Linear Programming 1.1. Spring 2010 Instructor: Dr. Masoud Yaghini Outline The Linear Programming Problem Geometric Solution References The Linear Programming Problem
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More information9. Geometric problems
9. Geometric problems EE/AA 578, Univ of Washington, Fall 2016 projection on a set extremal volume ellipsoids centering classification 9 1 Projection on convex set projection of point x on set C defined
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More informationTHE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM LEVI DELISSA. B.S., Kansas State University, 2014
THE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM by LEVI DELISSA B.S., Kansas State University, 2014 A THESIS submitted in partial fulfillment of the
More informationLinear Programming. Chapter Introduction
Chapter 3 Linear Programming Linear programs (LP) play an important role in the theory and practice of optimization problems. Many COPs can directly be formulated as LPs. Furthermore, LPs are invaluable
More informationIntroduction to Linear and Combinatorial Optimization (ADM I)
Introduction to Linear and Combinatorial Optimization (ADM I) Rolf Möhring based on the 20011/12 course by Martin Skutella TU Berlin WS 2013/14 1 General Remarks new flavor of ADM I introduce linear and
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian
More informationYinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method
The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapters 2.3-2.5, 3.1-3.4) 1 Geometry of Linear
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 informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
More information1. Consider the following polyhedron of an LP problem: 2x 1 x 2 + 5x 3 = 1 (1) 3x 2 + x 4 5 (2) 7x 1 4x 3 + x 4 4 (3) x 1, x 2, x 4 0
MA Linear Programming Tutorial 3 Solution. Consider the following polyhedron of an LP problem: x x + x 3 = ( 3x + x 4 ( 7x 4x 3 + x 4 4 (3 x, x, x 4 Identify all active constraints at each of the following
More informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
More informationIntroduction to Convex Analysis Microeconomics II - Tutoring Class
Introduction to Convex Analysis Microeconomics II - Tutoring Class Professor: V. Filipe Martins-da-Rocha TA: Cinthia Konichi April 2010 1 Basic Concepts and Results This is a first glance on basic convex
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 informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationDistributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
Distributed Real-Time Control Systems Lecture 13-14 Distributed Control Linear Programming 1 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can
More informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
More informationChapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek
Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
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 informationLinear programs, convex polyhedra, extreme points
MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear
More informationLECTURE 3 LECTURE OUTLINE
LECTURE 3 LECTURE OUTLINE Differentiable Conve Functions Conve and A ne Hulls Caratheodory s Theorem Reading: Sections 1.1, 1.2 All figures are courtesy of Athena Scientific, and are used with permission.
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationLinear Programming. Larry Blume Cornell University, IHS Vienna and SFI. Summer 2016
Linear Programming Larry Blume Cornell University, IHS Vienna and SFI Summer 2016 These notes derive basic results in finite-dimensional linear programming using tools of convex analysis. Most sources
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 information1 Convexity explains SVMs
1 Convexity explains SVMs The convex hull of a set is the collection of linear combinations of points in the set where the coefficients are nonnegative and sum to one. Two sets are linearly separable if
More informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
More informationCSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming
CSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming January 26, 2018 1 / 38 Liability/asset cash-flow matching problem Recall the formulation of the problem: max w c 1 + p 1 e 1 = 150
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationMath 5593 Linear Programming Week 1
University of Colorado Denver, Fall 2013, Prof. Engau 1 Problem-Solving in Operations Research 2 Brief History of Linear Programming 3 Review of Basic Linear Algebra Linear Programming - The Story About
More informationConvex Optimization and Modeling
Convex Optimization and Modeling Convex Optimization Fourth lecture, 05.05.2010 Jun.-Prof. Matthias Hein Reminder from last time Convex functions: first-order condition: f(y) f(x) + f x,y x, second-order
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationDuality in Linear Programming
Duality in Linear Programming Gary D. Knott Civilized Software Inc. 1219 Heritage Park Circle Silver Spring MD 296 phone:31-962-3711 email:knott@civilized.com URL:www.civilized.com May 1, 213.1 Duality
More informationCSCI : Optimization and Control of Networks. Review on Convex Optimization
CSCI7000-016: Optimization and Control of Networks Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one
More informationFarkas Lemma. Rudi Pendavingh. Optimization in R n, lecture 2. Eindhoven Technical University. Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15
Farkas Lemma Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture 2 Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15 Today s Lecture Theorem (Farkas Lemma, 1894) Let A be an m n matrix,
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
More informationA Brief Review on Convex Optimization
A Brief Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one convex, two nonconvex sets): A Brief Review
More informationThursday, May 24, Linear Programming
Linear Programming Linear optimization problems max f(x) g i (x) b i x j R i =1,...,m j =1,...,n Optimization problem g i (x) f(x) When and are linear functions Linear Programming Problem 1 n max c x n
More informationIntroduction to Linear Programming (LP) Mathematical Programming (MP) Concept
Introduction to Linear Programming (LP) 1. Mathematical Programming Concept 2. LP Concept 3. Standard Form 4. Assumptions 5. Consequences of Assumptions 6. Solution Approach 7. Solution Methods 8. Typical
More informationLecture 6 Simplex method for linear programming
Lecture 6 Simplex method for linear programming Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University,
More informationSubgradient. Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes. definition. subgradient calculus
1/41 Subgradient Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes definition subgradient calculus duality and optimality conditions directional derivative Basic inequality
More informationBoundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption
Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption Chiaki Hara April 5, 2004 Abstract We give a theorem on the existence of an equilibrium price vector for an excess
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationCONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS
CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS A Dissertation Submitted For The Award of the Degree of Master of Philosophy in Mathematics Neelam Patel School of Mathematics
More informationLecture Note 18: Duality
MATH 5330: Computational Methods of Linear Algebra 1 The Dual Problems Lecture Note 18: Duality Xianyi Zeng Department of Mathematical Sciences, UTEP The concept duality, just like accuracy and stability,
More informationLinear Programming. (Com S 477/577 Notes) Yan-Bin Jia. Nov 28, 2017
Linear Programming (Com S 4/ Notes) Yan-Bin Jia Nov 8, Introduction Many problems can be formulated as maximizing or minimizing an objective in the form of a linear function given a set of linear constraints
More informationChapter 2. Convex Sets: basic results
Chapter 2 Convex Sets: basic results In this chapter, we introduce one of the most important tools in the mathematical approach to Economics, namely the theory of convex sets. Almost every situation we
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 informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
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 information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
More informationSolutions to Review Questions, Exam 1
Solutions to Review Questions, Exam. What are the four possible outcomes when solving a linear program? Hint: The first is that there is a unique solution to the LP. SOLUTION: No solution - The feasible
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 informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationOptimization, Part 2 (november to december): mandatory for QEM-IMAEF, and for MMEF or MAEF who have chosen it as an optional course.
Paris. Optimization, Part 2 (november to december): mandatory for QEM-IMAEF, and for MMEF or MAEF who have chosen it as an optional course. Philippe Bich (Paris 1 Panthéon-Sorbonne and PSE) Paris, 2016.
More informationChapter 2: Unconstrained Extrema
Chapter 2: Unconstrained Extrema Math 368 c Copyright 2012, 2013 R Clark Robinson May 22, 2013 Chapter 2: Unconstrained Extrema 1 Types of Sets Definition For p R n and r > 0, the open ball about p of
More information2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α. 2.32 Definition A subset
More informationNumerical Optimization
Linear Programming - Interior Point Methods Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Example 1 Computational Complexity of Simplex Algorithm
More informationNormal Fans of Polyhedral Convex Sets
Set-Valued Analysis manuscript No. (will be inserted by the editor) Normal Fans of Polyhedral Convex Sets Structures and Connections Shu Lu Stephen M. Robinson Received: date / Accepted: date Dedicated
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More informationLinear Programming. Murti V. Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities
Linear Programming Murti V Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities murtis@umnedu September 4, 2012 Linear Programming 1 The standard Linear Programming (SLP) problem:
More informationLinear Programming. Leo Liberti. February 20, Abstract
Linear Programming Leo Liberti LIX, École Polytechnique, F-91128 Palaiseau, France (liberti@lix.polytechnique.fr) February 20, 2006 Abstract This paper is a short didactical introduction to Linear Programming
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 informationWeek 8. 1 LP is easy: the Ellipsoid Method
Week 8 1 LP is easy: the Ellipsoid Method In 1979 Khachyan proved that LP is solvable in polynomial time by a method of shrinking ellipsoids. The running time is polynomial in the number of variables n,
More information