EC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
|
|
- Ellen Jefferson
- 5 years ago
- Views:
Transcription
1 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general quadratic form of a 11 x a 12 x 1 x 2 + a 22 x 2 2 ( ) ( ) a11 a 12 x1 can be written as ( x 1 x 2 ). 0 a 22 Solution: multiply the vector and the matrices and show that it yields the quadratic form. x 2 2. List all the principal minors of a general (3 3) matrix and denote which are the three leading principal submatrices. Solution: for a general 3 3 matrix, A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 there is one 3rd order principal minor, det(a). There are three 2nd order principal minors: ( ) a11 a 12 (1) det formed by deleting column 3 and row 3 from A, a 21 a 22
2 ( ) a11 a 13 (2) det formed by deleting column 2 and row 2 from A, a 31 a 33 ( ) a22 a 23 (3) det deleting column 1 and row 1 from A. a 21 a 33 Then, there are three 1st order principal minors: det(a 11 ) formed by deleting columns and rows 2,3, det(a 22 ) formed by deleting columns and rows 1,3, and det(a 33 ) formed by deleting columns and rows 1,2. Finally, the leading principal minors are det(a 11 ), det ( a11 a 12 a 21 a 22 ) and det(a). 3. Let C = ( c ), and determine the definiteness of C. Solution: Note that det(c 1 )=0 and that det(c 2 ) = 0. The definiteness of C depends completely on c; C is positive semidefinite if c 0 and negative semidefinite if c 0. This is especially obvious when we look at the corresponding quadratic form cx Determine the definiteness of the following symmetric matrices: ( ) ( ) a) b) c) Solution: a) positive definite; b) negative definite; c) indefinite; 5. Approximate e x at x = 0 with a Taylor polynomial of order three and four. Then compute the values of these approximation at h =.2 and at h = 1 and compare with the actual values. 2
3 Solution: e h 1 + h h h3 ; e h 1 + h h h h4. e ; e ; e e ; e ; e
4 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /10 Math for Microeconomics September Course, Part II Problem Set 2 with Solutions 1. For each of the following functions, find the critical points and classify these as local max, local min, or can t tell : a) x 4 + x 2 6xy + 3y 2, b) x 2 6xy + 2y x + 2y 5 c) xy 2 + x 3 y xy Solution: a) (0,0) is neither a local max nor a local min; (1,1) is a local min (-1,-1) is a local min. b) (13/7,16/7) is neither a local max nor a local min. c) (0,0); (0,1); (1,0) and (-1,0) are neither local max nor local min (this is called a saddle point). (1/ 5, 2/5) is a local min; (-1 5/, 2/5) is a local max. 2. Let S R n be an open set and f : S R be a twice differentiable function. Suppose that Df(x ) = 0. State the weakest sufficient conditions the relevant points, corresponding to the Hessian of f must, satisfy for: (i) x to be a local max. Solution: negative definite at x. (ii) x to be a strict local min. Solution: positive definite at x. 4
5 3. Which of the critical points found in Problem 1 are also global maxima or global minima? Solution: a) global min at (1,1) and (-1,-1). To see this, we use a two-stage process. First, we use the Hessian to determine that the function is convex for the open sets U + = {(x, y) x > 1/ 3} and U = {(x, y) x < 1/ 3}. Second, for the remaining region, we either draw or compute the values of the function to see that x 4 + x 2 6xy + 3y 2 1. Solution: b) no local max or min. c) (1/ 5, 2/5) is a local min, not a global min; (-1 5/, 2/5) is a local max, not a global max. 4. Check whether f(x, y) = x 4 + x 2 y 2 + y 4 3x 8y is concave or convex using its Hessian. Solution: The Hessian is ( 12x 2 + 2y 2 4xy 4xy 2x y 2 ) For (x, y) (0, 0), the two leading principal minors, 12x 2 +2y 2, and 24x x 2 y y 4 are both positive, so f is a convex function on all R n. 5
6 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /10 Math for Microeconomics September Course, Part II Problem Set 3 with Solutions 1. A commonly used production or utility function is f(x, y) = xy. Check whether it is concave or convex using its Hessian. Solution: the Hessian is simply ( 0 1 D 2 F (x, y) = 1 0 ) and the second order principal minor is 1. Since this is negative, then D 2 F is indefinite, and F is neither concave nor convex. 2. Prove that the sum of two concave functions is a concave function as well. Solution: trivial. 3. Let f be a function defined on a convex set U in R n. Prove that the following statements are equivalent: (i) f is a quasiconcave function on U (ii) For all x, y U and t [0, 1], f(x) f(y) f(tx + (1 t)y) f(y) 6
7 (iii) For all x, y U and t [0, 1], f(tx + (1 t)y) min{f(x), f(y)} Solution: If f is quasiconcave, and f(x) f(y), since the set {z f(z) f(y)} is convex, and y and x belong to this set, then for any t, f(tx + (1 t)y) f(y). Similarly, if (ii) holds, then trivially (iii) holds. Suppose that (iii) holds. Assume without loss of generality that f(x) f(y). Then (iii) implies that for all t, the set {z f(z) f(y)} is convex, and hence f is quasiconcave. 4. State the corresponding theorem for quasiconvex functions. Solution: Let f be a function defined on a convex set U in R n. Then, the following statements are equivalent: (i) f is a quasiconvex function on U (ii) For all x, y U and t [0, 1], f(x) f(y) f(tx + (1 t)y) f(x) (iii) For all x, y U and t [0, 1], f(tx + (1 t)y) max{f(x), f(y)} 5. For each of the following functions on R 1, determine whether they are quasiconcave, quasiconvex, both, or neither: 7
8 a) e x ; b) ln x; c) x 3 x. Solution: a) both (this is an increasing function in R. Any increasing function will satisfy both quasiconcavity and quasiconvexity). b) both; c) neither (graph the function: it has a strict interior local min and a strict interior local max). 8
9 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /10 Math for Microeconomics September Course, Part II Problem Set 4 with Solutions 1. For the following program subject to min f(x) = x x (x 2 ) 0, find the optimal solution. Solution: this problem is designed to illustrate when the constraint qualification can fail. In this problem the constraint qualification requirement does not hold, i.e., we cannot find x > 0 which satisfies the constraint since for all x > 0, x 2 < 0. Alternatively, one can see that the optimal x (which is 0) is actually a critical point of the constraint function. This means that we cannot use Lagrange to characterize all solutions. However, it is trivial in this problem that x = 0 is the solution (and the only value of x which satisfies the constraint). 2. Solve the following problem: max x 1,x 2 f(x 1, x 2 ) = x 2 1x 2 subject to 2x x 2 2 = 3. Solution: see the Simon and Blume book, p
10 3. Solve the following problem: subject to max x,y x2 + y 2 ax + y = 1 when a [ 1 2, 3 2 ]. Solution: here the objective function is convex and so will be the Lagrangian function. This means that we cannot use first order conditions - these will give us minimum and not maximum of the objective function (see also lecture 6). Hence, graphically, one can see that this problem results in a corner solution in which we either choose x = 1 a or we choose y = 1. When a = 1 2, then x2 = 4 > y 2 = 1. On the other hand, when a = 3, x < 1 and hence we prefer choosing y = 1. Thus, for all a < 1 2 the solution is x = 1, y = 0, and for all a 1 the solution is x = 0, y = 1. a Alternatively, one can use Lagrange and find the set of critical points which satisfy the relevant conditions (complementary slackness, etc.). One can then compute which one maximizes the Lagrangian. This one will also solve the constrained optimization problem. 4. Consider the following problem: max f(x) x subject to g(x) a x X Let X be a convex subset of R n, f : X R a concave function, g : X R m a convex function, a is a vector in R m. What is the Largrangian for this problem? prove it is a concave function of the choice variable x on X. 10
11 Solution: the Lagrangian is L(x, q, a) = f(x) + q(a g(x)) We will show that it is concave in x. Take x and x. Then: tf(x) + (1 t)f(x ) f(tx + (1 t)x ) tg(x) + (1 t)g(x ) g(tx + (1 t)x ) and thus with positive q, we have: f(tx + (1 t)x ) + qa qg(tx + (1 t)x ) tf(x) + (1 t)f(x ) + qa q(tg(x) + (1 t)g(x )) which proves that the Lagrangian is concave. 11
12 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /10 Math for Microeconomics September Course, Part II Problem Set 5 with Solutions 1. Assume that the utility function of the consumer is u(x, y) = x + y The consumer has a positive income I > 0 and faces positive prices p x > 0, p y > 0. The consumer cannot buy negative amounts of any of the goods. a) Use Kuhn-Tucker to solve the consumer s problem. b) Show how the optimal value of u,depends on I. Solution: a) this is a quasi linear utility function which is heavily used in economic theory. The Lagrangian is: L(x, y, q, I) = x + y + q 0 (I p x x p y y) + q 1 x + q 2 y The FOCs are 1 q 0 p x + q 1 = y q 0p y + q 2 = 0 12
13 Obviously the budget constraint will bind. Hence, q 0 > 0. Then assume that q 1 = q 2 = 0. We then find the interior solution so that 2 y = p x y = p2 x, x = I p x ; q p y 4p 2 0 = 1 y p x 4p y p x This solution exists when 4p y I p 2 x > 0. Now consider the solution where q 1 > 0 and q 2 = 0. Hence, x = 0 and then y = I p y. From the FOCs, this implies that q 0 = 1 and therefore q 1 = 1 p x 1 > 0 when 2 Ip y 2 Ip y p x > 2 Ip y or when p 2 x > 4p y I. Thus, these two solutions exhaust all possibilities (can you explain why there is no solution such that q 2 > 0 and q 1 = 0?). Solution: b) Let us take first the solution when q 1 = q 2 = 0, i.e., both goods are bought. Then:y = p2 x, x = I 4p 2 y p x px 4p y. Hence: u(x, y ) = I p x p x 4p y + p x 2p y Hence, taking a derivative w.r.t. I, we get: u(x, y ) I = 1 p x = q 0. Now consider a corner solution, for example when q 1 > 0. Then y = I p y u(x, y I ) = p y and hence and then: u(x, y ) I = 1 2p y I p y = q 0. 13
14 2. Solve the following problem: max(min{x, y} x 2 y 2 ) Solution: Here differentiability fails and we cannot use first order conditions. One has to set x = y at the optimal solution which gives x = y =
15 LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC /10 Math for Microeconomics September Course, Part II Problem Set 6 with Solutions 1. Consider the problem of maximizing xyz subject to x + y + z 1, x 0, y 0 and z 0. Obviously, the three latter constraints do not bind, and we can then concentrate only on the first constraint (x + y + z 1). Find the solution and the Lagrange multiplier, and show how the optimal value would change if instead the constraint is x + y + z.9. Solution: it is easy to see that the solution is x = y = z = 1 and the Lagrange 3 multiplier is 1 1. The optimal value is. Given the new constraint, the optimal value 9 27 is now: ( 1 10 ) Consider the problem of maximizing xy subject to x 2 + ay 2 1. What happens to the optimal value when we change a = 1 to a = 1.1? Solution: the Lagrangian for the problem is L(x, y, λ; a) = xy + λ(1 x 2 ay 2 ) + λ 1 x+λ 2 y. Note however that it cannot be the case that the maximizer will have either x = 0 or y = 0. Thus, the solution is interior when a = 1, and the solution is x = y = 1/ 2, λ = 1/2. The Envelope Theorem tells us that as a changes from 1 to 1.1,the optimal value of f changes by approximately L( 1 1 a 2, 2, 1 ; 1) (0.1). Then: 2 L a = λy2 = 1 2 ( 1 2 ) 2 =
16 Hence the optimal value will decrease from.5 to Consider Problem 1 in Problem set 5. Set the first order conditions, and for the case of an interior solution use comparative statics to find changes in the endogenous variables when I and p x change (one at a time), i.e., find (i) (ii) x I, x, p x y I, q 0 I ; y q 0,. p x p x Solution: The first conditions of this problem are: I p x x p y y = 0 1 q 0 p x + q 1 = y q 0p y + q 2 = 0 Consider J : det 0 p x p y p x 0 0 p y 0 1 4y 3 2 = p2 x 1 4y 3 2 > 0. This is not surprising, since the original Lagrangian is concave; at the unique interior optimum (y > 0), the bordered Hessian, H, is negative definite (satisfying sufficient second order conditions) and hence H 2 = det H > 0. Using total differentiation, and assuming an interior solution (i.e., q 1 = q 2 = 0), we have: di p x dx p y dy = 0 p x dq 0 = 0 16
17 1 dy p 4y 3 y dq 0 = 0 2 It is obvious that dq 0 = 0 and hence we also have dy = 0. Thus, x I = 1 p x, y I = q 0 I = 0. Now consider a change in p x : or: p x dx xdp x p y dy = 0 p x dq 0 q 0 dp x = 0 1 dy p 4y 3 y dq 0 2 = 0 and in matrix notation: det system. 0 p x p y p x 0 0 p y 0 1 4y 3 2 p x dx p y dy = xdp x p x dq 0 = q 0 dp x 1 dy p 4y 3 y dq 0 2 = 0 0 p x p y p x 0 0 p y 0 1 4y 3 2 q 0 p x x p x y p x = x q 0 0 > 0 and hence one can use Cramer s rule to solve this 17
EC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More informationEC400 Math for Microeconomics Syllabus The course is based on 6 sixty minutes lectures and on 6 ninety minutes classes.
London School of Economics Department of Economics Dr Francesco Nava Offi ce: 32L.3.20 EC400 Math for Microeconomics Syllabus 2016 The course is based on 6 sixty minutes lectures and on 6 ninety minutes
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
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 informationMathematical Economics: Lecture 16
Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave
More informationLakehead University ECON 4117/5111 Mathematical Economics Fall 2002
Test 1 September 20, 2002 1. Determine whether each of the following is a statement or not (answer yes or no): (a) Some sentences can be labelled true and false. (b) All students should study mathematics.
More informationLecture 4: Optimization. Maximizing a function of a single variable
Lecture 4: Optimization Maximizing or Minimizing a Function of a Single Variable Maximizing or Minimizing a Function of Many Variables Constrained Optimization Maximizing a function of a single variable
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationBEEM103 UNIVERSITY OF EXETER. BUSINESS School. January 2009 Mock Exam, Part A. OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions
BEEM03 UNIVERSITY OF EXETER BUSINESS School January 009 Mock Exam, Part A OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions Duration : TWO HOURS The paper has 3 parts. Your marks on the rst part will be
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationMicroeconomics I. September, c Leopold Sögner
Microeconomics I c Leopold Sögner Department of Economics and Finance Institute for Advanced Studies Stumpergasse 56 1060 Wien Tel: +43-1-59991 182 soegner@ihs.ac.at http://www.ihs.ac.at/ soegner September,
More informationConvex Functions and Optimization
Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized
More informationARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.
ARE211, Fall 2005 LECTURE #18: THU, NOV 3, 2005 PRINT DATE: NOVEMBER 22, 2005 (COMPSTAT2) CONTENTS 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity
More informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier Martinez-Giralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization - Non-Linear programming OPT p.1/45
More informationMATHEMATICAL ECONOMICS: OPTIMIZATION. Contents
MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4
More informationSummary Notes on Maximization
Division of the Humanities and Social Sciences Summary Notes on Maximization KC Border Fall 2005 1 Classical Lagrange Multiplier Theorem 1 Definition A point x is a constrained local maximizer of f subject
More informationWeek 4: Calculus and Optimization (Jehle and Reny, Chapter A2)
Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 27, 2015 Microeconomic Theory Week 4: Calculus and Optimization
More informationMidterm Exam, Econ 210A, Fall 2008
Midterm Exam, Econ 0A, Fall 008 ) Elmer Kink s utility function is min{x, x }. Draw a few indifference curves for Elmer. These are L-shaped, with the corners lying on the line x = x. Find each of the following
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationEconomics 101A (Lecture 3) Stefano DellaVigna
Economics 101A (Lecture 3) Stefano DellaVigna January 24, 2017 Outline 1. Implicit Function Theorem 2. Envelope Theorem 3. Convexity and concavity 4. Constrained Maximization 1 Implicit function theorem
More information. This matrix is not symmetric. Example. Suppose A =
Notes for Econ. 7001 by Gabriel A. ozada The equation numbers and page numbers refer to Knut Sydsæter and Peter J. Hammond s textbook Mathematics for Economic Analysis (ISBN 0-13- 583600-X, 1995). 1. Convexity,
More informationTutorial 3: Optimisation
Tutorial : Optimisation ECO411F 011 1. Find and classify the extrema of the cubic cost function C = C (Q) = Q 5Q +.. Find and classify the extreme values of the following functions (a) y = x 1 + x x 1x
More informationConstrained Optimization
Constrained Optimization Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 General Problem Consider the following general constrained optimization problem:
More informationNonlinear Programming and the Kuhn-Tucker Conditions
Nonlinear Programming and the Kuhn-Tucker Conditions The Kuhn-Tucker (KT) conditions are first-order conditions for constrained optimization problems, a generalization of the first-order conditions we
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 7: Quasiconvex Functions I 7.1 Level sets of functions For an extended real-valued
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationE 600 Chapter 4: Optimization
E 600 Chapter 4: Optimization Simona Helmsmueller August 8, 2018 Goals of this lecture: Every theorem in these slides is important! You should understand, remember and be able to apply each and every one
More informationModern Optimization Theory: Concave Programming
Modern Optimization Theory: Concave Programming 1. Preliminaries 1 We will present below the elements of modern optimization theory as formulated by Kuhn and Tucker, and a number of authors who have followed
More informationEcon Slides from Lecture 14
Econ 205 Sobel Econ 205 - Slides from Lecture 14 Joel Sobel September 10, 2010 Theorem ( Lagrange Multipliers ) Theorem If x solves max f (x) subject to G(x) = 0 then there exists λ such that Df (x ) =
More informationx +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a
UCM Final Exam, 05/8/014 Solutions 1 Given the parameter a R, consider the following linear system x +y t = 1 x +y +z +t = x y +z t = 7 x +6y +z +t = a (a (6 points Discuss the system depending on the
More informationFinal Exam - Math Camp August 27, 2014
Final Exam - Math Camp August 27, 2014 You will have three hours to complete this exam. Please write your solution to question one in blue book 1 and your solutions to the subsequent questions in blue
More informationReview of Optimization Methods
Review of Optimization Methods Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Outline of the Course Lectures 1 and 2 (3 hours, in class): Linear and non-linear functions on Limits,
More informationLecture Notes for Chapter 12
Lecture Notes for Chapter 12 Kevin Wainwright April 26, 2014 1 Constrained Optimization Consider the following Utility Max problem: Max x 1, x 2 U = U(x 1, x 2 ) (1) Subject to: Re-write Eq. 2 B = P 1
More informationEC487 Advanced Microeconomics, Part I: Lecture 2
EC487 Advanced Microeconomics, Part I: Lecture 2 Leonardo Felli 32L.LG.04 6 October, 2017 Properties of the Profit Function Recall the following property of the profit function π(p, w) = max x p f (x)
More informationBasics of Calculus and Algebra
Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationBoston College. Math Review Session (2nd part) Lecture Notes August,2007. Nadezhda Karamcheva www2.bc.
Boston College Math Review Session (2nd part) Lecture Notes August,2007 Nadezhda Karamcheva karamche@bc.edu www2.bc.edu/ karamche 1 Contents 1 Quadratic Forms and Definite Matrices 3 1.1 Quadratic Forms.........................
More informationCHAPTER 4: HIGHER ORDER DERIVATIVES. Likewise, we may define the higher order derivatives. f(x, y, z) = xy 2 + e zx. y = 2xy.
April 15, 2009 CHAPTER 4: HIGHER ORDER DERIVATIVES In this chapter D denotes an open subset of R n. 1. Introduction Definition 1.1. Given a function f : D R we define the second partial derivatives as
More informationPaul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions
UBC Economics 526 October 17, 2012 .1.2.3.4 Section 1 . max f (x) s.t. h(x) = c f : R n R, h : R n R m Draw picture of n = 2 and m = 1 At optimum, constraint tangent to level curve of function Rewrite
More informationDEPARTMENT OF MANAGEMENT AND ECONOMICS Royal Military College of Canada. ECE Modelling in Economics Instructor: Lenin Arango-Castillo
Page 1 of 5 DEPARTMENT OF MANAGEMENT AND ECONOMICS Royal Military College of Canada ECE 256 - Modelling in Economics Instructor: Lenin Arango-Castillo Final Examination 13:00-16:00, December 11, 2017 INSTRUCTIONS
More informationPaul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions
Unconstrained UBC Economics 526 October 18, 2013 .1.2.3.4.5 Section 1 Unconstrained problem x U R n F : U R. max F (x) x U Definition F = max x U F (x) is the maximum of F on U if F (x) F for all x U and
More informationFinal Exam Advanced Mathematics for Economics and Finance
Final Exam Advanced Mathematics for Economics and Finance Dr. Stefanie Flotho Winter Term /5 March 5 General Remarks: ˆ There are four questions in total. ˆ All problems are equally weighed. ˆ This is
More informationCHAPTER 1-2: SHADOW PRICES
Essential Microeconomics -- CHAPTER -: SHADOW PRICES An intuitive approach: profit maimizing firm with a fied supply of an input Shadow prices 5 Concave maimization problem 7 Constraint qualifications
More informationUNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems
UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction
More informationDifferentiation. 1. What is a Derivative? CHAPTER 5
CHAPTER 5 Differentiation Differentiation is a technique that enables us to find out how a function changes when its argument changes It is an essential tool in economics If you have done A-level maths,
More informationUniversity of California, Davis Department of Agricultural and Resource Economics ARE 252 Lecture Notes 2 Quirino Paris
University of California, Davis Department of Agricultural and Resource Economics ARE 5 Lecture Notes Quirino Paris Karush-Kuhn-Tucker conditions................................................. page Specification
More informationSTATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY
STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY UNIVERSITY OF MARYLAND: ECON 600 1. Some Eamples 1 A general problem that arises countless times in economics takes the form: (Verbally):
More informationProperties of Walrasian Demand
Properties of Walrasian Demand Econ 2100 Fall 2017 Lecture 5, September 12 Problem Set 2 is due in Kelly s mailbox by 5pm today Outline 1 Properties of Walrasian Demand 2 Indirect Utility Function 3 Envelope
More information1 Objective. 2 Constrained optimization. 2.1 Utility maximization. Dieter Balkenborg Department of Economics
BEE020 { Basic Mathematical Economics Week 2, Lecture Thursday 2.0.0 Constrained optimization Dieter Balkenborg Department of Economics University of Exeter Objective We give the \ rst order conditions"
More informationMathematical Preliminaries for Microeconomics: Exercises
Mathematical Preliminaries for Microeconomics: Exercises Igor Letina 1 Universität Zürich Fall 2013 1 Based on exercises by Dennis Gärtner, Andreas Hefti and Nick Netzer. How to prove A B Direct proof
More informationChapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44
Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It
More informationz = f (x; y) f (x ; y ) f (x; y) f (x; y )
BEEM0 Optimization Techiniques for Economists Lecture Week 4 Dieter Balkenborg Departments of Economics University of Exeter Since the fabric of the universe is most perfect, and is the work of a most
More informationII. An Application of Derivatives: Optimization
Anne Sibert Autumn 2013 II. An Application of Derivatives: Optimization In this section we consider an important application of derivatives: finding the minimum and maximum points. This has important applications
More informationExamination paper for TMA4180 Optimization I
Department of Mathematical Sciences Examination paper for TMA4180 Optimization I Academic contact during examination: Phone: Examination date: 26th May 2016 Examination time (from to): 09:00 13:00 Permitted
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationECON2285: Mathematical Economics
ECON2285: Mathematical Economics Yulei Luo SEF of HKU September 9, 2017 Luo, Y. (SEF of HKU) ME September 9, 2017 1 / 81 Constrained Static Optimization So far we have focused on nding the maximum or minimum
More informationECON 5111 Mathematical Economics
Test 1 October 1, 2010 1. Construct a truth table for the following statement: [p (p q)] q. 2. A prime number is a natural number that is divisible by 1 and itself only. Let P be the set of all prime numbers
More informationISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints
ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained
More informationThe Kuhn-Tucker Problem
Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming - The Kuhn-Tucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The Kuhn-Tucker
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationor R n +, R n ++ etc.;
Mathematical Prerequisites for Econ 7005, Microeconomic Theory I, and Econ 7007, Macroeconomic Theory I, at the University of Utah by Gabriel A Lozada The contents of Sections 1 6 below are required for
More informationECON 186 Class Notes: Optimization Part 2
ECON 186 Class Notes: Optimization Part 2 Jijian Fan Jijian Fan ECON 186 1 / 26 Hessians The Hessian matrix is a matrix of all partial derivatives of a function. Given the function f (x 1,x 2,...,x n ),
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland EC720.01 - Math for Economists Boston College, Department of Economics Fall 2010 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationStatic Problem Set 2 Solutions
Static Problem Set Solutions Jonathan Kreamer July, 0 Question (i) Let g, h be two concave functions. Is f = g + h a concave function? Prove it. Yes. Proof: Consider any two points x, x and α [0, ]. Let
More informationMonotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2
Monotone Function Function f is called monotonically increasing, if Chapter 3 x x 2 f (x ) f (x 2 ) It is called strictly monotonically increasing, if f (x 2) f (x ) Convex and Concave x < x 2 f (x )
More informationLecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then
Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then 1. x S is a global minimum point of f over S if f (x) f (x ) for any x S. 2. x S
More informationOptimality, Duality, Complementarity for Constrained Optimization
Optimality, Duality, Complementarity for Constrained Optimization Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Optimality, Duality, Complementarity May 2014 1 / 41 Linear
More informationECON 255 Introduction to Mathematical Economics
Page 1 of 5 FINAL EXAMINATION Winter 2017 Introduction to Mathematical Economics April 20, 2017 TIME ALLOWED: 3 HOURS NUMBER IN THE LIST: STUDENT NUMBER: NAME: SIGNATURE: INSTRUCTIONS 1. This examination
More informationARE211, Fall2015. Contents. 2. Univariate and Multivariate Differentiation (cont) Taylor s Theorem (cont) 2
ARE211, Fall2015 CALCULUS4: THU, SEP 17, 2015 PRINTED: SEPTEMBER 22, 2015 (LEC# 7) Contents 2. Univariate and Multivariate Differentiation (cont) 1 2.4. Taylor s Theorem (cont) 2 2.5. Applying Taylor theory:
More information1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016
AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
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 informationwhere u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More informationCalculus 2502A - Advanced Calculus I Fall : Local minima and maxima
Calculus 50A - Advanced Calculus I Fall 014 14.7: Local minima and maxima Martin Frankland November 17, 014 In these notes, we discuss the problem of finding the local minima and maxima of a function.
More informationOPTIMIZATION THEORY IN A NUTSHELL Daniel McFadden, 1990, 2003
OPTIMIZATION THEORY IN A NUTSHELL Daniel McFadden, 1990, 2003 UNCONSTRAINED OPTIMIZATION 1. Consider the problem of maximizing a function f:ú n 6 ú within a set A f ú n. Typically, A might be all of ú
More informationProblem Set 2 Solutions
EC 720 - Math for Economists Samson Alva Department of Economics Boston College October 4 2011 1. Profit Maximization Problem Set 2 Solutions (a) The Lagrangian for this problem is L(y k l λ) = py rk wl
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationFinite Dimensional Optimization Part I: The KKT Theorem 1
John Nachbar Washington University March 26, 2018 1 Introduction Finite Dimensional Optimization Part I: The KKT Theorem 1 These notes characterize maxima and minima in terms of first derivatives. I focus
More informationWeek 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer November Theory 1, 2015 (Jehle and 1 / Reny, 32
Week 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer Theory (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 1, 2015 Week 7: The Consumer
More informationChapter 3: Constrained Extrema
Chapter 3: Constrained Extrema Math 368 c Copyright 2012, 2013 R Clark Robinson May 22, 2013 Chapter 3: Constrained Extrema 1 Implicit Function Theorem For scalar fn g : R n R with g(x ) 0 and g(x ) =
More informationFinal Exam - Answer key
Fall4 Final Exam - Answer key ARE Problem (Analysis) [7 points]: A) [ points] Let A = (,) R be endowed with the Euclidean metric. Consider the set O = {( n,) : n N}. Does the open cover O of A have a finite
More informationOptimization. Charles J. Geyer School of Statistics University of Minnesota. Stat 8054 Lecture Notes
Optimization Charles J. Geyer School of Statistics University of Minnesota Stat 8054 Lecture Notes 1 One-Dimensional Optimization Look at a graph. Grid search. 2 One-Dimensional Zero Finding Zero finding
More informationA Project Report Submitted by. Devendar Mittal 410MA5096. A thesis presented for the degree of Master of Science
PARTICULARS OF NON-LINEAR OPTIMIZATION A Project Report Submitted by Devendar Mittal 410MA5096 A thesis presented for the degree of Master of Science Department of Mathematics National Institute of Technology,
More informationRecitation 2-09/01/2017 (Solution)
Recitation 2-09/01/2017 (Solution) 1. Checking properties of the Cobb-Douglas utility function. Consider the utility function u(x) Y n i1 x i i ; where x denotes a vector of n di erent goods x 2 R n +,
More informationSession: 09 Aug 2016 (Tue), 10:00am 1:00pm; 10 Aug 2016 (Wed), 10:00am 1:00pm &3:00pm 5:00pm (Revision)
Seminars on Mathematics for Economics and Finance Topic 2: Topics in multivariate calculus, concavity and convexity 1 Session: 09 Aug 2016 (Tue), 10:00am 1:00pm; 10 Aug 2016 (Wed), 10:00am 1:00pm &3:00pm
More informationChapter 4 Differentiation
Chapter 4 Differentiation 08 Section 4. The derivative of a function Practice Problems (a) (b) (c) 3 8 3 ( ) 4 3 5 4 ( ) 5 3 3 0 0 49 ( ) 50 Using a calculator, the values of the cube function, correct
More informationLinear and non-linear programming
Linear and non-linear programming Benjamin Recht March 11, 2005 The Gameplan Constrained Optimization Convexity Duality Applications/Taxonomy 1 Constrained Optimization minimize f(x) subject to g j (x)
More informationEcon 101A Problem Set 1 Solution
Econ 101A Problem Set 1 Solution Problem 1. Univariate unconstrained maximization. (10 points) Consider the following maximization problem: max x f(x; x 0)=exp( (x x 0 ) 2 ) 1. Write down the first order
More informationOptimization. A first course on mathematics for economists Problem set 4: Classical programming
Optimization. A first course on mathematics for economists Problem set 4: Classical programming Xavier Martinez-Giralt Academic Year 2015-2016 4.1 Let f(x 1, x 2 ) = 2x 2 1 + x2 2. Solve the following
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationSchool of Business. Blank Page
Maxima and Minima 9 This unit is designed to introduce the learners to the basic concepts associated with Optimization. The readers will learn about different types of functions that are closely related
More informationOptimization Theory. Lectures 4-6
Optimization Theory Lectures 4-6 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the non-negative orthant {x0ú n x$0} Existence of a maximum:
More informationConstrained maxima and Lagrangean saddlepoints
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 10: Constrained maxima and Lagrangean saddlepoints 10.1 An alternative As an application
More informationOutline. Roadmap for the NPP segment: 1 Preliminaries: role of convexity. 2 Existence of a solution
Outline Roadmap for the NPP segment: 1 Preliminaries: role of convexity 2 Existence of a solution 3 Necessary conditions for a solution: inequality constraints 4 The constraint qualification 5 The Lagrangian
More informationLecture 8: Basic convex analysis
Lecture 8: Basic convex analysis 1 Convex sets Both convex sets and functions have general importance in economic theory, not only in optimization. Given two points x; y 2 R n and 2 [0; 1]; the weighted
More informationOptimality Conditions
Chapter 2 Optimality Conditions 2.1 Global and Local Minima for Unconstrained Problems When a minimization problem does not have any constraints, the problem is to find the minimum of the objective function.
More information