C&O 355 Lecture 16 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

C&O 355 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
C&O 355 Lecture 15 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A.
Weighted Matching-Algorithms, Hamiltonian Cycles and TSP
Min-Max Relations, Hall’s Theorem, and Matching-Algorithms Graphs & Algorithms Lecture 5 TexPoint fonts used in EMF. Read the TexPoint manual before you.
The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
C&O 355 Lecture 6 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
C&O 355 Lecture 8 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
C&O 355 Lecture 9 N. Harvey TexPoint fonts used in EMF.
C&O 355 Mathematical Programming Fall 2010 Lecture 6 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.
C&O 355 Mathematical Programming Fall 2010 Lecture 9
C&O 355 Lecture 5 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
A study of Correlated Equilibrium Polytope By: Jason Sorensen.
C&O 355 Lecture 23 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Lecture #3; Based on slides by Yinyu Ye
C&O 355 Mathematical Programming Fall 2010 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
MATHEMATICS 3 Operational Analysis Štefan Berežný Applied informatics Košice
C&O 355 Lecture 4 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
C&O 355 Mathematical Programming Fall 2010 Lecture 20 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Mathematical Programming Fall 2010 Lecture 21 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Mathematical Programming Fall 2010 Lecture 15 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Lecture 20 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
How should we define corner points? Under any reasonable definition, point x should be considered a corner point x What is a corner point?
The Structure of Polyhedra Gabriel Indik March 2006 CAS 746 – Advanced Topics in Combinatorial Optimization.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
Matching Polytope, Stable Matching Polytope Lecture 8: Feb 2 x1 x2 x3 x1 x2 x3.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
C&O 355 Mathematical Programming Fall 2010 Lecture 17 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Mathematical Programming Fall 2010 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.
C&O 355 Lecture 2 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
C&O 355 Mathematical Programming Fall 2010 Lecture 2 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.
C&O 355 Mathematical Programming Fall 2010 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Mathematical Programming Fall 2010 Lecture 4 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A Image:
MA5241 Lecture 1 TO BE COMPLETED
Linear Programming (Convex) Cones  Def: closed under nonnegative linear combinations, i.e. K is a cone provided a 1, …, a p  K  R n, 1, …, p.
X y x-y · 4 -y-2x · 5 -3x+y · 6 x+y · 3 Given x, for what values of y is (x,y) feasible? Need: y · 3x+6, y · -x+3, y ¸ -2x-5, and y ¸ x-4 Consider the.
C&O 355 Mathematical Programming Fall 2010 Lecture 5 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.
Matrices and linear transformations For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers.
Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.
C&O 355 Lecture 7 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.
Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.
Proving that a Valid Inequality is Facet-defining  Ref: W, p  X  Z + n. For simplicity, assume conv(X) bounded and full-dimensional. Consider.
Linear Programming Back to Cone  Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they.
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
Lap Chi Lau we will only use slides 4 to 19
Topics in Algorithms Lap Chi Lau.
Proving that a Valid Inequality is Facet-defining
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
1.4 The Extreme Point Theorem : Geometry of a linear programming problem The set of feasible solutions to a general linear programming problem is a convex.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
I.4 Polyhedral Theory (NW)
Quantum Foundations Lecture 3
Quantum Foundations Lecture 2
Back to Cone Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they can be used to describe.
C&O 355 Lecture 3 N. Harvey Review of Lecture 2:
I.4 Polyhedral Theory.
Proving that a Valid Inequality is Facet-defining
(Convex) Cones Def: closed under nonnegative linear combinations, i.e.
BASIC FEASIBLE SOLUTIONS
1.2 Guidelines for strong formulations
Chapter 2. Simplex method
1.2 Guidelines for strong formulations
Presentation transcript:

C&O 355 Lecture 16 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A

Topics Review of Fourier-Motzkin Elimination Linear Transformations of Polyhedra Convex Combinations Convex Hulls Polytopes & Convex Hulls

