CHAPTER 1-2: SHADOW PRICES

Size: px
Start display at page:

Download "CHAPTER 1-2: SHADOW PRICES"

Transcription

1 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 8 Kuhn-Tucker conditions 4 Quasi-concave maimization problem 5 Eample: Consumer Choice 6

2 Essential Microeconomics -- Maimizing profit with a fied supply of an input Ma{ f ( ) b g( ) 0, 0} We shall interpret this mathematical problem as the decision problem of a profit maimizing firm This firm can produce any vector of outputs which satisfies the non-negativity constraint, 0and a resource constraint g ( ) b A simple eample is a linear constraint Each unit of requires a units of resource b Then n a = a b =

3 Essential Microeconomics -3- Suppose that solves the optimization problem If the firm increases, the direct effect on profit is f However, the increase in also utilizes additional resources so that there must be offsetting changes in other commodities We introduce a shadow price λ 0 to reflect the opportunity cost of using the additional resources The etra resource use is g Multiplying this by the shadow price of the resource gives the opportunity cost of increasing The net gain to increasing is therefore f g ( ) λ ( )

4 Essential Microeconomics -4- If the optimum for commodity,, is strictly positive, this marginal net gain must be zero That is f g > 0 ( ) λ ( ) 0 = If is zero, the marginal net gain to increasing cannot be positive Hence f g = 0 ( ) - λ ( ) 0 Summarizing f g ( ) - λ ( ) 0, with equality if > 0 Since must be feasible b g ( ) 0 Moreover, we have defined λ to be the opportunity cost of additional resource use Then if not all the resource is used, λ must be zero Summarizing, b g ( ) 0, with equality if λ > 0

5 Essential Microeconomics -5- There is a convenient way to remember these conditions First write the i-th constraint in the form hi ( ) 0, i =,, m In vector notation h ( ) 0 Thus in our eample we write the constraint as h( ) b g ( ) 0 = Then introduce a vector of Lagrange multipliers or shadow prices λ and define the Lagrangian L (, λ) = f( ) + λ h ( ) The first order conditions are then all restrictions on the partial derivatives of L (, λ) f h (i) = + λ 0, i with equality if > 0, =,, n L (ii) hi ( ) 0, λ = i with equality if λ i > 0, i =,, m Eercise: Solve the following problem Ma{ U ( ) = ln + ln( + 3) p+ p + p33 60} (i) if p = (,, 6) (ii) p = (,,) (iii) p = (,,4)

6 Essential Microeconomics -6- Restatement of FOC (i) L f h 0 and L = + λ = 0 i, =,, n (ii) = hi( ) 0 and λi = 0 λ λ i i, i =,, m In vector notation (i) L f h 0 and L = + λ = 0 (ii) = h ( ) 0 and λ = 0 λ λ, i =,, m These are called the complementary slackness conditions Note: (ii) implies that L (, λ ) = f( )

7 Essential Microeconomics -7- Special case: Concave constrained optimization problem Proposition Sufficient Conditions for a Maimum For the problem Ma{ f ( ) X} where X= { 0, h ( ) 0}, suppose that the concave functions f, h,, h m are differentiable at If (i) L f h 0 and L = + λ = 0 and (ii) = h ( ) 0 and λ = 0 λ λ, i =,, m then solves Ma{ f ( ) X} where X= { 0, h ( ) 0} Proof: The sum of concave functions is concave so L (, λ) = f( ) + λ h ( ) is a concave function of Hence L(, λ) L (, λ) + (, λ) ( ) Appealing to (i), the second term on the right hand side is negative Appealing to (ii) L (, λ ) = f( ) Therefore L (, λ) = f( ) + λ h( ) f( ) But λ h ( ) 0 for any feasible Therefore f( ) f( ) QED

