Midterm Exam - Solutions
|
|
- Randell Riley
- 6 years ago
- Views:
Transcription
1 EC 70 - Math for Economists Samson Alva Department of Economics, Boston College October 13, 011 Midterm Exam - Solutions 1 Quasilinear Preferences (a) There are a number of ways to define the Lagrangian for this problem, depending on how one chooses to treat the nonnegativity constraints; here, I will work with the formulation that explicitly incorporates them into the Lagrangian, defined as: L(x, y, λ, µ, ν) = ln(x) + y λ(px + qy I) + µx + νy (b) Given the way the Lagrangian has been defined above, the Karush-Kuhn-Tucker (KKT) theorem implies that the values x and y that solve the consumers problem, together with the associated values λ, µ, and ν of the three multipliers, must satisfy L 1 (x, y, λ, µ, ν ) = 1 x λ p + µ = 0 (1) L (x, y, λ, µ, ν ) = 1 λ q + ν = 0 () L 3 (x, y, λ, µ, ν ) = px qy + I 0 (3) L 4 (x, y, λ, µ, ν ) = x 0 (4) L 5 (x, y, λ, µ, ν ) = y 0 (5) and the nonnegativity and complementary slackness conditions λ 0 λ (px + qy I) = 0 (6) µ 0 µ x = 0 (7) ν 0 ν y = 0 (8) (c) The form of the utility function implies that the budget constraint will always bind The form of the utility function also implies that x > 0 and hence, by (7), that µ = 0 as well Suppose first that y = 0 In this case, (1)-(3) and (8) require that 1 x λ p = 0, 1 λ q + ν = 0, I px = 0, ν 0 must hold Thus, x = I, p λ = 1, and I ν = q 1 But since I ν 0, we see that for y = 0 it must be that q 1 0 ie q I I Thus, whenever q I, it is optimal for the consumer to choose x = I and p y = 0 1
2 (d) Now suppose y > 0 which implies ν = 0 Then, equations (1)-(3) require that 1 x λ p = 0, 1 λ q = 0, px + qy = I So, first notice that λ = 1 and so q x = q, which then yields, via the budget p constraint, y = I 1, which is strictly positive as long as q < I q Thus, whenever q < I, it is optimal for the consumer to choose x = q and p y = 0 (e) The results from parts (c) and (d) above imply that only consumers with income I larger than q will purchase good y In this sense, y is best regarded as the luxury good in this example Lemma of the person who herds wooly mammals The econometricians estimates, together with the assumptions made about the firms behavior, imply that the firms minimum cost function, defined by subject to the constraint C(w, r, y) min wl + rk k,l y f(k, l) has the form ln C(w, r, y) = 1 ln w + 1 ln r + ln y Given the estimated form, we know that C = wry Then, using Shephard s Lemma, we find that l C = 1 C C w = 1 w = l = y r w and k C = 1 C C r = 1 r = k = y w r Multiplying k and l yields kl = y 4 and so we get y = kl Thus, it must be that the production function f(k, l) = k 1 l 1 3 Inventory Problem (a) Immediately after inventory has been reordered, the level of inventory is x The rate of depletion is constant, and so the inventory level declines linearly over time from x to 0, at which point the inventory jumps instantaneously to x again (see Figure 1) Thus, if T is the amount of time between reorders, the average inventory level is 1 xt = x, where the numerator is the area under the inventory T curve (b) The Lagrangian for the problem is L = C h x + C on + λ(a xn)
3 Figure 1: Inventory over time and the first order conditions are L x = C h λn = 0 (9) L n = C o λx = 0 (10) L λ = A xn = 0 (11) Using L x and L n, we get (λx)(λn) = (C o ) ( Ch ) = λ = C oc h A and so we get λ Co C h = ± A As should be clear from the expressions below, the negative solution for the multiplier does not make sense because it yields negative values for x and n Assuming λ takes on a positive value, x = C o λ = ACo, C h and n = C h λ = ACh C o The multiplier is the marginal inventory cost of increasing annual supply (c) If the firm can delay fulfilling orders, its inventory cost function changes to x U U C(x, n, U) = C h + C p + C on (assuming x U; see discussion at the end of this paragraph) Keep in mind that orders still have to be fulfilled, though they may be delayed by paying the penalty cost Thus, the annual delivery requirement is still A, but now when the order amount of x is received, the highest 3
4 Figure : Inventory over time inventory level will be x U ie x is the amount by which inventory will jump up after a reorder, and U is the level from which it will jump up It is still the case that A = nx Moreover, it should be apparent, upon reflection, that the reorder amount x can be assumed to be at least as large in magnitude as U, so that the post reorder level x U is at least 0 If this were not true, then the firm would always have a level of inventory deficit, and so have a higher steady state average penalty cost This argument is analogous to the one for part a), where we recognized that the firm shouldn t reorder until I falls to 0 See Figure for the time-path of inventory The Lagrangian becomes (keeping in mind we are minimizing not maximizing) L = C h x U and the KKT conditions are + C p U + C on + λ(a nx) + µ x (U x) µ n n µ U U L x = C h λn µ x = 0 (1) L n = C o λx µ n = 0 (13) L U = C h + C p + µ x µ U = 0 (14) L λ = A nx = 0 (15) x U, µ x 0, µ x (U x) = 0 (16) n 0, µ n 0, µ n n = 0 (17) U 0, µ U 0, µ U U = 0 (18) Now, suppose x > U, so that µ x = 0 Then λ n = C h, and µ U = Cp C h 0, implying C p C h Thus, we conclude that a necessary condition for x > U is that C p C h Next, suppose U > 0, so that µ U = 0 Then µ x = C h Cp 0, implying C h C p Thus, we conclude that a necessary condition for U > 0 is that C h C p Thus, we can conclude that the only way x > U and U > 0 is if C h = C p Otherwise, C h > C p implies x = U 0 and C p > C h implies x U = 0 4
5 So now suppose C p > C h, so that x U = 0 Assume A > 0, so that n x = A > 0 implying x > 0 and n > 0 Thus, µ x = 0, µ n = 0, and µ U = Cp C h, implying that λ n = C h and λ x = C o These yield the same solutions as part b) Thus, if C p > C h it is optimal to reorder inventory when the level falls to 0, to avoid penalty costs Next, suppose C p < C h, so that x = U 0 With A > 0, we have that n x = n U = A > 0 implying n > 0 and U > 0 Then, µ U = 0, µ n = 0 and µ x = C h C p Next, λ n = Cp and λ x = C o It s easy to see that the solutions here resemble those of part b), with C p taking the place of C h Thus, and x = U = n = AC o C p ACp C o Thus, if C p < C h, it is optimal to bear the penalty cost and reorder inventory solely to fulfill the backlog of orders, taking the level of inventory from U to 0 Basically, holding inventory and bearing penalty costs are perfect substitutes Finally, if C h = C p, it should be clear that the solution for n is still the same ie n = AC h C o, and so the annual order constraint implies x stays the same at AC o C p AC o C h, but U can be any amount from 0 to 4 Multimarket Monopolist and Arbitrageurs (a) Defining elasticity as ε = p q q, we have p ε 1 = p 1 q 1 = p 1 a p 1, ε = p q = p b p (b) Profit is π(p 1, p ) = p 1 q 1 + p q First order conditions are π p 1 = a p 1 = 0, π p = b p = 0, which implies that p 1 = q 1 = a and p = q = b Maximum profit is π = a +b 4 (c) We need q 1 0 and q 0 for the demand functions to make sense, and so we have the constraints p 1 a and p b Incorporating these as well as the arbitrage constraints into the Lagrangian yields L = p 1 (a p 1 ) + p (a p ) λ 1 (p 1 τp ) λ (p τp 1 ) µ 1 (p 1 a) µ (p b) (d) The constraint functions are linear in the choice variables p 1 and p, so the nondegenerate constraint qualification is satisfied automatically, as long as the constraint functions are linearly independent, which is clearly the case given τ > 1 5
6 The objective function is concave and continuously differentiable, so the necessary and sufficient conditions of the KKT theorem hold Any solutions we find to the KKT equations must be a constrained maximizer of our problem as defined by the Lagrangian (e) The KKT conditions are: L 1 = a p 1 λ 1 + λ τ µ 1 = 0 (19) L = b p + λ 1 τ λ µ = 0 (0) p 1 τp, λ 1 0, λ 1 (p 1 τp ) = 0 (1) p τp 1, λ 0, λ (p τp 1 ) = 0 () p 1 a, µ 1 0, µ 1 (p 1 a) = 0 (3) p b, µ 0, µ (p b) = 0 (4) (f) Both arbitrage constraints cannot bind is this would imply that p 1 > p and p > p 1, given that τ > 1, a contradiction (g) If p = τp 1 then p > p 1 Given that a > b, this is not consistent with our solution to part b), where we find that p 1 > p when the arbitrage constraints don t bind, where the inconsistency is that the optimal prices p 1 and p would could only reverse magnitude ordering if they were discontinuous functions of the exogenous parameter τ But intuitively, and mathematically from the Berge maximum theorem, the continuity of the objective function over the domain and the continuity of the domain as a function of the parameter τ rules out discontinuity of the optimal solutions Thus, we should not expect the constraint p τp 1 to bind at a maximum (h) We know both constraints can t bind, and we know intuitively that the second one couldn t bind if the first one didn t, so we really only have to consider the two cases where the first arbitrage constraint either does or does not bind Suppose it doesn t bind Then, it is immediately clear that, with µ 1 = 0 and µ = 0, we recover the arbitrage-free solution of p 1 = a and p = b (i) In Figure 3, the brown region containing the unconstrained maximizer pricing scheme is the feasible region Since there is a unique unconstrained maximum, the isoprofit curve through the maximum is just the point itself there are no other price combinations that will yield as high a profit Isoprofit curves are circles of increasing radius centered on this point (j) Assuming positive quantities, we know that µ 1 = µ = 0 We have that p 1 = τp and p < τp 1, implying λ = 0 Replace p 1 in the first order conditions to get a τp λ 1 = 0 and b p + τλ 1 = 0 Combining these, we get τ(a τp ) + b p = 0, so p = 1 and p 1 = τp = τ This give us π = p 1(a p 1) + p (b p ) = p (τ(a τp )+b p ) Notice that the combined first order condition above can be rewritten as τ(a τp ) + b p = (1 + τ )p Substituting this into 1+τ (τa+b) 6 1+τ (τa+b)
7 Figure 3: p 1 on horizontal axis, p on vertical axis, circular isoprofit curves, brown central region is feasible the maximum profit expression yields π = (1 + τ )p = 1 (τa + b) 1 + τ 4 (k) Simple substitution of τ = a into the expressions in the previous part produce the b unconstrained price and maximum profit Quite clearly, if τ > a, then the first b (and also second) arbitrage constraint do not bind, since the costs of arbitrage are much too high Therefore, the arbitrage constraints are binding if 1 τ a b (l) Even though we assumed for the problem above that τ > 1, we can take the limit of our solutions as τ approaches 1 to find π = (a+b), which is less that the 8 unconstrained profit a +b The difference between these profit levels is equal to 4 (a b) > 0 since a > b 8 (m) Since p = b, q = 0, and so the problem is to maximize p 1 (a p 1 ), which immediately yields the optimal price of p 1 = a a, and profit of Now, we computed in 4 the previous part that the profit when τ = 1 is (a+b) Therefore, for the monopolist not to find it optimal to choke market, it must be that (a+b) a, which immediately yields (a + b) a Keep in mind that we did not verify that the nonnegativity constraints on quantities were satisfied by our constrained optimal solutions What conditions on the parameters are necessary for these quantity nonnegativity constraints not to be violated? Well, we need p τ (τa+b) 1 a implying a and p 1+τ b implying 7
8 5 Topology 1 τa+b b Then, τ b ( + τ )a and τa (1 + τ )b so 1+τ τ + τ a b (1 + τ ) τ Since a > b, the left-hand side inequality is trivially satisfied So, it is the righthand side inequality that matters, and our conclusions above are valid if it is satisfied Solving the problem for the case where the right-hand side inequality does not hold is more challenging because the inverse demand functions are not differentiable at p 1 = a and p = b, requiring case-by-case analysis Topologists attribute to sets the properties of being open or being closed However, unlike the everyday notion of openness and closedness being mutually exclusive attributes, topologists do not make this either-or distinction, and hence the confusion of the customer, and the mirth of the topologist, stems from the customer s assumption that a store being not closed implies that it is open The subset (0, 1] R is neither closed nor open 8
Problem 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 informationHow to Characterize Solutions to Constrained Optimization Problems
How to Characterize Solutions to Constrained Optimization Problems Michael Peters September 25, 2005 1 Introduction A common technique for characterizing maximum and minimum points in math is to use first
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 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 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 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 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 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 informationThe Necessity of the Transversality Condition at Infinity: A (Very) Special Case
The Necessity of the Transversality Condition at Infinity: A (Very) Special Case Peter Ireland ECON 772001 - Math for Economists Boston College, Department of Economics Fall 2017 Consider a discrete-time,
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland ECON 77200 - Math for Economists Boston College, Department of Economics Fall 207 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationHomework 3 Suggested Answers
Homework 3 Suggested Answers Answers from Simon and Blume are on the back of the book. Answers to questions from Dixit s book: 2.1. We are to solve the following budget problem, where α, β, p, q, I are
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 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 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 informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationWeek 10: Theory of the Firm (Jehle and Reny, Chapter 3)
Week 10: Theory of the Firm (Jehle and Reny, Chapter 3) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 22, 2015 First Last (shortinst) Short title November 22, 2015 1
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 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 informationIn view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written
11.8 Inequality Constraints 341 Because by assumption x is a regular point and L x is positive definite on M, it follows that this matrix is nonsingular (see Exercise 11). Thus, by the Implicit Function
More informationIndustrial Organization, Fall 2011: Midterm Exam Solutions and Comments Date: Wednesday October
Industrial Organization, Fall 2011: Midterm Exam Solutions and Comments Date: Wednesday October 23 2011 1 Scores The exam was long. I know this. Final grades will definitely be curved. Here is a rough
More informationMicroeconomic Theory. Microeconomic Theory. Everyday Economics. The Course:
The Course: Microeconomic Theory This is the first rigorous course in microeconomic theory This is a course on economic methodology. The main goal is to teach analytical tools that will be useful in other
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 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 information1 Theory of the Firm: Topics and Exercises
1 Theory of the Firm: Topics and Exercises Firms maximize profits, i.e. the difference between revenues and costs, subject to technological and other, here not considered) constraints. 1.1 Technology Technology
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 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 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 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 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 informationMicroeconomic Theory -1- Introduction
Microeconomic Theory -- Introduction. Introduction. Profit maximizing firm with monopoly power 6 3. General results on maximizing with two variables 8 4. Model of a private ownership economy 5. Consumer
More informationEcon Slides from Lecture 10
Econ 205 Sobel Econ 205 - Slides from Lecture 10 Joel Sobel September 2, 2010 Example Find the tangent plane to {x x 1 x 2 x 2 3 = 6} R3 at x = (2, 5, 2). If you let f (x) = x 1 x 2 x3 2, then this is
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 informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More 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 informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
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 informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
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 informationConsider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t
VI. INEQUALITY CONSTRAINED OPTIMIZATION Application of the Kuhn-Tucker conditions to inequality constrained optimization problems is another very, very important skill to your career as an economist. If
More informationThe Envelope Theorem
The Envelope Theorem In an optimization problem we often want to know how the value of the objective function will change if one or more of the parameter values changes. Let s consider a simple example:
More informationHomework 1 Solutions
Homework Solutions Econ 50 - Stanford University - Winter Quarter 204/5 January 6, 205 Exercise : Constrained Optimization with One Variable (a) For each function, write the optimal value(s) of x on the
More informationOptimization, constrained optimization and applications of integrals.
ams 11b Study Guide econ 11b Optimization, constrained optimization and applications of integrals. (*) In all the constrained optimization problems below, you may assume that the critical values you find
More informationg(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to
1 of 11 11/29/2010 10:39 AM From Wikipedia, the free encyclopedia In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) provides a strategy for finding the
More informationWe are now going to move on to a discussion of Inequality constraints. Our canonical problem now looks as ( ) = 0 ( ) 0
4 Lecture 4 4.1 Constrained Optimization with Inequality Constraints We are now going to move on to a discussion of Inequality constraints. Our canonical problem now looks as Problem 11 (Constrained Optimization
More informationLecture 6: Discrete-Time Dynamic Optimization
Lecture 6: Discrete-Time Dynamic Optimization Yulei Luo Economics, HKU November 13, 2017 Luo, Y. (Economics, HKU) ECON0703: ME November 13, 2017 1 / 43 The Nature of Optimal Control In static optimization,
More informationEC /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 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 informationECON5110: Microeconomics
ECON5110: Microeconomics Lecture 2: Sept, 2017 Contents 1 Overview 1 2 Production Technology 2 3 Profit Maximization 5 4 Properties of Profit Maximization 7 5 Cost Minimization 10 6 Duality 12 1 Overview
More informationDepartment of Agricultural Economics. PhD Qualifier Examination. May 2009
Department of Agricultural Economics PhD Qualifier Examination May 009 Instructions: The exam consists of six questions. You must answer all questions. If you need an assumption to complete a question,
More informationGARP and Afriat s Theorem Production
GARP and Afriat s Theorem Production Econ 2100 Fall 2017 Lecture 8, September 21 Outline 1 Generalized Axiom of Revealed Preferences 2 Afriat s Theorem 3 Production Sets and Production Functions 4 Profits
More informationMaximum Value Functions and the Envelope Theorem
Lecture Notes for ECON 40 Kevin Wainwright Maximum Value Functions and the Envelope Theorem A maximum (or minimum) value function is an objective function where the choice variables have been assigned
More informationMathematical Foundations II
Mathematical Foundations 2-1- Mathematical Foundations II A. Level and superlevel sets 2 B. Convex sets and concave functions 4 C. Parameter changes: Envelope Theorem I 17 D. Envelope Theorem II 41 48
More informationAdvanced Microeconomic Analysis, Lecture 6
Advanced Microeconomic Analysis, Lecture 6 Prof. Ronaldo CARPIO April 10, 017 Administrative Stuff Homework # is due at the end of class. I will post the solutions on the website later today. The midterm
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 informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationSolutions. ams 11b Study Guide 9 econ 11b
ams 11b Study Guide 9 econ 11b Solutions 1. A monopolistic firm sells one product in two markets, A and B. The daily demand equations for the firm s product in these markets are given by Q A = 100 0.4P
More information1.3 The Indirect Utility Function
1.2 Utility Maximization Problem (UMP) (MWG 2.D, 2.E; Kreps 2.2) max u (x) s.t. p.x w and x 0 hx Xi For a cts preference relation represented by a cts utility fn, u ( ): 1. The UMP has at least one solution
More informationEconomics 121b: Intermediate Microeconomics Midterm Suggested Solutions 2/8/ (a) The equation of the indifference curve is given by,
Dirk Bergemann Department of Economics Yale University Economics 121b: Intermediate Microeconomics Midterm Suggested Solutions 2/8/12 1. (a) The equation of the indifference curve is given by, (x 1 + 2)
More informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More informationOn the Method of Lagrange Multipliers
On the Method of Lagrange Multipliers Reza Nasiri Mahalati November 6, 2016 Most of what is in this note is taken from the Convex Optimization book by Stephen Boyd and Lieven Vandenberghe. This should
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 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 informationECONOMIC OPTIMALITY. Date: October 10, 2005.
ECONOMIC OPTIMALITY 1. FORMAL STATEMENT OF THE DECISION PROBLEM 1.1. Statement of the problem. ma h(, a) (1) such that G(a) This says that the problem is to maimize the function h which depends on and
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 informationConcave programming. Concave programming is another special case of the general constrained optimization. subject to g(x) 0
1 Introduction Concave programming Concave programming is another special case of the general constrained optimization problem max f(x) subject to g(x) 0 in which the objective function f is concave and
More informationEconS 501 Final Exam - December 10th, 2018
EconS 501 Final Exam - December 10th, 018 Show all your work clearly and make sure you justify all your answers. NAME 1. Consider the market for smart pencil in which only one firm (Superapiz) enjoys a
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
More informationMathematical Preliminaries
Mathematical Preliminaries Economics 3307 - Intermediate Macroeconomics Aaron Hedlund Baylor University Fall 2013 Econ 3307 (Baylor University) Mathematical Preliminaries Fall 2013 1 / 25 Outline I: Sequences
More informationFIN 550 Practice Exam Answers. A. Linear programs typically have interior solutions.
FIN 550 Practice Exam Answers Phil Dybvig. True-False 25 points A. Linear programs typically have interior solutions. False. Unless the objective is zero, all solutions are at the boundary. B. A local
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 informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationEcon 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS. Carmen Astorne-Figari Washington University in St. Louis.
Econ 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS Carmen Astorne-Figari Washington University in St. Louis August 12, 2010 INTRODUCTION General form of an optimization problem: max x f
More informationAdvanced Microeconomic Analysis Solutions to Midterm Exam
Advanced Microeconomic Analsis Solutions to Midterm Exam Q1. (0 pts) An individual consumes two goods x 1 x and his utilit function is: u(x 1 x ) = [min(x 1 + x x 1 + x )] (a) Draw some indifference curves
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 13 Overview of nonlinear programming. Ann-Brith Strömberg
MVE165/MMG631 Overview of nonlinear programming Ann-Brith Strömberg 2015 05 21 Areas of applications, examples (Ch. 9.1) Structural optimization Design of aircraft, ships, bridges, etc Decide on the material
More information1.4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION
Essential Microeconomics -- 4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION Fundamental Theorem of linear Programming 3 Non-linear optimization problems 6 Kuhn-Tucker necessary conditions Sufficient conditions
More informationEcon 201: Problem Set 3 Answers
Econ 20: Problem Set 3 Ansers Instructor: Alexandre Sollaci T.A.: Ryan Hughes Winter 208 Question a) The firm s fixed cost is F C = a and variable costs are T V Cq) = 2 bq2. b) As seen in class, the optimal
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationSECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING
Nf SECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING f(x R m g HONOUR SCHOOL OF MATHEMATICS, OXFORD UNIVERSITY HILARY TERM 5, DR RAPHAEL
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 informationQuiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006
Quiz Discussion IE417: Nonlinear Programming: Lecture 12 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University 16th March 2006 Motivation Why do we care? We are interested in
More informationEE/AA 578, Univ of Washington, Fall Duality
7. Duality EE/AA 578, Univ of Washington, Fall 2016 Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The so-called Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
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 informationIndex. Cambridge University Press An Introduction to Mathematics for Economics Akihito Asano. Index.
, see Q.E.D. ln, see natural logarithmic function e, see Euler s e i, see imaginary number log 10, see common logarithm ceteris paribus, 4 quod erat demonstrandum, see Q.E.D. reductio ad absurdum, see
More informationCHAPTER 3: OPTIMIZATION
John Riley 8 February 7 CHAPTER 3: OPTIMIZATION 3. TWO VARIABLES 8 Second Order Conditions Implicit Function Theorem 3. UNCONSTRAINED OPTIMIZATION 4 Necessary and Sufficient Conditions 3.3 CONSTRAINED
More informationTMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM
TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM H. E. Krogstad, IMF, Spring 2012 Karush-Kuhn-Tucker (KKT) Theorem is the most central theorem in constrained optimization, and since the proof is scattered
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 informationDynamic Macroeconomic Theory Notes. David L. Kelly. Department of Economics University of Miami Box Coral Gables, FL
Dynamic Macroeconomic Theory Notes David L. Kelly Department of Economics University of Miami Box 248126 Coral Gables, FL 33134 dkelly@miami.edu Current Version: Fall 2013/Spring 2013 I Introduction A
More informationConstrained Optimization. Unconstrained Optimization (1)
Constrained Optimization Unconstrained Optimization (Review) Constrained Optimization Approach Equality constraints * Lagrangeans * Shadow prices Inequality constraints * Kuhn-Tucker conditions * Complementary
More informationLast Revised: :19: (Fri, 12 Jan 2007)(Revision:
0-0 1 Demand Lecture Last Revised: 2007-01-12 16:19:03-0800 (Fri, 12 Jan 2007)(Revision: 67) a demand correspondence is a special kind of choice correspondence where the set of alternatives is X = { x
More informationKarush-Kuhn-Tucker Conditions. Lecturer: Ryan Tibshirani Convex Optimization /36-725
Karush-Kuhn-Tucker Conditions Lecturer: Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given a minimization problem Last time: duality min x subject to f(x) h i (x) 0, i = 1,... m l j (x) = 0, j =
More informationOnline Appendix Durable Goods Monopoly with Stochastic Costs
Online Appendix Durable Goods Monopoly with Stochastic Costs Juan Ortner Boston University March 2, 2016 OA1 Online Appendix OA1.1 Proof of Theorem 2 The proof of Theorem 2 is organized as follows. First,
More information6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games
6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationOn Hotelling s Stability in Competition
On Hotelling s Stability in Competition Claude d Aspremont, Jean Jaskold Gabszewicz and Jacques-François Thisse Manuscript received March, 1978; revision received June, 1978 Abstract The purpose of this
More informationLecture Notes: Math Refresher 1
Lecture Notes: Math Refresher 1 Math Facts The following results from calculus will be used over and over throughout the course. A more complete list of useful results from calculus is posted on the course
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 informationLecture 18: Optimization Programming
Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming
More informationAdvanced Microeconomic Theory. Chapter 6: Partial and General Equilibrium
Advanced Microeconomic Theory Chapter 6: Partial and General Equilibrium Outline Partial Equilibrium Analysis General Equilibrium Analysis Comparative Statics Welfare Analysis Advanced Microeconomic Theory
More information