Fourier-Motzkin Elimination Joseph FourierTheodore Motzkin Given a polyhedron Q µ R n, we want to find the set Q’ µ R n-1 satisfying (x 1, ,x n-1 ) 2 Q’, 9 x n s.t. (x 1, ,x n-1,x n ) 2 Q Q’ is called the projection of Q onto first n-1 coordinates Fourier-Motzkin Elimination constructs Q’ by generating (finitely many) constraints from the constraints of Q. Corollary: Q’ is a polyhedron.

Elimination Example x1x1 x2x2 Q Project Q onto coordinates {x 1, x 2 }... x3x3

Elimination Example x1x1 x2x2 x3x3 Q’ Project Q onto coordinates {x 1, x 2 }... Fourier-Motzkin: Q’ is a polyhedron. Of course, the ordering of coordinates is irrevelant.

Elimination Example x1x1 x2x2 x3x3 Q’’ Of course, the ordering of coordinates is irrevelant. Fourier-Motzkin: Q’’ is also a polyhedron. I can also apply Elimination twice…

Elimination Example x1x1 x2x2 x3x3 Q’’’ Fourier-Motzkin: Q’’’ is also a polyhedron.

Projecting a Polyhedron Onto Some of its Coordinates Lemma: Given a polyhedron Q µ R n. Let S={s 1,…,s k } µ {1,…,n} be any subset of the coordinates. Let Q S = { (x s1, ,x sk ) : x 2 Q } µ R k. In other words, Q S is projection of Q onto coordinates in S. Then Q S is a polyhedron. Proof: Direct from Fourier-Motzkin Elimination. Just eliminate all coordinates not in S. ¥

Linear Transformations of Polyhedra Lemma: Let P = { x : Ax · b } µ R n be a polyhedron. Let M be any matrix of size p x n. Let Q = { Mx : x 2 P } µ R p. Then Q is a polyhedron. x1x1 x3x3 P Let M = x2x2

Linear Transformations of Polyhedra Lemma: Let P = { x : Ax · b } µ R n be a polyhedron. Let M be any matrix of size p x n. Let Q = { Mx : x 2 P } µ R p. Then Q is a polyhedron. Geometrically obvious, but not easy to prove… x1x1 x2x2 x3x3 Q Let M =

Linear Transformations of Polyhedra Lemma: Let P = { x : Ax · b } µ R n be a polyhedron. Let M be any matrix of size p x n. Let Q = { Mx : x 2 P } µ R p. Then Q is a polyhedron. Geometrically obvious, but not easy to prove… …unless you know Fourier-Motzkin Elimination! Proof: Let P’ = { (x,y) : Mx=y, Ax · b } µ R n+p, where x 2 R n, y 2 R p. P’ is obviously a polyhedron. Note that Q is projection of P’ onto y-coordinates. By previous lemma, Q is a polyhedron. ¥

Convex Sets Let S µ R n be any set. Recall: S is convex if Proposition: The intersection of any collection of convex sets is itself convex. Proof: Exercise.

Convex Combinations Let S µ R n be any set. Definition: A convex combination of points in S is any point where k is finite and Theorem: (Carath é odory’s Theorem) It suffices to take k · n+1. Proof: This was Assignment 2, Problem 4.

Convex Combinations Theorem: Let S µ R n be a convex set. Let comb(S) = { p : p is a convex comb. of points in S }. Then comb(S) = S. Proof: S µ comb(S) is trivial.

Convex Combinations Theorem: Let S µ R n be a convex set. Let comb(S) = { p : p is a convex comb. of points in S }. Then comb(S) = S. Proof: We’ll show comb(S) µ S. Consider.. Need to show p 2 S. By induction on k. Trivial if k=1 or if ¸ k =1. So assume k>1 and ¸ k <1. Note: Note so p’ is a convex combination of at most k-1 points in S. By induction, p’ 2 S. But, so p 2 S since S is convex. ¥ Call this point p’

Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Convex Hulls

Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Convex Hulls

Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Claim: conv(S) is itself convex. Proof: Follows from our earlier proposition “Intersection of convex sets is convex”. ¥ Convex Hulls

Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Let comb(S) = { p : p is a convex comb. of points in S }. Theorem: conv(S)=comb(S). Proof: We’ll show conv(S) µ comb(S). Claim: comb(S) is convex. Proof: Consider and, where So p,q 2 comb(S). For ® 2 [0,1], consider Thus ® p + (1- ® )q 2 comb(S). ¤

