ECONOMIC OPTIMALITY. Date: October 10, 2005.

Similar documents
STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY

CHAPTER 1-2: SHADOW PRICES

Review of Optimization Basics

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

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

PROFIT FUNCTIONS. 1. REPRESENTATION OF TECHNOLOGY 1.1. Technology Sets. The technology set for a given production process is defined as

The Kuhn-Tucker and Envelope Theorems

1.4 FOUNDATIONS OF CONSTRAINED OPTIMIZATION

Maximum Value Functions and the Envelope Theorem

E 600 Chapter 4: Optimization

CHAPTER 3: OPTIMIZATION

EC487 Advanced Microeconomics, Part I: Lecture 5

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

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

EC487 Advanced Microeconomics, Part I: Lecture 2

Convex Optimization & Lagrange Duality

The Kuhn-Tucker and Envelope Theorems

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

GARP and Afriat s Theorem Production

Optimization Paul Schrimpf September 12, 2018

Nonlinear Programming and the Kuhn-Tucker Conditions

Economics 205 Exercises

Week 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer November Theory 1, 2015 (Jehle and 1 / Reny, 32

Lakehead University ECON 4117/5111 Mathematical Economics Fall 2002

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

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

Problem Set 2 Solutions

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

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

Midterm Exam - Solutions

Duality Uses and Correspondences. Ryan Tibshirani Convex Optimization

Alfred Marshall s cardinal theory of value: the strong law of demand

Notes on Consumer Theory

Economics 121b: Intermediate Microeconomics Midterm Suggested Solutions 2/8/ (a) The equation of the indifference curve is given by,

1 Theory of the Firm: Topics and Exercises

Maximum Theorem, Implicit Function Theorem and Envelope Theorem

Gi en Demand for Several Goods

Content Pricing in Peer-to-Peer Networks

Mathematics Review For GSB 420. Instructor: Tim Opiela

Convex Optimization Overview (cnt d)

Optimization. A first course on mathematics for economists

Microeconomics, Block I Part 1

Microeconomics II. MOSEC, LUISS Guido Carli Problem Set n 3

Urban Economics. Yves Zenou Research Institute of Industrial Economics. July 17, 2006

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games

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

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Chiang/Wainwright: Fundamental Methods of Mathematical Economics

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

Mathematical Economics. Lecture Notes (in extracts)

Lecture Notes. Microeconomic Theory. Guoqiang TIAN Department of Economics Texas A&M University College Station, Texas

Week 9: Topics in Consumer Theory (Jehle and Reny, Chapter 2)

Constrained Optimization and Lagrangian Duality

Microeconomic Theory -1- Introduction

The Envelope Theorem

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

Shiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient

Mathematical models in economy. Short descriptions

Additional questions for Chapter 1 - solutions: 1. See Varian, p.20. Notice that Varian set a1=a2. 2. See Varian, p.20.

3. Neoclassical Demand Theory. 3.1 Preferences

University of California, Davis Department of Agricultural and Resource Economics ARE 252 Lecture Notes 2 Quirino Paris

ECON2285: Mathematical Economics

Properties of Walrasian Demand

Elements of Economic Analysis II Lecture VII: Equilibrium in a Competitive Market

Unlinked Allocations in an Exchange Economy with One Good and One Bad

Part I Analysis in Economics

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

A three-level MILP model for generation and transmission expansion planning

Lecture 1- The constrained optimization problem

Microeconomics I. September, c Leopold Sögner

LINEAR PROGRAMMING II

Subgradient. Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes. definition. subgradient calculus

Competitive Consumer Demand 1

Constrained maxima and Lagrangean saddlepoints

More on Lagrange multipliers

Constrained Optimization

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

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

Motivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:

Computational procedure for a time-dependent Walrasian price equilibrium problem

Operations Research Letters

On the (Non-)Differentiability of the Optimal Value Function When the Optimal Solution Is Unique

Optimality Conditions for Constrained Optimization

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY

Berge s Maximum Theorem

4) Univariate and multivariate functions

Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control