8 Essential Microeconomics -8- Non concave problem: Constraint Qualifications Define X to be the set of feasible vectors, that is X = { 0, h( ) 0, i =,, m} i The constraint qualifications holds at X if hi (i) for each constraint that is binding at the associated gradient vector ( ) 0 (ii) X, the set of non-negative vectors satisfying the linearized binding constraints has a non-empty interior L hi Note: The linear function hi ( ) = hi( ) + ( ) ( ) has the same value and gradient as the function hi ( ) at Thus the linear approimation at on the boundary of the constrained set satisfying the constraint ( ) 0 i hi ( ) ( ) 0 hi h is hi ( ) + ( ) ( ) 0 Since hi ( ) = 0 the linear constraint is

9 Essential Microeconomics -9- Eample : Constraint qualification holds Ma{ f ( ) = ln 0, h( ) = 0} As is readily confirmed, the maimizing value of is = (,) The feasible set and contour set for f through = (,) are depicted The Lagrangian is L (, λ) = ln + ln + λ( ) The first order conditions are therefore (i) L = λ 0, with equality if > 0, =, Fig -: Constrained maimum L (ii) 0, λ = with equality if λ > 0 As is readily checked, the FOC are all satisfied at (, λ ) = (,,)

10 Essential Microeconomics -0- Eample : Constraint qualification does not hold 3 { ( ) ln ln 0, ( ) ( ) 0} Ma f = + h = Since the feasible set and maimand are eactly the same as in eample, the solution is again = (,) The Lagrangian is (, ) ln ln ( ) 3 L λ = + + λ Differentiating by, L = = 3 λ( ) at = (,)

11 Essential Microeconomics -- Thus the first order condition does not hold at the maimum Our intuitive argument breaks down h because, the gradient of the constraint function, is zero at the maimum Thus the partial derivatives of h no longer reflect the opportunity cost of the scarce resource More formally, at the maimum, the linear approimation of the constraint is L hi hi ( ) = hi( ) + ( ) ( ) Then, as long as the constraint is binding ( hi ( ) = 0) and the gradient vector is not zero, the linearized constraint is h i ( ) ( ) 0, i =,, m

12 Essential Microeconomics -- There is a second (though unlikely) situation in which the linear approimations fail Consider the following problem Ma{ f ( ) = + h( ) = ( ) 0, 0} 3 The feasible set is the shaded region in the figure below Also depicted is the contour set for f through = (,0) Fig -a: Original problem From the figure it is clear that f takes on its maimum at = (,0) However, L ( ) = 3 λ( ) = Thus again the first order conditions do not hold at the maimum

13 Essential Microeconomics -3- This time the problem occurs because the feasible set, after taking a linear approimation of the constraint function, looks nothing like the original feasible set h At, the gradient vector ( ) = (0, ) Thus the linear approimation of the constraint h ( ) 0 through is h h h ( ) ( ) = ( )( ) + ( ) = 0 Linearized feasible set Fig -b: Linearized problem Since must be non-negative, the only feasible value of is = 0 In Figure -b the linearized feasible set is therefore the horizontal ais Then the solution to the linearized problem is not the solution to the original problem

14 Essential Microeconomics -4- As long as the constraint qualifications hold, the intuitively derived conditions are indeed necessary conditions This is summarized below Proposition: Necessary Conditions for a Constrained Maimum Suppose solves Ma{ f ( ) X} If the constraint qualifications hold at then there eists a vector of shadow prices λ 0 such that and (, λ) 0, =,, n with equality if > 0 (, λ) 0, i =,, m with equality if λi > 0 λ FOC (Kuhn-Tucker conditions) Since Kuhn and Tucker were the first to publish a complete set of constraint qualifications, the first order conditions (FOC) are often called the Kuhn-Tucker Conditions

15 Essential Microeconomics -5- Proposition: Sufficient Conditions for a Constrained Maimum Suppose that and are quasi-concave and the feasible set has a non-empty interior If the Kuhn-Tucker conditions hold at, and for each binding constraint,, then solves Intuition: Under these assumptions one can draw a hyperplane through which separates X and the upper contour set C f f U 0 ( ) = { ( ) ( )}