Convex Hulls Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Let comb(S) = { p : p is a convex comb. of points in S }. Theorem: conv(S)=comb(S). Proof: We’ll show conv(S) µ comb(S). Claim: comb(S) is convex. Clearly comb(S) contains S. But conv(S) is the intersection of all convex sets containing S, so conv(S) µ comb(S). ¥

Convex Hulls Let S µ R n be any set. Definition: The convex hull of S, denoted conv(S), is the intersection of all convex sets containing S. Let comb(S) = { p : p is a convex comb. of points in S }. Theorem: conv(S)=comb(S). Proof: Exercise: Show comb(S) µ conv(S).

Convex Hulls of Finite Sets Theorem: Let S={s 1,…,s k } ½ R n be a finite set. Then conv(S) is a polyhedron. Geometrically obvious, but not easy to prove…

Convex Hulls of Finite Sets Theorem: Let S={s 1,…,s k } ½ R n be a finite set. Then conv(S) is a polyhedron. Geometrically obvious, but not easy to prove… …unless you know Fourier-Motzkin Elimination! Proof: Let M be the n x k matrix where M i = s i. By our previous theorem, But this is a projection of the polyhedron By our lemma on projections of polyhedra, conv(S) is also a polyhedron. ¥

Polytopes & Convex Hulls Let P ½ R n be a polytope. (i.e., a bounded polyhedron) Is P the convex hull of anything? Since P is convex, P = conv(P). Too obvious… Maybe P = conv( extreme points of P )?

Polytopes & Convex Hulls Theorem: Let P ½ R n be a non-empty polytope. Then P = conv( extreme points of P ). Proof: First we prove conv( extreme points of P ) µ P. We have: conv( extreme points of P ) µ conv( P ) µ P. Our earlier theorem proved comb(P) µ P Obvious

Polytopes & Convex Hulls Theorem: Let P ½ R n be a non-empty polytope. Then P = conv( extreme points of P ). Proof: Now we prove P µ conv( extreme points of P ). Let the extreme points be {v 1,…,v k }. (Finitely many!) Suppose 9 b 2 P n conv( extreme points of P ). Then the following system has no solution: By Farkas’ lemma, 9 u 2 R n and ® 2 R s.t. and So -u T b > -u T v i for every extreme point v i of P.

Polytopes & Convex Hulls Theorem: Let P ½ R n be a non-empty polytope. Then P = conv( extreme points of P ). Proof: Now we prove P µ conv( extreme points of P ). Let the extreme points be {v 1,…,v k }. (Finitely many!) Suppose 9 b 2 P n conv( extreme points of P ). Then the following system has no solution: … By Farkas’ lemma, 9 u 2 R n and ® 2 R s.t. and So -u T b > -u T v i for every extreme point v i of P. Consider the LP max { -u T x : x 2 P }. It is not unbounded, since P is bounded. Its optimal value is not attained at an extreme point. This is a contradiction. ¥

Generalizations Theorem: Every polytope in R n is the convex hull of its extreme points. Theorem: [Minkowski 1911] Every compact, convex set in R n is the convex hull of its extreme points. Theorem: [Krein & Milman 1940] Every compact convex subset of a locally convex Hausdorff linear space is the closed convex hull of its extreme points.

U NDERGRAD R ESEARCH A SSISTANTSHIPS (URA S ) FOR S PRING 2010 WITH THE C&O D EPT. D URATION :3-4 months during May - August, 2010 S ALARY :Around $2,500 per month E LIGIBILITY :Undergrads in Math or CS, with an A standing A PPLICATION :To apply, address the following documents to Professor I.P. Goulden: - cover letter - resume - recent grade report - names and addresses of two references B Y send documents to (No need to specify a particular area of interest, specialized background is not needed) L AST DATE FOR APPLICATIONS : D ECEMBER 14, All of this information can be accessed from our homepage