Chapter 4. Maximum Theorem, Implicit Function Theorem and Envelope Theorem

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

ENVELOPE THEOREMS FOR ARBITRARY CHOICE SETS. By Paul Milgrom and Ilya Segal 1

Department of Agricultural Economics. PhD Qualifier Examination. May 2009

Advanced Economic Growth: Lecture 21: Stochastic Dynamic Programming and Applications

Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1

Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2)

The Fundamental Welfare Theorems

Mathematics II, course

Notes on General Equilibrium

Final Exam - Math Camp August 27, 2014

Roles of Convexity in Optimization Theory. Efor, T. E and Nshi C. E

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

Transcription:

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 a by choosing the levels of. The parameter a is used to represent all aspects of the problem not under the control of the decision maker in this particular problem. The level of chosen is a member of a nonempty and compact set G. If the constraint set can represented by a system of equations, standard Lagrangian techniques may be used. If the set is represented by a system of inequalities, then nonlinear programming and Kuhn-Tucker conditions could be used. The optimal values of are written as a function of a or (a). These are the reduced form or economic epressions we regularly use such as supplies, demands and investment levels. 1.2. Weierstrass Maimum Theorem. Theorem 1 (Weierstrass). Let f: X R be a continuous real-valued function on a non-empty compact metric space X. Let M = sup X f() and m = inf X f(). Then there is a point M and a point m such that f( M ) = M and f( m ) = m (Debreu [2, p. 16]). For our purposes we can assume that the metric space X is R n with the usual metric = ( n i=1 2 i ) 1 2. The theorem implies that a continuous function on a nonempty closed bounded set achieves a maimum and a minimum in the set. 1.3. The indirect objective or optimal value function. If the optimal values of the decision variables are substituted in the objective function h( ), the indirect objective or optimal value function is obtained. Specifically V(a) = ma h(, a) such that G(a) (2) =(h( (a),a) The indirect objective function gives the optimized value of the objective function as a function of the parameters not controlled by the agent. The values of the decision variables are set at their optimized levels. For eample, for the consumer, if we substitute the optimal consumption choices as functions of prices and income in the utility function, we get the indirect utility function ψ(p 1,p 2,...,p n, m). For a firm, if we substitute the cost minimizing input quantities as functions of the input prices and the level of output in the epression for cost, we obtain the cost function C(y, w 1,w 2,... w n ). If, for a firm, we substitute the optimal levels of inputs as functions of output and input prices in the epression for profit, we obtain the profit function π(p, w 1,w 2,... w n ). Date: October 10, 2005. 1

2 ECONOMIC OPTIMALITY 1.4. Theorem of the Maimum. Important continuity results about optimal value functions are given by the theorem of the maimum. Theorem 2 (Theorem of the Maimum). Let h(,a) be a continuous function with a compact range and suppose that the constraint set G(a)is a non-empty, compact-valued, continuous correspondence of a. Then (i) The function V(a) = ma {h(, a) : G(a) } is continuous (ii) The correspondence m(a) = { G(a) : h(, a) = V (a} is nonempty, compact valued and upper semi-continuous. Proof: See Berge [1, p. 116]. m(a) consists of those values of in the constraint set that yield the optimal value V(a) for a given a. 1.5. The envelope theorem. Consider the optimal value or indirect objective function. Assume that it is sufficiently smooth so that differentiation is possible. Then the envelope theorem says the following if a is a scalar or a = h( (a),a) (a) a + h( (a),a) a (3) = h( (a),a) (a) + h( (a),a) (4) if a is a vector. This is basically the result of totally differentiating the indirect objective function with respect to a parameter of the problem. However, the derivative of h with respect to is usually part of the first order conditions in the direct optimization problem. Thus the derivative of the indirect objective function can usually be simplified using those conditions. 1.5.1. The case of no constraint. Consider equation 1 with no constraint. The first order condition is which means that 3 simplifies to h((a),a) = 0 (5) a = h( (a),a) a 1.5.2. The case of a single equality constraint. Consider equation 1 with a single equality constraint as follows (6) ma h(, a) such that g(, a) = 0 Write the Lagrangian for the problem as (7) The first order conditions are L(, λ; a) =h(, a) λg(, a) (8) h(, a) g(, a) L = λ = 0 (9a) L λ = g(, a) = 0 (9b)

ECONOMIC OPTIMALITY 3 Now consider the indirect objective function for problem 7 V(a) = L( (a),λ (a); a) = h( (a),a) λ (a) g( (a),a) = h( (a),a) The second equality follows since g( (a),a) is identically zero. (10) The envelope theorem can be derived directly using the first order conditions and the derivatives of the Lagrangian or more indirectly using derivatives of the constraint. Consider first the derivative of 10 using the definition of the optimal L. = L( (a),λ (a); a) = L( (a),λ (a); a) (a) + L( (a), λ (a); a) λ λ (a) + L( (a),λ (a); a) = h( (a),a) λ (a) g( (a),a) (11) This can also be obtained by actually carrying out the differentiation implied by equation 10. = h( (a),a) (a) + h( (a),a) (12) The question is whether this epression can be simplified due to the fact the vector must satisfy the first order conditions in 9. First substitute 9a into 12 to obtain = λ (a) g( (a),a) (a) + h( (a),a) (13) The set of first order conditions in 9b do not appear in 13, but the derivative with respect to a i does appear. Differentiate this condition (which is an identity) to obtain g( (a),a) (a) g( (a),a) + g( (a),a) =0 (a) If this is substituted into 13 the envelope theorem result follows = g( (a),a) (14) = λ (a) g( (a),a) Some specific eamples will be given later. + h( (a),a) (15) 1.6. Optimality conditions when the constraint set is described by inequalities. 1.6.1. Description of the problem. We can often describe the constraint set G(a) using a series of inequalities. Consider the problem to minimize f() subject to g i () 0 for i = 1,...,I 1,g i () 0 for i =I 1 +1,...,I, and h j () = 0 for j = 1,...,J, and X, where X is an open set in R n. The problem would be written as follows:

4 ECONOMIC OPTIMALITY min f(, a) such that g i (, a) 0, i= 1, 2,, I 1 g i (, a) 0, i=i 1 +1, I 1 +2,, I h j (, a) = 0, j = 1, 2,, J (16) 1.6.2. Optimality conditions. The necessary conditions for this problem are known as Karush-Kuhn- Tucker conditions and can be epressed as follows where is a feasible solution: f( ) Σ I i=1 u i g i ( ) Σ J j=1λ j h j ( ) = 0 (17a) u i g i ( ) = 0, for i = 1,...,I (17b) u i 0, for i = 1,...,I 1 (17c) u i 0, for i = I 1 +1,...,I (17d) In a minimization problem set up this way, the constraints epressed as greater than will have positive multipliers. 1.6.3. Problems where the constraints are non-negativity constraints on the variables. Consider problems of the type: min f() subject to g i () 0 for i = 1,...,I, h j () = 0 for j = 1,...,J, and 0. Such problems with nonnegativity restrictions on the variables frequently arise in practice in situations where prices or quantities are positive. Clearly, the KKT conditions discussed earlier would apply as usual. However, it is sometimes convenient to eliminate the Lagrangian multipliers associated with 0. The conditions are then f ( ) Σ I i=1 u i g i ( ) Σ J j=1λ j h j ( ) 0 [ f ( ) Σ I i=1 u i g i ( ) Σ J j=1 λ j h j ( ) ] =0 u i g i ( ) = 0, for i = 1,...,I u i 0, for i = 1,...,I (18) 1.6.4. Maimization problems. Finally, consider the problem to maimize f() subject to g i () 0 for i =1,...,I 1,g i () 0fori=I 1 +1,...,I, h j () = 0 for j = 1,...,J, and X, where X is an open set in R n. The necessary conditions for optimality can be written as follows: f ( ) Σ I i=1 u i g i ( ) Σ J j=1 λ j h j ( ) = 0 (19a) u i g i ( ) =0, for i = 1,...,I (19b) u i 0, for i = 1,...,I 1 (19c) u i 0, for i = I 1 +1,...,I (19d) In a maimization problem set up in this fashion, the multipliers associated with less than constraints will have a positive sign.

ECONOMIC OPTIMALITY 5 2. EXAMPLE PROBLEMS 2.1. Profit maimization in the general case. a: Technology Consider the technology set or graph represented by T(y, ) = {(y, ) : y is producible using } (20) The uncontrolled parameters are the prices of inputs and outputs. These are considered to be vectors in R n + and R m + Denote these by w and p. The decision variables that are controlled by the agent are and y. ma,y py w s.t. [, y] ɛt (21) e: Indirect objective (optimal value) function The optimal decision variables are given by (p,w) and y (p,w). The indirect objective function is the profit function and is given by π = ma,y py w s.t. [, y] ɛt = py (p, w) w (p, w) (22) 2.2. Profit maimization with a single output. a: Technology Consider the production function represented by y = f(), ɛr n + and y ɛr m +. The uncontrolled parameters are the prices of inputs and the price of output. The input prices are considered to be a vector in R n ++ while p is in R ++.Denote these by w and p. The decision variable that is controlled by the agent is. e: First order conditions ma pf() w (23) p f() w = 0 (24) f: Indirect objective (optimal value) function The optimal decision variables are given by (p,w) and y = f( (p,w)). The indirect objective function is the profit function and is given by π = ma pf() w = pf( (p, w)) w (p, w) (25)

6 ECONOMIC OPTIMALITY g: Envelope theorem We can differentiate the optimal value function with respect to p and w and use the first order conditions to simplify. π(p, w) p π(p, w) w i = f ( (p, w)) + p f ( (p, w)) (p, w) w (p, w) p p ( = f ( (p, w)) + p f ) ( (p, w)) (p, w) w p = f ( (p, w)) = y (p, w) = p f ( (p, w)) (p, w) w (p, w) i (p, w) w i w ( i = p f ) ( (p, w)) (p, w) w i (p, w) w i = i (p, w) (26) 2.3. Profit maimization with a single output and fied inputs. a: Technology Consider the production function represented by y = f(,z), ɛr n +,zɛr k +, and y ɛr m + where the inputs z are fied. The uncontrolled parameters are the prices of inputs, the price of output, and the fied inputs. The input prices for the variable inputs are considered to be a vector in R n ++,zan element of R k +, the prices of z, denoted by r, an element of Rk ++, while output price p is in R 1 ++. Denote the prices of by w as before. The decision variable that is controlled by the agent is the vector. e: First order conditions ma pf(, z) w rz (27) f(, z) p w = 0 (28) f: Indirect objective (optimal value) function The optimal decision variables are given by (p,w,z) and y = f( (p,w,z),z). The indirect objective function is the profit function and is given by π(p,w,z) = ma pf(, z) w rz (29) = pf( (p,w,z),z) w (p,w,z) rz g: Envelope theorem We can differentiate the optimal value function with respect to p and w and use the first order conditions to simplify. The answers will be basically the same as in the previous case because the term rz drops out of the derivatives. We can also consider the effect of z on the optimal value function.

ECONOMIC OPTIMALITY 7 π(p,w,z) z i = p f ( (p,w,z),z) (p, w, z) + p f ( (p, w, z),z) z i z ( i = p f ) ( (p,w,z),z) (p, w, z) w z i w (p,w,z) z i + p f ( (p,w,z),z) z i r i r i = p f ( (p,w,z),z) z i r i (30) This just says that as the quantity of the ith fied input increases, profits change by the difference between its marginal value product and its cost. This could be regarded as a net shadow price for this input. 2.4. Cost minimization in the general case. a: Technology Consider the technology set or graph represented by T(y, ) = {(y, ) : y is producible using } (31) Since y will be considered fied for this problem, consider the representation in terms of the input correspondence V and denote the technological possibilities by V(y). The uncontrolled parameters are the prices of inputs and the fied output levels. These are considered to be vectors in R n ++ and Rm ++. Denote input prices by w. The decision variables that are controlled by the agent are the s. min w s.t. ɛ V (y) (32) e: Indirect objective (optimal value) function The optimal decision variables are given by (y,w). The indirect objective function is the cost function and is given by C(y, w) = min w s.t. ɛ V (y) = w (y, w) (33) 2.5. Cost minimization with a single output. a: Technology Consider the production function represented by y = f(), ɛr n + and y ɛr1 +. The uncontrolled parameters are the prices of inputs and the level of the output. The input prices are considered to be a vector in R n ++ while y is in R m +. Input prices are denoted w. The decision variable that is controlled by the agent is.

8 ECONOMIC OPTIMALITY min w s.t. y = f() e: First order conditions Set up a Lagrangian as follows (34) L = w λ(f() y) The first order conditions are given by w λ f() =0 (35) f() + y =0 f: Indirect objective (optimal value) function The optimal decision variables are given by (y,w). The indirect objective function is the cost function and is given by C(y, w) = min w s.t. y = f() = w (y, w) g: Envelope theorem We can differentiate the optimal value function with respect to y and w and use the first order conditions to simplify (36) C(y, w) = i (y, w) +w (y, w) w i w i = i (y, w) +λ f( (y, w)) (y, w) w i (37a) (37b) Now differentiate equation 37b with respect to w i f( (y, w)) + y =0 f( (y, w)) (y, w) w i =0 C(y, w) w i = i (y, w) Similarly for the derivative with respect to y C(y, w) y = w (y, w) y =λ f( (y, w)) Now differentiate equation 37b with respect to y. (y, w) y (38) (39)

ECONOMIC OPTIMALITY 9 f( (y, w)) + y =0 f( (y, w)) (y, w) +1=0 y (40) C(y, w) = λ y 2.6. Utility maimization. a: Preferences Preferences are represented by u = v(), ɛr n + and u ɛr 1 +. The uncontrolled parameters are the prices of goods and the level of the income. The prices are considered to be a vector in R n ++ while u is in Rm +. Prices are denoted p. The decision variable that is controlled by the agent is. ma v ( ) s.t. Σ n j=1 p j j e: First order conditions Set up a Lagrangian as follows = m (41) L = v ( ) λ ( p m) The first order conditions are given by v() λp =0 (42a) p + m =0 (42b) f: Indirect objective (optimal value) function The optimal decision variables are given by (p,m). The indirect objective function is the indirect utility function and is given by ψ (p, m) = ma v ( ) s.t. Σ n j=1 p j j = m = v ( (p, m )) g: Envelope theorem We can differentiate the optimal value function with respect to p and m and use the first order conditions to simplify (43) =Σ n v( (p, m) j (p, m) j=1 p i j p i =Σ n v( (p, m) j (p, m) j=1 m j m Now substitute from equation 42a for v() j = λp j so that we obtain (44a) (44b)

10 ECONOMIC OPTIMALITY = λ Σ n j=1 p p j (p, m) j i p i = λ Σ n j=1 m p j (p, m) j m Now differentiate equation 42b with respect to m. (45a) (45b) Σ n k=1 p k (p, m) + m =0 k Σ n k k=1 p k m +1=0 Σ n k k=1 p k m =1 Now differentiate equation 42b with respect to p i. (46) Σ n k=1 p k k (p, m)+m =0 Σ n k=1 p k k p i i ( p, m) = 0 (47) i ( p, m) = Σ n k k=1 p k p i Now simplify 45 using 46 and 47 = λ Σ n j (p, m) j=1 p j p i p i = λ ( i ( p, m)) m = λ Σ n j=1 p j j (p, m) m = λ (1 ) If we take the ratio of the two equations in 48 we obtain (48) p i m = i ( p, m)) (49) This is called Roy s identity. 2.7. Revenue maimization in the general case. a: Technology Consider the technology set or graph represented by T(y, ) = {(y, ) : y is producible using } (50) Since will be considered fied for this problem, consider the representation in terms of the output correspondence P and denote the technological possibilities by P(). The uncontrolled parameters are the prices of outputs and the fied input levels. These are considered to be vectors in R m ++ and R n +. Denote output prices by p. The decision variables that are controlled by the agent are the y s.

ECONOMIC OPTIMALITY 11 ma py y s.t. y ɛ P () (51) e: Indirect objective (optimal value) function The optimal decision variables are given by y (,p). The indirect objective function is the revenue function and is given by R(, p) = ma py y s.t. y ɛ P () = py (, p) (52) 2.8. Revenue maimization with cost constrained production. a: Technology Consider the following technology which represents all vectors y which can be produced at cost less than or equal to C where w is the vector of input prices. IP(w/C) : R n + 2 Rm + = {y : C(y, w) C} = {y : C(y, w/c) 1} This can also be represented as IP(w/C) ={yɛp(): ɛr n +,w C} This correspondence is called the cost indirect output correspondence. In the case of a single output, its maimum element would define the cost indirect production function and would give the maimum level of output attainable for a given ependiture. The uncontrolled parameters are the normalized input prices and output prices. These are considered to be vectors in R n ++ and R m ++. Denote output prices by p. The decision variables that are controlled by the agent are the y s. sup [py : yɛip(w/c)] y = sup [py : C(y, w) C] y (53) e: Indirect objective (optimal value) function The optimal decision variables are given by y (w/c,p). The indirect objective function is the cost indirect revenue function, which gives the maimum revenue attainable for a given level of ependiture. It is given by IR(w/C, p) = sup [py : yɛip(w/c) y = py (w/c, p) (54)

12 ECONOMIC OPTIMALITY 3. OPTIMIZATION AND OBSERVED ECONOMIC DATA 3.1. Assumption of Optimality. Economists usually assume that economic data is generated by agents solving optimization problems similar to those discussed in this lecture. This then implies that the observed data should satisfy properties imposed by the technological assumptions, institutional and other economic constraints and the optimization hypothesis. Tests of various hypotheses can be made using these relationships. 3.2. Assumption of endogeneity. Given that observed economic data is the result of firm level optimization problems, usual classifications of endogenous and eogenous variables may not be appropriate. For eample, observed levels of inputs and outputs may not be appropriate to estimate a production function using ordinary least squares since they satisfy a set of first order conditions related to the firm level decision problem. 3.3. Duality. There is a duality relationship between underlying direct technological correspondences and derived optimal decision functions. The form of this duality will differ in various cases but usually is stated in the form of conjugate pairs of functions that can be derived from each other such as the cost and distance functions, or conve sets and intersections of supporting half-spaces such as the input correspondence and the half-spaces defined by the cost function. In cases of duality, either of the two formulations is an equivalent representation of the technology. 3.4. Relevance of envelope theorem. In many problems, the derivative of the indirect objective function with respect to parameters gives optimal levels of decision variables as functions of those parameters.

ECONOMIC OPTIMALITY 13 REFERENCES [1] Berge, C., Topological Spaces. New York: Macmillan, 1963. [2] Debreu, G. Theory of Value. New Haven, CN: Yale University Press, 1959 [3] Hildenbrand, W. Core and Equilibria of a Large Economy. Princeton: Princeton University Press, 1974. [4] Jehle, G.A. and P. J. Reny. Advanced Microeconomic Theory. Boston: Addison-Wesley, 2001 [5] Rockafellar, R. T. Conve Analysis. Princeton University Press, 1970. [6] Samuelson, P. A. Foundations of Economic Analysis. Cambridge, MA: Harvard University Press, 1983. [7] Varian, H. R. Microeconomic Analysis. 3 rd Edition. New York: Norton, 1992.