16 Essential Microeconomics -6- Eample: Consumer Choice Consider the following consumer choice problem: Ma{ U ( ) = ln( + 3 ) + ln p I} 0 (a) Solve if p = (,,4) 3 (b) Show that there is a unique maimizer * p p ( pi, ) unless = 3 Note that z = ln y is an increasing concave function and y = + 3 is linear and hence concave Therefore ln( + 3 ) is concave Also ln is concave Therefore U( ) is 3 concave Then the Kuhn-Tucker conditions are sufficient conditions for a maimum L = U( ) + λ( I p ) (a) FOC = λ with equality if * > 0 3 = λ with equality if * > 0 = 4λ with equality if * 3 > 0

17 Essential Microeconomics -7- Try * >> λ = 0, λ = 0, 3 = 4λ From the first two equations λ = + 3 and λ = But this is impossible Then try > 0 = * * = λ = 0, = 4λ = Eliminating λ it follows that = 43 From the budget constraint = 8 = I Then 3 3 = I and * 3 8 = I * Since the problem is concave, the necessary conditions are sufficient

18 Essential Microeconomics -8- (b) Once the consumer has chosen * 3, the consumer has commodities The consumer s problem is now to solve y= I p to spend on the other two * 3 3 Ma{ U (, ) p + p y}, That is, * 3 Ma{ln( + 3 ) + ln p + p y} * 3 If If 3 >, the consumer strictly prefers commodity over commodity p p 3 <, the consumer strictly prefers commodity over commodity p p Remark: This kind of utility function seems plausible for two products with similar characteristics such as two brands of beer Brand two is preferred but if the price premium is too high the consumer chooses brand

Mathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7

Mathematical 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 information

1.4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION

1.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 information

CHAPTER 3: OPTIMIZATION

CHAPTER 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 information

STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY

STATIC 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 information

The Kuhn-Tucker and Envelope Theorems

The 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 information

The Kuhn-Tucker and Envelope Theorems

The 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 information

Nonlinear Programming and the Kuhn-Tucker Conditions

Nonlinear 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 information

Mathematical Foundations -1- Supporting hyperplanes. SUPPORTING HYPERPLANES Key Ideas: Bounding hyperplane for a convex set, supporting hyperplane

Mathematical Foundations -1- Supporting hyperplanes. SUPPORTING HYPERPLANES Key Ideas: Bounding hyperplane for a convex set, supporting hyperplane Mathematical Foundations -1- Supporting hyperplanes SUPPORTING HYPERPLANES Key Ideas: Bounding hyperplane for a convex set, supporting hyperplane Supporting Prices 2 Production efficient plans and transfer

More information

Basic mathematics of economic models. 3. Maximization

Basic mathematics of economic models. 3. Maximization John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints

More information

Seminars 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 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 information

Microeconomic Theory -1- Introduction

Microeconomic 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 information

3.2 THE FUNDAMENTAL WELFARE THEOREMS

3.2 THE FUNDAMENTAL WELFARE THEOREMS Essential Microeconomics -1-3.2 THE FUNDMENTL WELFRE THEOREMS Walrasian Equilibrium 2 First welfare teorem 3 Second welfare teorem (conve, differentiable economy) 12 Te omotetic preference 2 2 economy

More information

Review of Optimization Basics

Review of Optimization Basics Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:

More information

Mathematical Foundations II

Mathematical 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 information

is a maximizer. However this is not the case. We will now give a graphical argument explaining why argue a further condition must be satisfied.

is a maximizer. However this is not the case. We will now give a graphical argument explaining why argue a further condition must be satisfied. D. Maimization with two variables D. Sufficient conditions for a maimum Suppose that the second order conditions hold strictly. It is tempting to believe that this might be enough to ensure that is a maimizer.

More information

3. Neoclassical Demand Theory. 3.1 Preferences

