3Maximum over a Collection of Convex Functions is Convex

3Maximum over a Collection of Convex Functions is Convex -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
The Maximum over a Collection of Convex Functions is Convex Consider V ( t ) = max x C f ( x,t ) where t lies in a convex subset T of R m and C is a subset of R n , n,m 1. Let a solution exist for every t T . Theorem If f ( x, · ) is convex for every x C , then V ( · ) is convex. Proof : Exercise. (Hint: Let t 0 , t 00 T , λ [0 , 1], and let x λ solve the problem at t = λt 00 +(1 - λ ) t 0 . Then V ( λt 00 + (1 - λ ) t 0 ) = f ( x λ ,λt 00 + (1 - λ ) t 0 ) ...). Example : π ( p,α ) = max q 0 { αpq - c ( q ) } , where c ( · ) is strictly increasing and strictly convex and α,p > 0. Since the objective function is affine in α , π ( p, · ) is convex in α . If the solution is unique, then, by
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the Envelope Theorem, / = pq * ( p, ). But since is convex in , / is nondecreasing in . And since p > 0, q * ( p, ) cannot decrease in . (If is C 2 , we have 2 / 2 = pq * ( p, ) / so that q * ( p, ) / 0.) f ( x 1 , t ) f ( x 2 , t ) V ( t ) t V , f The Maximum of a Collection of Convex Functions is Convex V ( t ) = max x { x 1 , x 2 } f ( x , t )...
View Full Document

This note was uploaded on 11/19/2010 for the course ECON 202 taught by Professor Schlee during the Spring '10 term at ASU.

Page1 / 2

3Maximum over a Collection of Convex Functions is Convex -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online