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


 Earl Long
 1 years ago
 Views:
Transcription
1 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 6 Concave optimization problem 8 Sufficient conditions 9 Application: Joint Costs More on the Second Constraint Qualification 6 Exercises 9 Answer to Exercise 3 3 John Riley September 5,
2 Mathematical Foundations  Constrained Optimization AN INTUITIVE APPROACH Max{ f ( x) b g( x), x } x We shall interpret this mathematical problem as the decision problem of a profit maximizing firm The revenue from the production plan x is f( x ) The firm can produce any vector of outputs x which satisfies the nonnegativity constraint, x and a resource constraint gx ( ) b A simple example is a linear constraint Each unit of x requires a units of resource b Then n a x= ax b = John Riley September 5,
3 Mathematical Foundations 3 Constrained Optimization Suppose that x solves the optimization problem If the firm increases x, the marginal revenue is, f g ( x) However, the increase in x also utilizes additional resources The extra resource use is ( x ) x We now introduce a resource price λ and ask what price this must be if the profit maximizing decision is to continue to choose x g Note that given the resource price λ the marginal cost of x is λ ( x ) * John Riley September 5,
4 Mathematical Foundations 4 Constrained Optimization Suppose that x solves the optimization problem If the firm increases x, the marginal revenue is, f g ( x) However, the increase in x also utilizes additional resources The extra resource use is ( x ) x We now introduce a resource price λ and ask what price this must be if the profit maximizing decision is to continue to choose x g Note that given the resource price λ the marginal cost of x is λ ( x ) If x > marginal revenue must be equal to marginal cost so f g MR MC = ( x) λ ( x) = If x = the marginal profit must be negative so f g MR MC = ( x) λ ( x) If there is no market price we follow the same approach Instead of the market price we introduce a shadow price λ to reflect the opportunity cost of using the additional resources The FOC are then the conditions above with the as if market price if there is no actual market price John Riley September 5,
5 Mathematical Foundations 5 Constrained Optimization Summarizing our results f g ( x)  λ ( x), with equality if x > Equivalently: f g f g ( x)  λ ( x), and x ( ( x)  λ ( x)) = The second condition is called a complementary slackness condition as it can only hold if one but not f g both of the conditions (i) MR MC = ( x)  λ ( x) and (ii) x is not binding (ie slack ) John Riley September 5,
6 Mathematical Foundations 6 Constrained Optimization Since x must be feasible b gx ( ) 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 gx ( ), with equality if λ > Equivalently: b gx ( ) and λ( b gx ( )) = Once again at most one of the inequalities b gx ( ) and λ can be slack So this is a second complementary slackness condition Generalization to multiple constraints Suppose that there are m constraints and we write these as follows h( x), i =,, m Arguing in the same way we introduce a shadow price λ i for the ith constraint i FOC: MR f m gi MC = i= with equality if x > =,, n John Riley September 5,
7 Mathematical Foundations 7 Constrained Optimization There is a convenient way to remember these conditions Write the ith constraint in the form hi ( x), i =,, m In vector notation hx ( ) (Thus in our example we write the constraint as h( x) = b gx ( ) ) Then introduce a vector of Lagrange multipliers or shadow prices λ and define the Lagrangian L ( x, λ) = f( x) + λ hx ( ) The first order conditions are then all restrictions on the partial derivatives of L ( x, λ) f h (i) = + λ, i with equality if x >, =,, n L (ii) hi ( x), λ = i with equality if λ i >, i =,, m Exercise: Solve the following problem Max{ U ( x) = ln x+ ln( x + x3) px+ px + p3x3 6} (i) if p = (,, 6) (ii) p = (,,) (iii) p = (,,4) John Riley September 5,
8 Mathematical Foundations 8 Constrained Optimization Restatement of FOC (i) L f h and x L = + λ = i, =,, n (ii) = hi( x) and λi = λ λ i i, i =,, m In vector notation (i) L f h and x L = + λ = (ii) = hx ( ) and λ = λ λ BUT It turns out that this intuitive argument is not quite correct It breaks down in some exceptional cases To avoid these we some very mild impose mild restrictions on the constraints These are called constraint qualifications John Riley September 5,
9 Mathematical Foundations 9 Constrained Optimization Constraint Qualifications Consider the maximization problem Max{ f ( x) x X} where X = { x x, h( x), i =,, m} x i The constraint qualifications holds at x X if hi (i) for each constraint that is binding at x the associated gradient vector ( x ) (ii) X, the set of nonnegative vectors satisfying the linearized binding constraints has a nonempty interior L hi Note: The linear function hi ( x) = hi( x) + ( x) ( x x) has the same value and gradient as the function hi ( x ) at x Thus the linear approximation at x of the ith constraint hi ( x) is hi hi ( x) + ( x) ( x x) hi Since hi ( x ) = the linearized constraint is ( x ) ( x x ) John Riley September 5,
10 Mathematical Foundations  Constrained Optimization Remark: Satisfying the second constraint qualification At the end of these slides is a proof of the following proposition Proposition: Suppose that we relabel the constraints so that it is the first I that are binding at x, that is h x = i = I Suppose also that there are J variables for which the nonnegativity constraint i ( ),,, is binding Then consider the I linearized binding constraints and J binding nonnegativity constraints This is a system of I + J linear constraints the second constraint qualification holds at A ( x x ) = If the rows of A are linearly independent then x As a practical matter, this result is almost never employed in economic analysis The reason is that economists typically make assumptions that imply that the feasible set X is convex and has a nonempty interior As we shall see, when these assumptions hold, checking the first constraint qualification is enough John Riley September 5,
11 Mathematical Foundations  Constrained Optimization Example : Constraint qualification holds Max{ f ( x) = ln x x x, h( x) = x x } x As is readily confirmed, the maximizing value of x is x = (,) The feasible set and contour set for f through x = (,) are depicted The Lagrangian is L ( x, λ) = ln x+ ln x + λ( x x) The first order conditions are therefore Fig : Constrained maximum (i) L x = λ, x with equality if x >, =, L (ii) x x, λ = with equality if λ > As is readily checked, the necessary conditions are all satisfied at ( x, λ ) = (,,) John Riley September 5,
12 Mathematical Foundations  Constrained Optimization Example : Constraint qualification does not hold x 3 { ( ) ln ln, ( ) ( ) } Max f x = x + x x h x = x x Since the feasible set and maximand are exactly the same as in example, the solution is again x = (,) The Lagrangian is ( x, ) ln x ln x ( x x ) 3 L λ = + + λ Fig : Constrained maximum Differentiating by x, L x = x x = x 3 λ( ) at x = (,) John Riley September 5,
13 Mathematical Foundations 3 Constrained Optimization Thus the first order condition does not hold at the maximum Our intuitive argument breaks down because h, the gradient of the constraint function, is zero at the maximum Thus the partial derivatives x of h no longer reflect the opportunity cost of the scarce resource More formally, at the maximum x, the linear approximation of the constraint is L hi hi ( x) = hi( x) + ( x) ( x x) Then, as long as the constraint is binding ( hi ( x ) = ) and the gradient vector is not zero, the linearized constraint is h i ( x ) ( x x ), i =,, m John Riley September 5,
14 Mathematical Foundations 4 Constrained Optimization There is a second (though unlikely) situation in which the linear approximations fail Consider the following problem Max{ f ( x) = x + x h( x) = ( x ) x, x } x 3 The feasible set is the shaded region in the figure Also depicted is the contour set for f through x = (,) From the figure it is clear that f takes on its maximum at x = (,) Fig a: Original problem However, L x = = ( x) 3 λ( x ) Thus again the first order conditions do not hold at the maximum John Riley September 5,
15 Mathematical Foundations 5 Constrained Optimization This time the problem occurs because the feasible set, after taking a linear approximation of the constraint function, looks nothing like the original feasible set h At x, the gradient vector ( x ) = (, ) Thus the linear approximation of the constraint hx ( ) through x is Linearized feasible set Fig b: Linearized problem h h h ( x) ( x x) = ( x)( x ) + ( x) x = x Since x must be nonnegative, the only feasible value of x is x = In Figure b the linearized feasible set is therefore the horizontal axis Then the solution to the linearized problem is not the solution to the original problem John Riley September 5,
16 Mathematical Foundations 6 Constrained Optimization As long as the constraint qualifications hold, the intuitively derived conditions are indeed necessary conditions This is summarized below Proposition: First Order Conditions for a Constrained Maximum Suppose x solves Max{ f ( x) x X} where X= { x x, hx ( ) } x If the constraint qualifications hold at x then there exists a vector of shadow prices λ such that and ( x, λ), =,, n with equality if x > ( x, λ), i =,, m with equality if λi > λ KuhnTucker conditions This result is usually attributed to Kuhn and Tucker However the first formal statement of the conditions is by Karush (939) John Riley September 5,
17 Mathematical Foundations 7 Constrained Optimization Special case: Concave optimization problem For the optimization problem Max{ f ( x) x X} where X= { x x, hx ( ) } x suppose that f, h,, h m are all concave functions Then if we can find some ( x, λ ) satisfying the FOC we don t have to worry about the constraint qualifications Example: Max{ u( x) p x I, x n + } where u is a concave function x hx ( ) = I px n = px is a concave function and the sum of concave functions is concave therefore hx ( ) is concave John Riley September 5,
18 Mathematical Foundations 8 Constrained Optimization Proposition: If conditions (i) and (ii) hold at ( x, λ ) X= { x x, hx ( ) } (i) L f h and x L = + λ = then x solves Max{ f ( x) x X} where x (ii) = hx ( ) and λ = λ hx ( ) = λ λ, i =,, m Proof: The sum of concave functions is concave so L ( x, λ) = f( x) + λ hx ( ) is a concave function of x Hence L( x, λ) L ( x, λ) + ( x, λ) ( x x) As you can check from the FOC, the second term on the right hand side is negative Also, appealing to (ii) L ( x, λ ) = f( x) Therefore L ( x, λ) = f( x) + λ h( x) f( x) But λ hx ( ) for any feasible x Therefore f( x) f( x) John Riley September 5,
19 Mathematical Foundations 9 Constrained Optimization Proposition: Sufficient Conditions for a Maximum Suppose that f and h, i =,, m are quasiconcave and the i feasible set X= { x x, hx ( ) } has a nonempty interior f If the KuhnTucker conditions hold at x, ( x) x hi and for each binding constraint, ( x ), then x solves Max{ f ( x) x, h ( x), i =,, m} x i Intuition: Under these assumptions the feasible set is convex and hence the linearized feasible set X contains the original feasible set X Then it is sufficient to show that X has a nonempty interior John Riley September 5,
20 Mathematical Foundations  Constrained Optimization Application: Joint Costs An electricity company has an interest cost c o = per day for each unit of turbine capacity For simplicity we define a unit of capacity as megawatt It faces daytime and nighttime demand price functions as given below The operating cost of running a each unit of turbine capacity is in the day time and at night p = q, p = q Formulating the problem Solving the problem Understanding the solution (developing the economic insights) John Riley September 5,
21 Mathematical Foundations  Constrained Optimization Try a simple approach Each unit of turbine capacity costs + to run each day plus has an interest cost of so MC=4 With q units sold the sum of the demand prices is 3 q so revenue is TR = q(3 q) hence * MR = 3 4q Equate MR and MC q = 65 John Riley September 5,
22 Mathematical Foundations  Constrained Optimization Try a simple approach Each unit of turbine capacity costs + to run each day plus has an interest cost of so MC=4 With q units sold the sum of the demand prices is 3 q so revenue is TR = q(3 q) hence MR = 3 4q Equate MR and MC * q = 65 Lets take a look on the margin in the day and night time TR = q ( q ) then MR = q TR = q( q) then MR = q MR <!!!!!!!!!! Now what? John Riley September 5,
23 Mathematical Foundations 3 Constrained Optimization Key is to realize that there are really three variables Production in each of the two periods q and q and the plant capacity q Cq ( ) = q + q + q Rq ( ) = R( q) + R( q) = ( q) q+ ( q) q Constraints h( q) = q q h( q) = q q John Riley September 5,
24 Mathematical Foundations 4 Constrained Optimization Key is to realize that there are really three variables Production in each of the two periods q and q and the plant capacity q Cq ( ) = cq where c= ( c, c, c) = (,,) Rq ( ) = R( q) + R( q) = ( q) q+ ( q) q Constraints: h ( q) = q q h( q) = q q L = R ( q ) + R ( q ) c q cq c q + λ ( q q ) + λ ( q q ) KuhnTucker conditions = MR ( q ) c λ, q with equality if q >, =, = c + λ+ λ, q with equality if q > = q qi, λ i with equality if λ i >, i=, John Riley September 5,
25 Mathematical Foundations 5 Constrained Optimization KuhnTucker conditions = q λ, q = q λ, q with equality if q > with equality if q > = + λ+ λ, q with equality if q > = q q, λ = q q, λ with equality if λ > with equality if λ > Solve by trial and error (i) Suppose q > and both shadow prices are positive Then q = q = q (ii) Solve and you will find that one of the shadow prices is negative But this is impossible (iii) Inspired guess That shadow price must be zero Then the positive shadow price must be John Riley September 5,
26 Mathematical Foundations 6 Constrained Optimization Technical Remark: Satisfying the second constraint qualification Proposition: Suppose that we relabel the constraints so that it is the first I that are binding at x, that is h x = i = I Suppose also that there are J variables for which the nonnegativity constraint i ( ),,, is binding Then consider the I linearized binding constraints and J binding nonnegativity constraints This is a system of K = I + J linear constraints then the second constraint qualification holds at A ( x x ) = If the rows of A are linearly independent x Proof: Suppose that at x there are I binding constraints We relabel these so that h x = i = I and i ( ),,, i ( ), h x > i > I The linearized feasible set is therefore h {, i ( ) ( ),,, } X = x x x x x i = I Suppose that there are J variables for which x =, = I +,, I + J x = We relabel these variables so that Thus there are K = I + J binding constraints in the linearized feasible set Suppose we choose x = x > K (), John Riley September 5,
27 Mathematical Foundations 7 Constrained Optimization Then the K binding constraints can be rewritten as a system of K linear equations in K unknowns h h h h ( x ) ( x ) ( x ) ( x ) I I+ K x x hi hi hi h I x I xi ( x ) ( x ) ( x ) ( x ) = I I I+ K x I+ xi+ x K xk () Choose b, k =,, K and consider the following linear equation system k h h h h ( x ) ( x ) ( x ) ( x ) b h h h h x x b = b x b K xk I I+ n x x I I I I I I I ( x ) ( x ) ( x ) ( x ) I I I+ I xi+ xi+ I + K (3) John Riley September 5,
28 Mathematical Foundations 8 Constrained Optimization If the columns (or rows) of the matrix are independent, then the matrix is invertible Then for each b there is a unique solution x ( b), k =,, K For k > K define Consider any b >> From (3) it follows that h x x b x b i I k x ( b) = x n i ( )( ( ) ) = i >, =,, } and ( ),,, = k k x b = b = I + K Remember that x b = x > k > K Also x () >, k =,, I k( ) k, k Then for b >> and sufficiently small x ( b) >, k =,, I Thus for b >> and sufficiently small h x x b x i I n i ( )( ( ) ) >, =,, and ( ) = k xb >> Thus X has a nonempty interior QED John Riley September 5,
29 Mathematical Foundations 9 Constrained Optimization Exercises Utility maximization ux ( ) = x x + 4x x The price vector is p = (,) Solve for the utility maximizing consumption vector if (i) I = 6 (ii) I = Utility maximization ux ( ) = ln x+ 4x x The price vector is p = (,) (a) Solve for the utility maximizing consumption vector if I = 7 (b) For what income levels (if any) is consumption of commodity equal to zero? 3 Cost minimization The maximum output that a firm can produce with input vector z = ( z, z) is mapping is called a production function) q = ( z + z ) (This / (a) Confirm that the constraint qualifications hold for any feasible input vector x > (b) If the input price vector is r, solve for the cost minimizing inputs and hence the minimum cost under the assumption that q> ( r / r ) (c) Show that marginal cost is an increasing function for q r r > ( / ) John Riley September 5,
30 Mathematical Foundations 3 Constrained Optimization (d) Show also that an increase in one of the two input prices has no effect on marginal cost Do you find this puzzling? (e) Solve also for minimized cost if q r r < ( / ) (f) Is marginal cost MC( q ) continuous on +? 4 Peak and offpeak pricing An electric power company divided the day into three equal periods The demand prices in the three periods are as follows p = a q, p = q, p = q 3 The unit cost of producing electricity in each period is If the capacity of the firm is q (so that the maximum output in each period is q) the interest cost per day is 4q That is, the unit cost of capacity is 4 (a) If a = 4 solve for the profit maximizing outputs and prices in each period (b) Solve again if a = 6 (c) Returning to the first case, show that the total (ie gross) benefit of the production plan ( q, q, q 3) is B= 4q q + q q + q q (d) Show that social surplus (SS = BC) is maximized with a plan twice as large as the profit maximizing plan John Riley September 5,
31 Mathematical Foundations 3 Constrained Optimization Answer to Exercise 3 The production function q= F( z) is the maximum output that can be produced using input vector z Thus the set Z = { z F( z) q } is the set of feasible input vectors As depicted, cost is minimized at z >> If you check the slopes at A and B you will see why one of these points will be cost minimizing for some range of input price ratios while the other is never cost minimizing Note that if q = the cost minimizing input vector is z = Henceforth we consider q > Then for feasibility, z > Define hz ( ) = ( z+ z ) q Then / h = / / / (( z + z ),( z + z ) z ) z John Riley September 5,
32 Mathematical Foundations 3 Constrained Optimization Constraint Qualifications Note that h ( z ) > z if z > Then the first CQ is satisfied Note next that z + z is concave since it is the sum of two concave functions Since / y is strictly increasing on + it follows that hz ( ) = ( z+ z ) qis strictly quasiconcave Then we olny need to / check that the feasible set Z = { z F( z) q } has a nonempty interior Note that if / z = ( q, q) then hz ( ) = ( z+ z ) q= 8q> Thus the interior of Z is indeed nonempty / Minimization problem Min{ r z + r z ( z + z ) q } z / Note that if the constraint is not binding, then cost can be reduced by reducing z Thus at z the constraint must be binding Maximization problem Max{ r z r z ( z + z ) q } z / John Riley September 5,
33 Mathematical Foundations 33 Constrained Optimization The Lagrangian for this optimization problem is L = rz rz + λ(( z + z ) q) / KuhnTucker conditions L = / r + λ( z + z ) z with equality if z > () z = r + λ( z + z ) z / / with equality if z > () L = / ( z + z ) q λ with equality if λ > (3) Since q >, z > If z > () is an equality and so λ > If z > () is an equality and so again λ > John Riley September 5,
34 Mathematical Foundations 34 Constrained Optimization We can rewrite () and () as follows: λ ( z + z ) r with equality if z > () / λ ( z + z ) rz with equality if z > () / / Case (i) Try z >> Then both () and () are equalities and so r = rz / Then z r = and so / r z r r = ( ) From (3) ( z + z ) = q Therefore / z r r / = q ( ) Note that since we assumed that z >, q r ( ) >, that is r / q r r > 4( ) Total cost is r C( q) = r z = rq r / John Riley September 5,
35 Mathematical Foundations 35 Constrained Optimization Case (ii) Try z = Then from (3) 4z Then = q C( q) rq 4 = rz = for q r r 4( ) Note: For a complete solution you should check that equality () and inequality () are both satisfied Marginal cost MC MC dc r r = =, q 4( ) dq 4 r dc r r = =, q > 4( ) dq q r / If you check you will find that MC is continuous John Riley September 5,
CHAPTER 12: 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 informationFirms 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 informationFirms 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 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 informationMathematical Foundations II
Mathematical Foundations 21 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 informationMathematical 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 informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization KuhnTucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization KuhnTucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More information1.4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION
Essential Microeconomics  4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION Fundamental Theorem of linear Programming 3 Nonlinear optimization problems 6 KuhnTucker necessary conditions Sufficient conditions
More informationNonlinear Programming and the KuhnTucker Conditions
Nonlinear Programming and the KuhnTucker Conditions The KuhnTucker (KT) conditions are firstorder conditions for constrained optimization problems, a generalization of the firstorder conditions we
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 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 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 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 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 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 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 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 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 KarushKuhnTucker conditions................................................. page Specification
More informationEcon 508A FINITE DIMENSIONAL OPTIMIZATION  NECESSARY CONDITIONS. Carmen AstorneFigari Washington University in St. Louis.
Econ 508A FINITE DIMENSIONAL OPTIMIZATION  NECESSARY CONDITIONS Carmen AstorneFigari Washington University in St. Louis August 12, 2010 INTRODUCTION General form of an optimization problem: max x f
More informationDifferentiable 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 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 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 informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier MartinezGiralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization  NonLinear programming OPT p.1/45
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 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 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 informationRoles of Convexity in Optimization Theory. Efor, T. E and Nshi C. E
IDOSR PUBLICATIONS International Digital Organization for Scientific Research ISSN: 25507931 Roles of Convexity in Optimization Theory Efor T E and Nshi C E Department of Mathematics and Computer Science
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEME7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEME7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationPareto 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 informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The socalled Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
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 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 informationMathematical Foundations 1 Convexity and quasiconvexity. Convex set Convex function Concave function Quasiconcave function Supporting hyperplane
Mathematical Foundations 1 Convexity and quasiconvexity Convex set Convex function Concave function Quasiconcave function Supporting hyperplane Mathematical Foundations 2 Convexity and quasiconvexity
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 informationMidterm 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 informationwhere u is the decisionmaker 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: 1112 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decisionmakers (e.g. consumers,
More informationLagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark
Lagrangian Duality Richard Lusby Department of Management Engineering Technical University of Denmark Today s Topics (jg Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality R Lusby (42111) Lagrangian
More informationIn the Name of God. Sharif University of Technology. Microeconomics 1. Graduate School of Management and Economics. Dr. S.
In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics 1 44715 (139697 1 st term)  Group 1 Dr. S. Farshad Fatemi Chapter 10: Competitive Markets
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 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 informationMicroeconomics, 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 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 informationDuality. 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, QUASICONCAVITY 1 Introduction The word duality is
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 informationOPTIMISATION /09 EXAM PREPARATION GUIDELINES
General: OPTIMISATION 2 2008/09 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and
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 KuhnTucker conditions to inequality constrained optimization problems is another very, very important skill to your career as an economist. If
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 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 informationThe KuhnTucker Problem
Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming  The KuhnTucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The KuhnTucker
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.4 Sensitivity Analysis Copyright Cengage Learning. All rights reserved. Sensitivity Analysis In this section,
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 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 Alevel maths,
More informationHicksian Demand and Expenditure Function Duality, Slutsky Equation
Hicksian Demand and Expenditure Function Duality, Slutsky Equation Econ 2100 Fall 2017 Lecture 6, September 14 Outline 1 Applications of Envelope Theorem 2 Hicksian Demand 3 Duality 4 Connections between
More informationOptimization Theory. Lectures 46
Optimization Theory Lectures 46 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the nonnegative orthant {x0ú n x$0} Existence of a maximum:
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 informationEconomics 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 informationThe KuhnTucker and Envelope Theorems
The KuhnTucker and Envelope Theorems Peter Ireland EC720.01  Math for Economists Boston College, Department of Economics Fall 2010 The KuhnTucker and envelope theorems can be used to characterize the
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 informationMaximum Theorem, Implicit Function Theorem and Envelope Theorem
Maximum Theorem, Implicit Function Theorem and Envelope Theorem Ping Yu Department of Economics University of Hong Kong Ping Yu (HKU) MIFE 1 / 25 1 The Maximum Theorem 2 The Implicit Function Theorem 3
More informationTMA 4180 Optimeringsteori KARUSHKUHNTUCKER THEOREM
TMA 4180 Optimeringsteori KARUSHKUHNTUCKER THEOREM H. E. Krogstad, IMF, Spring 2012 KarushKuhnTucker (KKT) Theorem is the most central theorem in constrained optimization, and since the proof is scattered
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 informationIntroduction to General Equilibrium
Introduction to General Equilibrium Juan Manuel Puerta November 6, 2009 Introduction So far we discussed markets in isolation. We studied the quantities and welfare that results under different assumptions
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 informationSolutions. F x = 2x 3λ = 0 F y = 2y 5λ = 0. λ = 2x 3 = 2y 5 = x = 3y 5. 2y 1/3 z 1/6 x 1/2 = 5x1/2 z 1/6. 3y 2/3 = 10x1/2 y 1/3
econ 11b ucsc ams 11b Review Questions 3 Solutions Note: In these problems, you may generally assume that the critical point(s) you find produce the required optimal value(s). At the same time, you should
More informationIntroduction to General Equilibrium: Framework.
Introduction to General Equilibrium: Framework. Economy: I consumers, i = 1,...I. J firms, j = 1,...J. L goods, l = 1,...L Initial Endowment of good l in the economy: ω l 0, l = 1,...L. Consumer i : preferences
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 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 wellwritten and a pleasure to read. The
More informationi) 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 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 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 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) TsunFeng Chiang* *School of Economics, Henan University, Kaifeng, China November 1, 2015 Week 7: The Consumer
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 informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationAdvanced Microeconomics
Advanced Microeconomics Leonardo Felli EC441: Room D.106, Z.332, D.109 Lecture 8 bis: 24 November 2004 Monopoly Consider now the pricing behavior of a profit maximizing monopolist: a firm that is the only
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 informationEconomics 501B Final Exam Fall 2017 Solutions
Economics 501B Final Exam Fall 2017 Solutions 1. For each of the following propositions, state whether the proposition is true or false. If true, provide a proof (or at least indicate how a proof could
More informationQuadratic function and equations Quadratic function/equations, supply, demand, market equilibrium
Exercises 8 Quadratic function and equations Quadratic function/equations, supply, demand, market equilibrium Objectives  know and understand the relation between a quadratic function and a quadratic
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 informationLagrangian Duality. Evelien van der Hurk. DTU Management Engineering
Lagrangian Duality Evelien van der Hurk DTU Management Engineering Topics Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality 2 DTU Management Engineering 42111: Static and Dynamic Optimization
More informationDYNAMIC 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 informationCONSTRAINED NONLINEAR PROGRAMMING
149 CONSTRAINED NONLINEAR PROGRAMMING We now turn to methods for general constrained nonlinear programming. These may be broadly classified into two categories: 1. TRANSFORMATION METHODS: In this approach
More informationChapter 1  Preference and choice
http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set
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 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 MartinezGiralt Academic Year 20152016 4.1 Let f(x 1, x 2 ) = 2x 2 1 + x2 2. Solve the following
More informationBasic 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 nonnegativity constraints
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 informationConstrained Optimization
1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange
More informationOPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES
General: OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and homework.
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 informationDate: July 5, Contents
2 Lagrange Multipliers Date: July 5, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 14 2.3. Informative Lagrange Multipliers...........
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 information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 13 line supporting sentence
More informationMathematical Appendix
Ichiro Obara UCLA September 27, 2012 Obara (UCLA) Mathematical Appendix September 27, 2012 1 / 31 Miscellaneous Results 1. Miscellaneous Results This first section lists some mathematical facts that were
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 informationChapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem
Chapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem This chapter will cover three key theorems: the maximum theorem (or the theorem of maximum), the implicit function theorem, and
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 informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The socalled Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
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 informationAdding Production to the Theory
Adding Production to the Theory We begin by considering the simplest situation that includes production: two goods, both of which have consumption value, but one of which can be transformed into the other.
More information