3. Neoclassical Demand Theory. 3.1 Preferences EC 701, Fall 2005, Microeconomic Theory September 28, 2005 page 81 3. Neoclassical Demand Theory 3.1 Preferences Not all preferences can be described by utility functions. This is inconvenient. We make

More information

The Kuhn-Tucker Problem

The 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 information

It is convenient to introduce some notation for this type of problems. I will write this as. max u (x 1 ; x 2 ) subj. to. p 1 x 1 + p 2 x 2 m ;

It is convenient to introduce some notation for this type of problems. I will write this as. max u (x 1 ; x 2 ) subj. to. p 1 x 1 + p 2 x 2 m ; 4 Calculus Review 4.1 The Utility Maimization Problem As a motivating eample, consider the problem facing a consumer that needs to allocate a given budget over two commodities sold at (linear) prices p

More information

Walrasian Equilibrium in an exchange economy

Walrasian Equilibrium in an exchange economy Microeconomic Teory -1- Walrasian equilibrium Walrasian Equilibrium in an ecange economy 1. Homotetic preferences 2 2. Walrasian equilibrium in an ecange economy 11 3. Te market value of attributes 18

More information

Optimization Paul Schrimpf September 12, 2018

Optimization Paul Schrimpf September 12, 2018 Optimization Paul Schrimpf September 1, 018 University of British Columbia Economics 56 cba1 Today s lecture is about optimization Useful references are chapters 1-5 of Diit (1990), chapters 16-19 of Simon

More information

, αβ, > 0 is strictly quasi-concave on

, αβ, > 0 is strictly quasi-concave on John Riley 8 Setember 9 Econ Diagnostic Test Time allowed: 9 minutes. Attemt all three questions. Note that the last two arts of questions and 3 are marked with an asterisk (). These do not carry many

More information

Outline. 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 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 information

1. Sets A set is any collection of elements. Examples: - the set of even numbers between zero and the set of colors on the national flag.

1. Sets A set is any collection of elements. Examples: - the set of even numbers between zero and the set of colors on the national flag. San Francisco State University Math Review Notes Michael Bar Sets A set is any collection of elements Eamples: a A {,,4,6,8,} - the set of even numbers between zero and b B { red, white, bule} - the set

More information

QUADRATIC FUNCTIONS. ( x 7)(5x 6) = 2. Exercises: 1 3x 5 Sum: 8. We ll expand it by using the distributive property; 9. Let s use the FOIL method;

QUADRATIC FUNCTIONS. ( x 7)(5x 6) = 2. Exercises: 1 3x 5 Sum: 8. We ll expand it by using the distributive property; 9. Let s use the FOIL method; QUADRATIC FUNCTIONS A. Eercises: 1.. 3. + = + = + + = +. ( 1)(3 5) (3 5) 1(3 5) 6 10 3 5 6 13 5 = = + = +. ( 7)(5 6) (5 6) 7(5 6) 5 6 35 4 5 41 4 3 5 6 10 1 3 5 Sum: 6 + 10+ 3 5 ( + 1)(3 5) = 6 + 13 5

More information

Econ 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. 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 information

ECONOMIC OPTIMALITY. Date: October 10, 2005.

ECONOMIC 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 information

The general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.

The 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 information

EC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2

EC /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 information

Optimization. A first course on mathematics for economists

Optimization. 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 information

Introduction to Machine Learning Spring 2018 Note Duality. 1.1 Primal and Dual Problem

Introduction to Machine Learning Spring 2018 Note Duality. 1.1 Primal and Dual Problem CS 189 Introduction to Machine Learning Spring 2018 Note 22 1 Duality As we have seen in our discussion of kernels, ridge regression can be viewed in two ways: (1) an optimization problem over the weights

More information

How to Characterize Solutions to Constrained Optimization Problems

How 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 information

ε and ε > 0 we can find a δ > 0 such that

