( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1
|
|
- Beatrix Baldwin
- 5 years ago
- Views:
Transcription
1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x, x, x 0 (,, ; λµ,, µ, µ ) = + + λ[ ] L x x x x x x y x x x ( x 0) ( x 0) ( x 0) + µ + µ + µ The frst-order condtons: Set (I) ( λµ µ µ ) U( x) L x;,,, = 0 = λ µ λ µ = x x x x x ( λµ µ µ ) U( x) L x;,,, = 0 = λ µ λ µ = x x x x x ( ; λµ,, µ, µ ) U( x) L x x = 0 = λ µ λ µ = x (.) (.) (.) Set (II) x+ x+ x y (.) λ 0 (.) λ y x x x = 0 (.) x x = 0 (.)
2 x x = 0 (.) x x = 0 (.) We have the followng ossble cases: (.),(.),(.) (Interor Soluton) x, x, x > 0 µ = 0 By (.), snce we are gven > 0 =,,, we get λ = > 0. Hence, by (.): x+ x+ x= y (.) x = (.) x From (.): x x = = = x x x x = 7 Thus, x = 7 Fnally: y x y + + = = = 7 x x x y x Hence, a canddate soluton s: x (,,, y) 7 7 = 7 y x x x = = 0, > 0 Thus, µ = 0 and by (.): λ = > 0
3 y Hence, by (.): x = y x= From (.): µ = > 0 Smlarly, from (.): µ = > 0 0 Hence, a canddate soluton for the UMP s: x (,,, y) = 0 y x, x > 0, x = 0 Thus, µ = 0 and by (.) or (.): λ > 0 Hence, by (.): x+ x= y (.) x = (.) x y y Hence, x = and x = But from (.): µ = > 0 snce the rce vector s strctly ostve. Ths result clearly volates our earler remse that µ = 0. Therefore, ths case cannot yeld a canddate soluton. Note that we don t need to check the sub-cases of each of the cases (a) x = x = 0, x > 0 and (b) x, x > 0, x = 0 where one of x, x s strctly ostve whle the other beng zero because, by the functonal form of the gven utlty functon, the zero element drves the entre frst term n the utlty functon to zero rresectve of the fact that the other element s non-zero. Hence, f for examle x = 0, there s no ont s wastng money on x. In other words, () otmal. x = 0, x > 0 and, smlarly, () x = 0, x > 0 could never be It s easy to verfy that, from the two canddate solutons that we found above, the frst one yelds the hghest level of utlty. Secfcally, y y U( x (,,, y) ) = + > = U( x (,,, y) ) 7 One would reach the same concluson by notcng nstead that from (.): µ = > 0.
4 Fnally, the Marshallan demand s gven: 7 (,,, ) x y 7 = y 7 The ndrect utlty functon was already calculated: y V (,,, y) U( x(,,, y) ) 7 (V) The Hcksan demand functon s the soluton to the followng exendture-mnmzaton roblem (EMP): mn ( x, x, x ) st.. whch s, of course, equvalent to: (,, ) U x x x = x x + x u x, x, x 0 max ( x, x, x ) ( x 0) ( x 0) ( x 0) x + x + x ( x x x ) + + st.. U( x ), x, x = xx + x u x, x, x 0 The Lagrangean: L( x, x, x ; λµ,, µ, µ ) ( x x x ) λ u ( x x ) x + µ + µ + µ =
5 The frst-order condtons: Set (I) ( ;,,, ) U( x) L x λµ µ µ λ = 0 λ = µ µ = x x x x x ( ;,,, ) U( x) L x λµ µ µ λ = 0 = µ µ = x x x x x ( ; λµ,, µ, µ ) U( x) L x x = 0 = µ µ = λ x (.) (.) (.) Set (II) x x + x u (.) λ 0 (.) λ u xx + x = 0 (.) x x = 0 (.) x x = 0 (.) x x = 0 (.) We have the followng ossble cases: (Interor Soluton) (.),(.),(.) x, x, x > 0 µ = 0 By (.), snce we are gven > 0 =,,, we get λ = > 0 Hence, by (.): (.) (.) x = x From (.): u = x x + x x = x = 7 x 5
6 Thus, x = 7 u = xx + x x = u 9 Fnally: 7 Hence, a canddate soluton s: h (,,, u) 7 = u 9 x x x = = 0, > 0 Thus, µ = 0 and by (.): λ = > 0 Hence, by (.): x = u From (.): µ = > 0 Smlarly, from (.): µ = > 0 0,,, = 0 u Hence, a canddate soluton for the EMP s: h ( u) x x x, > 0, = 0 Thus, µ = 0 and by (.) or (.): λ > 0 Hence, by (.): u = x x (.) (.) Hence, x = x u x = and x = u u u u u But from (.): µ = = > 0. Ths result clearly volates our earler remse that µ = 0. Therefore, ths case cannot yeld a canddate soluton. One would reach the same concluson by solvng nstead for notcng nstead for µ from (.). 6
7 Note that we don t need to check the sub-cases of each of the cases (a) x = x = 0, x > 0 and (b) x, x > 0, x = 0 where one of x, x s strctly ostve whle the other beng zero for exactly the same reason as n the UMP. It s easy to verfy that, from the two canddate solutons that we found above, the frst one yelds the lowest level of exendture. Secfcally, m h,,, u ( ( )) = h + h + h = u 7 < u = h + h + h ( (,,, )) = m h u Fnally, the Hcksan demand s gven: 7 (,,, ) h u 7 = u 9 The exendture functon was already calculated: m,,, u = m h,,, u ( ) ( ) h (,,, u) h (,,, u) h (,,, u) = + + = u 7 (E) 7
8 At the soluton onts for the UMP and EMP, we can nterchange usng the followng denttes: x y, = h u, = h V, y,. ( ) To see ths, consder the EMP when the agent s requred to acheve at least the utlty level corresondng to hs ndrect utlty level from (V) when rces and ncome are y., gven by We get from (V) for u = V (,,, y) y u = + 7 For ths requred reservaton level of utlty, the soluton to the EMP wll be gven: 7 7 h(,,, u) = = 7 7 y u = = x y 7 y 7 (,,, ). x( m, ( u, )) = h( u, ) To see ths, consder the UMP when the agent s ncome s the mnmum amount he needs n hs EMP n order to acheve at least a utlty level u. We get from (E) that the mnmum amount of money requred to acheve a reservaton level of utlty equal to u s gven: m(, u) = u 7 8
9 When ths s the amount of ncome avalable for the UMP, the soluton to the UMP wll be gven: 7 7 x(,,, m(, u) ) = = 7 7 e(, u ) u = = h (,, 7, u ) u 9. (, (, )) m V y = y To see ths, consder the EMP when the agent s requred to acheve at least the utlty level corresondng to hs ndrect utlty level from (V) when rces and ncome are gven by ( y., ) y We get from (V) for u = V (,,, y) : u = + 7 Now consder the EMP when the agent s requred to acheve ths as the reservaton level of hs utlty. From (E), the mnmum amount of money requred to acheve ths reservaton level of utlty s gven: y m(, u) = + = y (, (, )) V m u = u Consder the UMP when the agent s ncome s the mnmum amount he needs n hs EMP n order to acheve at least a utlty level u. We get from (E) that the mnmum amount of money requred to acheve a reservaton level of utlty equal to u s gven: m(, u) = u 7 9
10 When ths s the amount of ncome avalable for the UMP, the soluton to the UMP wll yeld a utlty level gven by (V): m(, u) V (, m(, u) ) = + = u + = u (B) Ths nvolves only algebra and I wll leave t to you to verfy. (C) Ths nvolves only algebra and I wll leave t to you to verfy. (D) Consder the followng (unconstraned) mnmzaton roblem:,, The frst order condtons: = = + = 7 mn V,,, x x V,,, x = = = = x 0 0 x 7 7 (D.) V,,, x = = = = x 0 0 x 7 7 (D.),,, = = = 0 = 0 x + x = 7 7 V x x x (whch holds whenever (D.) and (D.) do) 0
11 The mnmzed exendture (.e. the value functon) of the roblem s found by luggng the soluton nto the objectve. mn V,,,,, x = x = = + 7 = x x x 7 = x = x = x + 9 = x = x + = x + ( x x ) (,, x ) = U x x Consder now the followng (constraned) mnmzaton roblem: mn u (,, ) st.. e u = u x + x + x (, ),, 0 7
12 whch s, of course, equvalent to: max u (,, ) st.. u x x x,, 0 7 Note frst that we are lookng for a soluton to ths roblem, whch ought to be vald for all,, 0. In ths resect, ths roblem dffers substantally from the constraned otmzaton roblems that we have seen thus far n that we are no longer allowed to consder cases for our choce varables,,. In other words, comng u wth a canddate soluton that requres, for examle,, > 0 but s not vald when, > 0, = 0 wll not do here. We need to fnd a soluton that wll oerate as an dentty n the sense that wll be vald across all nteror and corner cases as long as,, 0. The Lagrangean: L(,, ; λµ,, µ, µ ) = u+ λ x x x + u 7 + µ + µ + µ ( 0) ( 0) ( 0) The frst-order condtons: Set (I) ( ; λµ,, µ, µ ) λ L = 0 = λ x µ 7 ( ; λµ,, µ, µ ) λ L 7 = 0 = λ x µ ( ; λµ,, µ, µ ) λ L = 0 λu = λ x µ 7 (D.I) (D.II) (D.III)
13 Set (II) u x+ x + x 7 (D..) λ 0 (D..) λ x + x + x u = 0 7 (D..) 0 µ = 0 (D..) 0 µ = 0 (D..) 0 µ = 0 (D..) Agan, we need a soluton, whch s to work for any,, 0. Therefore, t ought to work also when we have an nteror soluton.e.,, > 0 But ( D..),( D..),( D..),, > 0 µ = 0. Therefore, n our soluton, we requre: µ = 0 Smlarly, we must have λ > 0 n our soluton. For f we don t, we leave,, comletely free relatve to x, x and ths wll create roblems n the case where, > 0 = 0. Gven that µ = 0, observe that λ = 0 has all equatons but (D..) satsfed trvally rresectvely of the values of,, and x, x, x. To satsfy all condtons, we only need to worry about (D..). For, > 0 = 0, ths gves: x + x 0 whch cannot be satsfed for any, 0 > unless x = x = 0. But recall that the exendture functon m(, u ) was derved as the value functon of the EMP whch does admtted only a strctly nteror soluton where x, x, x > 0. Hence, we cannot have x = x = and consequently we cannot have λ = 0. 0
14 Take therefore µ = 0 and λ > 0 DI. x = DII. x From (D..) we get: u = x + x + x 7 u = x+ x + x + 7 Proceed now as n the dervaton of the result for the revous mnmzaton roblem (see. ) to derve the functonal form of u: u = x x + x (D) Ths nvolves only algebra (albet qute tedous n showng concavty of m(, u ) and convexty of V (, y) snce one needs to establsh the defnteness of the 4x4 Hessan matrces) and I wll leave t to you to verfy. (E) Ths nvolves only algebra and I wll leave t to you to verfy. (F) Ths nvolves only algebra and I wll leave t to you to verfy. Note, however, that there are some tyos n the text of ths art of the roblem set. The gven relatons should read: (. ) x( y, ) h( u, ) h( u, ) V y, = + u (, ) (, ) j j u= V y u= V y j (, ) x y, h u, V y, = u y j u= V y 4
15 (.) (, y) x x( y, ) h( u, ) y V y, = + (, j V y j ) u= V(, y) j y (, ) x y, h u, x y, = x (, y) y j j u= V y (, ) x y, m u, x y, = x (, y) y j j u= V y Problem (A) Consder the roft-maxmzaton roblem (PMP) : max ( z, z, z ) st.. z = = z 5 z z z z, z 0 The Lagrangean: L z z z z z z z z z = 5,, ; λµ,, µ = + λ + µ ( 0 ) + µ ( 0 ) The frst-order condtons: Set (I) ( ; λµ,, µ ) L z z = 0 λ = (.) ( ;,, ) L z λµ µ λ 4 = 0 = + z z 5 z z 5 L z; λµ,, µ λ 4 = 0 + z z 5 z z z 5 (.) (.) Note that only the two nut varables z, z are constraned (to be non-ostve) n ths roblem. 5
16 Set (II) z z z 5 (.) λ z λ 0 (.) z z 5 = (.) 0 z 0 µ z = 0 (.) z 0 µ z = 0 (.) From (.), t s clear that 0 λ >. Therefore, from (.): 5 z = z z Note that an obvous ont that satsfes all of our frst order condtons s the ont (,, ) ( 0,0,0) z z z z = = wth µ = > 0, µ = > 0. However, not roducng nothng at all results n zero roft. Consequently, any other vector z that generates a ostve amount of roft would be referred to the zero-ont and, thus, ths ont cannot be otmal. For exactly the same reason, any vector z nvolvng z = 0 for ether of =, cannot be otmal as t gves zero outut (.e. zero revenues from sales and non-ostve roft). We have only the followng case to consder: (.) (Interor Soluton) z =. z From (.) and (.): (.),(.) z, z < 0 µ = = ( zz ) z= z z z= = And z 5 = = = = z 6
17 Therefore z(,, ) = ( z, z, z ) =,, The roft functon s gven: π = z = = = π I wll leave to you to verfy that z = {,, } convex n (the latter exercse wll be rather tedous as you need to determne the defnteness of a x Hessan matrx). as well as that π s (B) The free dsosal roerty can be wrtten as follows: z = z, z, z T z% R : z% z z% z z% z T { } { } : 0 T = z R z >> We are gven that the roducton ossblty set (PPS): π s closed. { } : 0 Ths means that t ought to nclude ts boundary: π T = z R z = >> Consder ths boundary set. It conssts of those onts z that satsfy the relaton: π 0 (I). z = z = >> = 7
18 Note, however, that snce ths relaton s to hold for all strctly ostve rce vectors, t s really an dentty relaton wth resect to. Therefore, f we consder the gradent of each sde of (I) wth resect to, the two sdes should agree 4..e. = z = z = π >> 0 z = π >> 0 z π ( = ) = >> 0 = = z = π = {,,} >> 0 π In other words, we get: z = {,, } and ths ought to be a necessary condton, f (I) s to hold as an dentty for all rce vectors >> 0. Regardng the gven roft functon, we have: ( ) 4 + z = z = z = (I.) Note that (I.) s requred to hold as a system of equatons, for all >> 0. Therefore, t defnes the followng nter-relaton between the elements of the suly vector z: z z z, z 0 z > = + 8z = ( z + z) Essentally, I am usng the followng argument. Let f ( x) = g ( x) x domf domg (I) Then, clearly f g and, consequently, domf domg domf domg mles f x = g x x domf domg. f g domf domg domf domg. In other words, (I) 8
19 We are now n a oston of beng able to wrte the boundary set for the PPS under examnaton. { : π 0} T = z R z = >> { z R : z 0, z 0, 8z ( z z )} * z, z, ( z z ) : z, z R + = > > = + { } = + Recall now that the PPS has to satsfy the free dsosal roerty. Hence, t wll consst of the boundary set T and all vectors that le to the south-west of any gven ont on ths boundary..e. T = z, z, z R : z > 0, z > 0, 8z z + z or { } {,, : 0, 0, 8 } T = z z z R z > z > z + z z Notes: To comlete the dervaton of the roducton ossblty set T, you should verfy that the set gven here s convex. Ths s qute straght forward as t suffces to show that the boundary set s concave. ( + ) The roblem also asks for us to verfy that π = s ndeed the roft functon assocated wth ths roducton ossblty set. Ths calls merely for you to reeat art (A) of the roblem usng T = {( z ), z, z R : z > 0, z > 0, z + z 8z} as your roducton ossblty set. I wll, thus, leave t to you to show that ths actually works 5. 5 It would be agan clear from the FOC s on the Lagrangean that λ > 0. Thus: z + z = 8z z = z, z, z = 0,0,0 wth An obvous ont, agan, that satsfes all of the FOC s s the ont µ = > 0, µ = > 0. It s ruled out, though, for exactly the same reasonng as n art (A). However, here we cannot rule out a ror any vector z nvolvng z = 0 for ether of =, as long as t s not for both, snce such a vector does not necessarly gve zero total outut (as was the case n art (A)). 4 For z = 0, z > 0, the canddate soluton s z = ( z, z, z) = 0,,. Smlarly, z > 0, z = 0 gves z =,0,. The former gves a roft of whle the latter gves +. Nether beats the nteror soluton s roft. 9
Some Notes on Consumer Theory
Some Notes on Consumer Theory. Introducton In ths lecture we eamne the theory of dualty n the contet of consumer theory and ts use n the measurement of the benefts of rce and other changes. Dualty s not
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationAdvanced Topics in Optimization. Piecewise Linear Approximation of a Nonlinear Function
Advanced Tocs n Otmzaton Pecewse Lnear Aroxmaton of a Nonlnear Functon Otmzaton Methods: M8L Introducton and Objectves Introducton There exsts no general algorthm for nonlnear rogrammng due to ts rregular
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationEC3075 Mathematical Approaches to Economics
EC3075 Mathematal Aroahes to Eonoms etures 7-8: Dualt and Constraned Otmsaton Pemberton & Rau haters 7-8 Dr Gaa Garno [Astle Clarke Room 4 emal: gg44] Dualt n onsumer theor We wll exose the rmal otmsaton
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationThe Dirac Equation for a One-electron atom. In this section we will derive the Dirac equation for a one-electron atom.
The Drac Equaton for a One-electron atom In ths secton we wll derve the Drac equaton for a one-electron atom. Accordng to Ensten the energy of a artcle wth rest mass m movng wth a velocty V s gven by E
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationf(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) =
Problem Set 3: Unconstraned mzaton n R N. () Fnd all crtcal ponts of f(x,y) (x 4) +y and show whch are ma and whch are mnma. () Fnd all crtcal ponts of f(x,y) (y x ) x and show whch are ma and whch are
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationA NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011
A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,
More informationNon-Ideality Through Fugacity and Activity
Non-Idealty Through Fugacty and Actvty S. Patel Deartment of Chemstry and Bochemstry, Unversty of Delaware, Newark, Delaware 19716, USA Corresondng author. E-mal: saatel@udel.edu 1 I. FUGACITY In ths dscusson,
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationPROBLEM SET 7 GENERAL EQUILIBRIUM
PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationPoisson brackets and canonical transformations
rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More information14 Lagrange Multipliers
Lagrange Multplers 14 Lagrange Multplers The Method of Lagrange Multplers s a powerful technque for constraned optmzaton. Whle t has applcatons far beyond machne learnng t was orgnally developed to solve
More informationCommunication Complexity 16:198: February Lecture 4. x ij y ij
Communcaton Complexty 16:198:671 09 February 2010 Lecture 4 Lecturer: Troy Lee Scrbe: Rajat Mttal 1 Homework problem : Trbes We wll solve the thrd queston n the homework. The goal s to show that the nondetermnstc
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationPower-sum problem, Bernoulli Numbers and Bernoulli Polynomials.
Power-sum roblem, Bernoull Numbers and Bernoull Polynomals. Arady M. Alt Defnton 1 Power um Problem Fnd the sum n : 1... n where, n N or, usng sum notaton, n n n closed form. Recurrence for n Exercse Usng
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More information6. Hamilton s Equations
6. Hamlton s Equatons Mchael Fowler A Dynamcal System s Path n Confguraton Sace and n State Sace The story so far: For a mechancal system wth n degrees of freedom, the satal confguraton at some nstant
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationUniversity of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.
Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationImportant Instructions to the Examiners:
Summer 0 Examnaton Subject & Code: asc Maths (70) Model Answer Page No: / Important Instructons to the Examners: ) The Answers should be examned by key words and not as word-to-word as gven n the model
More informationMathematical Economics MEMF e ME. Filomena Garcia. Topic 2 Calculus
Mathematcal Economcs MEMF e ME Flomena Garca Topc 2 Calculus Mathematcal Economcs - www.seg.utl.pt/~garca/economa_matematca . Unvarate Calculus Calculus Functons : X Y y ( gves or each element X one element
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
More information(2mn, m 2 n 2, m 2 + n 2 )
MATH 16T Homewk Solutons 1. Recall that a natural number n N s a perfect square f n = m f some m N. a) Let n = p α even f = 1,,..., k. be the prme factzaton of some n. Prove that n s a perfect square f
More informationSupplementary Material for Spectral Clustering based on the graph p-laplacian
Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract
More informationLecture 10: Euler s Equations for Multivariable
Lecture 0: Euler s Equatons for Multvarable Problems Let s say we re tryng to mnmze an ntegral of the form: {,,,,,, ; } J f y y y y y y d We can start by wrtng each of the y s as we dd before: y (, ) (
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More information,, MRTS is the marginal rate of technical substitution
Mscellaneous Notes on roducton Economcs ompled by eter F Orazem September 9, 00 I Implcatons of conve soquants Two nput case, along an soquant 0 along an soquant Slope of the soquant,, MRTS s the margnal
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationANSWERS TO EVEN NUMBERED EXERCISES IN CHAPTER 9
S TO EVEN NUMBERED EXERCISES IN CHAPTER 9 SECTION 9: SIMULTANEOUS ONE SHOT GAMES Exercse 9- Vckrey Bddng Game Bdder values an tem for sale at 7 (thousand) and bdder at 8 (thousand) Each must submt a sealed
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationy i x P vap 10 A T SOLUTION TO HOMEWORK #7 #Problem
SOLUTION TO HOMEWORK #7 #roblem 1 10.1-1 a. In order to solve ths problem, we need to know what happens at the bubble pont; at ths pont, the frst bubble s formed, so we can assume that all of the number
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More information