ε and ε > 0 we can find a δ > 0 such that John Riley June 5, 3 ANSWERS TO EXERCISES IN APPENDIX A SECTION A: MAPPINGS OF A SINGLE VARIABLE Eercise A-: Rules of limits (a) Limit of the sum = the sum of the limits We wish to estalish that for any

More information

Firms and returns to scale -1- John Riley

Firms and returns to scale -1- John Riley Firms and returns to scale -1- John Riley Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Natural monopoly 1 C. Constant returns to scale 21 D. The CRS economy 26 E. pplication

More information

In 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

In 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 information

Exercises - SOLUTIONS UEC Advanced Microeconomics, Fall 2018 Instructor: Dusan Drabik, de Leeuwenborch 2105

Exercises - SOLUTIONS UEC Advanced Microeconomics, Fall 2018 Instructor: Dusan Drabik, de Leeuwenborch 2105 Eercises - SOLUTIONS UEC-5806 Advanced Microeconomics, Fall 08 Instructor: Dusan Drabik, de Leeuwenborch 05. A consumer has a preference relation on R which can be represented by the utility function u()

More information

i) This is simply an application of Berge s Maximum Theorem, but it is actually not too difficult to prove the result directly.

i) This is simply an application of Berge s Maximum Theorem, but it is actually not too difficult to prove the result directly. Bocconi University PhD in Economics - Microeconomics I Prof. M. Messner Problem Set 3 - Solution Problem 1: i) This is simply an application of Berge s Maximum Theorem, but it is actually not too difficult

More information

Firms and returns to scale -1- Firms and returns to scale

Firms and returns to scale -1- Firms and returns to scale Firms and returns to scale -1- Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Constant returns to scale 19 C. The CRS economy 25 D. pplication to trade 47 E. Decreasing

More information

September Math Course: First Order Derivative

September 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 information

Problem Set 2 Solutions

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 information

Lecture 4: Optimization. Maximizing a function of a single variable

Lecture 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 information

Finite Dimensional Optimization Part I: The KKT Theorem 1

Finite 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 information

Convex Optimization Overview (cnt d)

Convex Optimization Overview (cnt d) Conve Optimization Overview (cnt d) Chuong B. Do November 29, 2009 During last week s section, we began our study of conve optimization, the study of mathematical optimization problems of the form, minimize

More information

E 600 Chapter 4: Optimization

E 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 information

Microeconomics, Block I Part 1

Microeconomics, Block I Part 1 Microeconomics, Block I Part 1 Piero Gottardi EUI Sept. 26, 2016 Piero Gottardi (EUI) Microeconomics, Block I Part 1 Sept. 26, 2016 1 / 53 Choice Theory Set of alternatives: X, with generic elements x,

More information

3. THE EXCHANGE ECONOMY

3. THE EXCHANGE ECONOMY Essential Microeconomics -1-3. THE EXCHNGE ECONOMY Pareto efficient allocations 2 Edgewort box analysis 5 Market clearing prices 13 Walrasian Equilibrium 16 Equilibrium and Efficiency 22 First welfare

More information

Tutorial 3: Optimisation

Tutorial 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 information

Consider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t

Consider 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 information

Universidad Carlos III de Madrid

Universidad Carlos III de Madrid Universidad Carlos III de Madrid Eercise 1 2 3 4 5 6 Total Points Department of Economics Mathematics I Final Eam January 22nd 2018 LAST NAME: Eam time: 2 hours. FIRST NAME: ID: DEGREE: GROUP: 1 (1) Consider

More information

TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM

TMA 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 information

f'(x) = x 4 (2)(x - 6)(1) + (x - 6) 2 (4x 3 ) f'(x) = (x - 2) -1/3 = x 2 ; domain of f: (-, ) f'(x) = (x2 + 1)4x! 2x 2 (2x) 4x f'(x) =

f'(x) = x 4 (2)(x - 6)(1) + (x - 6) 2 (4x 3 ) f'(x) = (x - 2) -1/3 = x 2 ; domain of f: (-, ) f'(x) = (x2 + 1)4x! 2x 2 (2x) 4x f'(x) = 85. f() = 4 ( - 6) 2 f'() = 4 (2)( - 6)(1) + ( - 6) 2 (4 3 ) = 2 3 ( - 6)[ + 2( - 6)] = 2 3 ( - 6)(3-12) = 6 3 ( - 4)( - 6) Thus, the critical values are = 0, = 4, and = 6. Now we construct the sign chart

More information

Essential Microeconomics : EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, first and second welfare theorems

Essential Microeconomics : EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, first and second welfare theorems Essential Microeconomics -- 5.2: EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, irst and second welare teorems A general model 2 First welare Teorem 7 Second welare teorem

More information

Chapter 2 THE MATHEMATICS OF OPTIMIZATION. Copyright 2005 by South-Western, a division of Thomson Learning. All rights reserved.

Chapter 2 THE MATHEMATICS OF OPTIMIZATION. Copyright 2005 by South-Western, a division of Thomson Learning. All rights reserved. Chapter THE MATHEMATICS OF OPTIMIZATION Copyright 005 by South-Western, a division of Thomson Learning. All rights reserved. 1 The Mathematics of Optimization Many economic theories begin with the assumption

More information

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

Extreme 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 information

Constrained maxima and Lagrangean saddlepoints

Constrained 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 information

Mathematics For Economists

Mathematics For Economists Mathematics For Economists Mark Dean Final 2010 Tuesday 7th December Question 1 (15 Points) Let be a continuously differentiable function on an interval in R. Show that is concave if and only if () ()

More information

The Fundamental Welfare Theorems

The 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 information

Homework 3 Suggested Answers

Homework 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 information

BEEM103 UNIVERSITY OF EXETER. BUSINESS School. January 2009 Mock Exam, Part A. OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions

BEEM103 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 information

University 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 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 information

Midterm Exam - Solutions

Midterm Exam - Solutions 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

More information

Section 3.3 Graphs of Polynomial Functions

Section 3.3 Graphs of Polynomial Functions 3.3 Graphs of Polynomial Functions 179 Section 3.3 Graphs of Polynomial Functions In the previous section we eplored the short run behavior of quadratics, a special case of polynomials. In this section

More information

Microeconomic Theory. Microeconomic Theory. Everyday Economics. The Course:

Microeconomic 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 information

Constrained Optimization

Constrained 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 information

Gauss-Jordan Elimination for Solving Linear Equations Example: 1. Solve the following equations: (3)

Gauss-Jordan Elimination for Solving Linear Equations Example: 1. Solve the following equations: (3) The Simple Method Gauss-Jordan Elimination for Solving Linear Equations Eample: Gauss-Jordan Elimination Solve the following equations: + + + + = 4 = = () () () - In the first step of the procedure, we

More information

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -1- Convexity and quasi-convexity Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -2- Convexity and quasi-convexity

More information

INTRODUCTORY MATHEMATICS FOR ECONOMICS MSCS. LECTURE 3: MULTIVARIABLE FUNCTIONS AND CONSTRAINED OPTIMIZATION. HUW DAVID DIXON CARDIFF BUSINESS SCHOOL.

INTRODUCTORY MATHEMATICS FOR ECONOMICS MSCS. LECTURE 3: MULTIVARIABLE FUNCTIONS AND CONSTRAINED OPTIMIZATION. HUW DAVID DIXON CARDIFF BUSINESS SCHOOL. INTRODUCTORY MATHEMATICS FOR ECONOMICS MSCS. LECTURE 3: MULTIVARIABLE FUNCTIONS AND CONSTRAINED OPTIMIZATION. HUW DAVID DIXON CARDIFF BUSINESS SCHOOL. SEPTEMBER 2009. 3.1 Functions of more than one variable.

More information

Gi en Demand for Several Goods

Gi en Demand for Several Goods Gi en Demand for Several Goods Peter Norman Sørensen January 28, 2011 Abstract The utility maimizing consumer s demand function may simultaneously possess the Gi en property for any number of goods strictly

More information

14 March 2018 Module 1: Marginal analysis and single variable calculus John Riley. ( x, f ( x )) are the convex combinations of these two

14 March 2018 Module 1: Marginal analysis and single variable calculus John Riley. ( x, f ( x )) are the convex combinations of these two 4 March 28 Module : Marginal analysis single variable calculus John Riley 4. Concave conve functions A function f( ) is concave if, for any interval [, ], the graph of a function f( ) is above the line

More information

FIN 550 Practice Exam Answers. A. Linear programs typically have interior solutions.

FIN 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 information

EC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline

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 information

Concave programming. Concave programming is another special case of the general constrained optimization. subject to g(x) 0

Concave 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 information

where u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.

where 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 information

FIN 550 Exam answers. A. Every unconstrained problem has at least one interior solution.

FIN 550 Exam answers. A. Every unconstrained problem has at least one interior solution. FIN 0 Exam answers Phil Dybvig December 3, 0. True-False points A. Every unconstrained problem has at least one interior solution. False. An unconstrained problem may not have any solution at all. For

More information

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following

More information

Utility Maximization Problem

Utility Maximization Problem Demand Theory Utility Maximization Problem Consumer maximizes his utility level by selecting a bundle x (where x can be a vector) subject to his budget constraint: max x 0 u(x) s. t. p x w Weierstrass

More information

Differentiable Welfare Theorems Existence of a Competitive Equilibrium: Preliminaries

Differentiable Welfare Theorems Existence of a Competitive Equilibrium: Preliminaries Differentiable Welfare Theorems Existence of a Competitive Equilibrium: Preliminaries Econ 2100 Fall 2017 Lecture 19, November 7 Outline 1 Welfare Theorems in the differentiable case. 2 Aggregate excess

More information

Mathematics Review For GSB 420. Instructor: Tim Opiela

Mathematics Review For GSB 420. Instructor: Tim Opiela Mathematics Review For GSB 40 Instructor: Tim Opiela I. lgebra Review. Solving Simultaneous Equations Two equations with two unknowns Supply: Q S = 75 +3P Demand: Q D = 5 P Solve for Equilibrium P and

More information

Chiang/Wainwright: Fundamental Methods of Mathematical Economics

Chiang/Wainwright: Fundamental Methods of Mathematical Economics Chiang/Wainwright: Fundamental Methods of Mathematical Economics CHAPTER 9 EXERCISE 9.. Find the stationary values of the following (check whether they are relative maima or minima or inflection points),

More information

Economics 205 Exercises

Economics 205 Exercises Economics 05 Eercises Prof. Watson, Fall 006 (Includes eaminations through Fall 003) Part 1: Basic Analysis 1. Using ε and δ, write in formal terms the meaning of lim a f() = c, where f : R R.. Write the

More information

THE FIRM: OPTIMISATION

THE FIRM: OPTIMISATION Prerequisites Almost essential Firm: Basics THE FIRM: OPTIMISATION MICROECONOMICS Principles and Analysis Frank Cowell Note: the detail in slides marked * can only be seen if you run the slideshow July

More information

Constrained Optimization. Unconstrained Optimization (1)

Constrained Optimization. Unconstrained Optimization (1) Constrained Optimization Unconstrained Optimization (Review) Constrained Optimization Approach Equality constraints * Lagrangeans * Shadow prices Inequality constraints * Kuhn-Tucker conditions * Complementary

More information

Econ Slides from Lecture 14

Econ 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 information

Pareto Efficiency (also called Pareto Optimality)

Pareto Efficiency (also called Pareto Optimality) Pareto Efficiency (also called Pareto Optimality) 1 Definitions and notation Recall some of our definitions and notation for preference orderings. Let X be a set (the set of alternatives); we have the

More information

g(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to

g(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 information

The Necessity of the Transversality Condition at Infinity: A (Very) Special Case

The 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 information

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

I.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 information

First Variation of a Functional

First Variation of a Functional First Variation of a Functional The derivative of a function being zero is a necessary condition for the etremum of that function in ordinary calculus. Let us now consider the equivalent of a derivative

More information

Test code: ME I/ME II, 2004 Syllabus for ME I. Matrix Algebra: Matrices and Vectors, Matrix Operations, Determinants,

Test code: ME I/ME II, 2004 Syllabus for ME I. Matrix Algebra: Matrices and Vectors, Matrix Operations, Determinants, Test code: ME I/ME II, 004 Syllabus for ME I Matri Algebra: Matrices and Vectors, Matri Operations, Determinants, Nonsingularity, Inversion, Cramer s rule. Calculus: Limits, Continuity, Differentiation

More information

Constrained Optimization and Lagrangian Duality

Constrained 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 information

1. f(β) 0 (that is, β is a feasible point for the constraints)

1. f(β) 0 (that is, β is a feasible point for the constraints) xvi 2. The lasso for linear models 2.10 Bibliographic notes Appendix Convex optimization with constraints In this Appendix we present an overview of convex optimization concepts that are particularly useful

More information

Dynamic 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 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 information

Economics 101. Lecture 2 - The Walrasian Model and Consumer Choice

Economics 101. Lecture 2 - The Walrasian Model and Consumer Choice Economics 101 Lecture 2 - The Walrasian Model and Consumer Choice 1 Uncle Léon The canonical model of exchange in economics is sometimes referred to as the Walrasian Model, after the early economist Léon

More information

2.2 BUDGET-CONSTRAINED CHOICE WITH TWO COMMODITIES

2.2 BUDGET-CONSTRAINED CHOICE WITH TWO COMMODITIES Essential Miroeonomis -- 22 BUDGET-CONSTRAINED CHOICE WITH TWO COMMODITIES Continuity of demand 2 Inome effets 6 Quasi-linear, Cobb-Douglas and CES referenes 9 Eenditure funtion 4 Substitution effets and

More information

5.6 Asymptotes; Checking Behavior at Infinity

5.6 Asymptotes; Checking Behavior at Infinity 5.6 Asymptotes; Checking Behavior at Infinity checking behavior at infinity DEFINITION asymptote In this section, the notion of checking behavior at infinity is made precise, by discussing both asymptotes

More information

Question 1. (8 points) The following diagram shows the graphs of eight equations.

Question 1. (8 points) The following diagram shows the graphs of eight equations. MAC 2233/-6 Business Calculus, Spring 2 Final Eam Name: Date: 5/3/2 Time: :am-2:nn Section: Show ALL steps. One hundred points equal % Question. (8 points) The following diagram shows the graphs of eight

More information

Duality. for The New Palgrave Dictionary of Economics, 2nd ed. Lawrence E. Blume

Duality. for The New Palgrave Dictionary of Economics, 2nd ed. Lawrence E. Blume Duality for The New Palgrave Dictionary of Economics, 2nd ed. Lawrence E. Blume Headwords: CONVEXITY, DUALITY, LAGRANGE MULTIPLIERS, PARETO EFFICIENCY, QUASI-CONCAVITY 1 Introduction The word duality is

More information

Optimization Theory. Lectures 4-6

Optimization 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 information

Newton-Type Algorithms for Nonlinear Constrained Optimization

Newton-Type Algorithms for Nonlinear Constrained Optimization Newton-Type Algorithms for Nonlinear Constrained Optimization Angelika Altmann-Dieses Faculty of Management Science and Engineering Karlsruhe University of Applied Sciences Moritz Diehl Department of Microsystems

More information

DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION

DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION UNIVERSITY OF MARYLAND: ECON 600. Alternative Methods of Discrete Time Intertemporal Optimization We will start by solving a discrete time intertemporal

More information

Review of Optimization Methods

Review 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 information