Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2)
|
|
- Dinah Sullivan
- 6 years ago
- Views:
Transcription
1 Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 27, 2015 Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
2 Alternatively, to see whether a multivariate function f is concave, we can check if the Hessian matrix of the function is negative semidefinite. Definition: Definiteness Let A be an n n symmetric matrix, then A is: positive definite if z T Az > 0 for all z 0 in R n, positive semidefinite if z T Az 0 for all z 0 in R n, negative definite if z T Az < 0 for all z 0 in R n, negative semidefinite if z T Az 0 for all z 0 in R n, and indefinite if z T Az > 0 for some z in R n, and z T Az < 0 for some other z in R n Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
3 Figure: (left) Negative definite function x 3 = x1 2 x 2 2 and (right) negative semidefinite function x 3 = (x 1 + x 2 ) 2 (Simon and Blume 1994, page ) Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
4 With this in mind, the analog of a nonpositive second derivative of a function of one variable would be a negative semidefinite matrix of second-order partial derivatives (i.e., the Hessian matrix) of a function of many variables. We can now put together Theorem A2.1 and A2.3 to confirm this. Theorem A2.4 Slope, Curvature, and Concavity in Many Variables Let D be a convex subset of R n with a nonempty interior on which f is twice continuously differentiable. The following statements 1 to 3 are equivalent: 1. f is concave. 2. H(x) is negative semidefinite for all x in D. 3. For all x 0 D : f (x) f (x 0 ) + f (x 0 )(x x 0 ) Moreover, 4. If H(x) is negative definite for all x in D, then f is strictly concave (the converse is not true). Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
5 In a single-variable case, a necessary and sufficient condition for a function to be concave (convex) is that its second derivative not be rising (falling). In the multivariable case, we can note a necessary, but not a sufficient condition for concavity or convexity in terms of the signs of all "own" second partial derivative. Theorem A2.5 Concavity, Convexity, and Second-Order Own Partial Derivatives Let f : D R be a twice differentiable function. 1. If f is concave, then x, f ii (x) 0, i = 1,, n. 2. If f is convex, then x, f ii (x) 0, i = 1,, n. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
6 Homogeneous Functions Homogeneous real-valued function arise quite often in microeconomic applications. In this section, we briefly consider functions of this type and use our calculus tools to establish some of their important properties. Definition A2.2 Homogeneous Functions A real-valued function f (x) is called homogeneous of degree k if f (tx) t k f (x) for all t > 0. Two special cases are worthy of note: f (x) is homogeneous of degree 1, or linear homogeneous, if f (tx) tf (x) for all t > 0; it is homogeneous of degree zero if f (tx) f (x) for all t > 0. Homogeneous function display very regular behavior as all variables are increased simultaneously and in the same proportion. When a Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
7 function is homogeneous of degree 1, for example, doubling or tripling all variables doubles or triples the value of the function. When homogeneous of degree zero, equiproportionate changes in all variables leave the value of the function unchanged. Example A2.3 The function f (x 1, x 2 ) Ax1 αx β 2, A > 0, α > 0, β > 0, is known as the Cobb-Douglas function. We now multiply all variables by the same factor t, f (tx 1, tx 2 ) A(tx 1 ) α (tx 2 ) β t α t β Ax α 1 x β 2 = t α+β f (x 1, x 2 ). According to the definition, the Cobb-Douglas is homogeneous of degree α + β > 0. If the coefficients are chosen so that α + β = 1, it is linear homogeneous. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
8 The partial derivative of homogeneous functions are also homogeneous. The following theorem makes this clear. Theorem A2.6 Partial Derivative of Homogeneous Functions If f (x) is homogeneous of degree k, its partial derivative are homogeneous of degree k 1. Proof: Assume f (x) is homogeneous of degree k, Then f (tx) t k f (x) for all t > 0. Differentiate the left-hand side and right-hand side with respective to x i. The resulting derivatives are equal, f (tx) x i k 1 f (x) = t, x i for i = 1,, n, and t > 0, as we sought to show. Let verify this theorem for the Cobb-Douglas form. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
9 Example A2.4 Let f (x 1, x 2 ) Ax1 αx β 2, and suppose α + β = 1 so that it is linear homogeneous. The partial derivative with respect to x 1 is f (x 1, x 2 ) x 1 = αax α 1 1 x β 2 Multiply both x 1 and x 2 by the factor t, and evaluate the partial derivative at (tx 1, tx 2 ). We obtain f (tx 1, tx 2 ) x 1 = αa(tx 1 ) α 1 (tx 2 ) β = t α+β 1 αax α 1 1 x β 2 = f (x 1, x 2 ) x 1, as required, because α + β = 1 and t α+β 1 = t 0 = 1. Finally, Euler s theorem, sometimes called the adding-up theorem, gives us an interesting way to completely characterize homogeneous functions. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
10 Theorem A2.7 Euler s Theorem f (x) is homogeneous of degree k if and only if kf (x) = n i=1 f (x) x i x i for all x This theorem says a function is homogeneous if and only if it can always be written in terms of its own partial derivatives and the degree of homogeneity. Example A2.5 Let f (x 1, x 2 ) Ax1 αx β 2, and again suppose α + β = 1. The partial derivatives are f (x 1, x 2 ) x 1 = αax α 1 1 x β 2, f (x 1, x 2 ) = βax1 α x x β Multiply the first by x 1, the second by x 2, add, and use the fact that Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
11 Example A2.5(Continued) α + β = 1 to get f (x 1, x 2 ) x 1 + f (x 1, x 2 ) x 2 = αax α 1 x 1 x 1 x β 2 x 1 + βax1 α x β 1 2 x 2 2 = (α + β)ax α 1 x β 2 = 1 f (x 1, x 2 ). just as we were promised by Euler s theorem. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
12 A2.2 Unconstrained Optimization This section is devoted to the calculus approach to optimization problems, the most common form of problem in microeconomic theory. First we consider the function of a single variable, y = f (x), and assume it is differentiable. If we can find a point x or x, then x is a (unique) local maximum if f (x ) f (x) (f (x ) > f (x)) for all x x in some neighborhood of x. x is a (unique) global maximum if f (x ) f (x) (f (x ) > f (x)) for all x x in the domain of the function. x is a (unique) local minimum if f ( x) f (x) (f ( x) < f (x)) for all x x in some neighborhood of x. x is a (unique) global minimum if f ( x) f (x) (f ( x) < f (x)) for all x x in the domain of the function. Various types of optima are illustrated in Figure A2.4 (see the next slide). Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
13 Figure A2.4: Local and global optima In Figure A2.5 (see the next slide), we can see the characters of the maximum and the minimum, which can be presented by the first-order necessary condition (FONC) and the second-order necessary condition (SONC). Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
14 Figure A2.5: Necessary conditions for local optima Theorem A2.8 Necessary Conditions for Local (Interior) Optima in the Single-Variable Case Let f (x) be a twice continuously differentiable function of one variable. Then f (x) reaches a local 1. maximum at x f (x ) = 0 (FONC) f (x ) 0 (SONC) 2. minimum at x f ( x) = 0 (FONC) f ( x) 0 (SONC) Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
15 Real-Valued Functions of Several Variables Suppose that D R n, and let f : D R be a twice continuously differentiable real-valued function of n variables. Similar to the single-variable case, if we can find a point x or x, then x is a local maximum whenever there exists some ɛ > 0 such that f (x ) f (x) for all x B ɛ (x ). x is a global maximum if f (x ) f (x) for all x in the domain. x is a local minimum whenever there exists some ɛ > 0 such that f ( x) f (x) for all x B ɛ ( x). x is a global minimum whenever f ( x) f (x) for all x in the domain. These optima are unique if the inequalities hold strictly. As one might expect, the analogy to the derivative being zero at the optimum for functions of one variable will be the gradient vector must be zero at an optimum of a function of many variables. Thus, the single first-order equation f (x ) = 0 characterizing optima for functions of one variable Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
16 generalizes to the first-order system of n simultaneous equations, f (x ) = 0 characterizing the optima of functions of n variables. This gives us our first-order necessary condition for any (interior) optima of real-valued functions. Theorem A2.9 First-Order Necessary Condition for Local (Interior) Optima of Real-Valued Functions If the differentiable functions f (x) reaches a local (interior) maximum or minimum at x, then x solves the system of simultaneous equations, f (x ) x 1 = 0, f (x ) x 2 = 0, f (x ) x n = 0. Example A2.6 Let y = x 2 4x x 1x 2 x2 2. To find a critical point of this function, take each of its partial derivatives: Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
17 Example A2.6 (Continued) f (x 1, x 2 ) x 1 = 8x 1 + 3x 2, f (x 1, x 2 ) x 2 = 1 + 3x 1 2x 2 We will have a critical point at a vector (x1, x 2 ) where both of these equal zero simultaneously. To find x1 and x 2, set each partial equal to zero: f (x 1, x 2 ) x 1 = 8x 1 + 3x 2 = 0, f (x 1, x 2 ) x 2 = 1 + 3x 1 2x 2 = 0 and solve this system for x1 and x 2. We can see the critical point at x1 = 3/7 and x 2 = 8/7. We do not yet know whether we have found a maximum or a minimum, though. For that we have to look at the second-order conditions. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
18 Second-Order Conditions Once we have found a point where f (x ) = 0, we know we have a maximum (minimum) if the function is "locally concave" ("locally convex") there. Theorem A2.4 pointed out that curvature depends on the definiteness property of the Hessian of f. Intuitively, it appears that the function will be locally concave around x if H(x) is negative semidefinite, and will be locally convex if it is positive semidefinite. Intuition thus suggests the following second-order necessary condition for local (interior) optima. Theorem A2.10 Second-Order Necessary Condition for Local (Interior) Optima of Real-Valued Functions Let f (x) be twice continuously differentiable. 1. If f (x) reaches a local interior maximum at x, then H(x ) is negative semidefinite. 2. If f (x) reaches a local interior minimum at x, then H( x) is positive semidefinite. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
19 Theorem A2.9 and A2.10 are both necessary conditions which help in locating potential maxima (or minima) of specific functions, but to verify that they actually maximize (or minimize) the function, we need sufficient conditions. Sufficient conditions for optima are more stringent than necessary conditions. Simply stated, sufficient conditions for interior optima are as follows: If f i (x ) = 0 for i = 1,, n and H(x ) is negative definite at x, then f (x) reaches a local maximum at x. If f i ( x) = 0 for i = 1,, n and H( x) is positive definite at x, then f (x) reaches a local minimum at x. The sufficient conditions require the point to be a critical point, and require the curvature conditions to hold in their strict forms. For example, when H(x ) is negative definite, the function will be strictly concave in some ball around x. Locating a critical point is easy. We simply set all first-order partial derivatives equal to zero and solve the system of n equations. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
20 Determining whether the Hessian is negative or positive definite there will generally less easy. Various tests for determining the definiteness property of the Hessian key on the sign pattern displayed by the determinants of certain submatrices formed from it at the point (or region) in question. These determinants are called the principal minors of the Hessian. By the first through nth principal minors of H(x) at the point x, we mean the determinants D 1 (x) f 11 = f11, D 2 (x) f 11 f 12 f 11 f 1i f 21 f 22 D i(x)..... f i1 f ii f 11 f 1n D n (x)....., f n1 f nn where it is understood that f i1 is evaluated at x. Each is the determinant of a matrix resulting when the last (n i) rows and Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
21 columns of the Hessian H(x) are deleted, for i = 1,, n. The following theorem gives requirements on its principal minors sufficient to ensure definiteness of the Hessian. Theorem A2.11 Let f(x) be twice continuously differentiable, and let D i (x) be the ith-order principal minor of the Hessian matrix H(x). 1. If ( 1) i D i (x) > 0, i = 1,, n, then H(x) is negative definite. 2. If D i (x) > 0, i = 1,, n, then H(x) is positive definite. If condition 1 holds for all x in the domain, then f is strictly concave. If condition 2 holds for all x in the domain, then f is strictly convex. From Theorem A2.9 and A2.11, we can state the first- and second-order sufficient conditions for local interior optima. Theorem A2.12 Sufficient Conditions for Local Interior Optima of Real-Valued Functions Let f(x) be twice continuously differentiable, Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
22 Theorem A2.12 (Continued) 1. If f i (x ) = 0 and ( 1) i D i (x ) > 0, i = 1, 2,, n, then f (x) reaches a local maximum at x. 2 If f i ( x) = 0 and D i ( x) > 0, i = 1, 2,, n, then f (x) reaches a local minimum at x. Example A2.7 Check whether the critical point for the function y = x 2 4x x 1x 2 x2 2 was a maximum or a minimum. We compute the second-order partials, 2 f x 2 1 = 8; 2 f x 1 x 2 = 2 f x 2 x 1 = 3; 2 f x 2 2 = 2 [ ] 8 3 and form the Hessian, H(x) =. In Example A2.6, we found 3 2 a critical point at x = (3/7, 8/7). Checking the principal minors, Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
23 Example A2.7 (Continued) D 1 (x) 8 = 8 < 0, D 2 (x) = 16 9 = 7 > 0, Because these principal minors alternate in sign, beginning with negative, Theorem A2.12 tells us that x = (3/7, 8/7) is a local maximum. In this example the Hessian matrix was completely independent of x. We would therefore obtain the same alternating sign pattern on the principal minors regardless of where we evaluated them. In Theorem A2.11, we observed that this is sufficient to ensure that the function involved is strictly concave. In other words, it means there is only a hill in the graph and it is the only highest point. Indeed, from Figure A2.5, it is intuitively clear that any local maximum (minimum) of a concave (convex) function must also be a global maximum (minimum). Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
24 Theorem A2.13 (Unconstrained) Local-Global Theorem Let f be a twice continuously differentiable real-valued concave function on D. The following statements are equivalent, where x is an interior point of D: 1. f (x ) = f achieves a local maximum at x. 3. f achieves a global maximum at x. Proof: Clearly, 3 2, and by Theorem A2.9, 2 1. Hence, it remains only to show that 1 3. Because f is concave, Theorem A2.4 implies that for all x in the domain, f (x) f (x ) + f (x )(x x ). Then given 1, the inequality above implies that f (x) f (x ) Therefore, f reaches a global maximum at x. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
25 Theorem A2.13 says that under convexity or concavity, any local optimum is a global optimum. Notice, however, that it is still possible that the lowest (highest) value is reached at more than one point in the domain. If we want the highest or lowest value of the function to be achieved at a unique point, we have to impose strict concavity or strict convexity. Theorem A2.14 Strict Concavity/Convexity and the Uniqueness of Global Optima 1. If x maximizes the strictly concave function f, then x is the unique global maximizer, i.e., f (x ) > f (x) x D, x x. 2. If x minimizes the strictly convex function f, then x is the unique global minimizer, i.e., f ( x) < f (x) x D, x x. Proof: We will prove 1. If x is a global maximizer of f but it is not unique, then there exists some other points x x such that f (x ) = f (x ). If we let x t = tx + (1 t)x, then strict concavity requires that Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
26 Theorem A2.14 (Continued) f (x t ) > tf (x ) + (1 t)f (x ) t (0, 1) Because f (x ) = f (x ), the requires that or, simply f (x t ) > tf (x ) + (1 t)f (x ) f (x t ) > f (x ) This, however, contradicts the assumption that x is a global maximizer of f. Thus, any global maximizer of a strictly concave function must be unique. From Theorem A2.9 and A2.14, we have the sufficient conditions for unique global optima. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
27 Theorem A2.15 Sufficient Conditions for Unique Global Optima Let f (x) be twice continuously differentiable, 1. If f (x) is strictly concave and f i (x ) = 0, i = 1,, n, then x is the unique global maximizer of f (x). 2. If f (x) is strictly convex and f i ( x) = 0, i = 1,, n, then x is the unique global minimizer of f (x). Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
28 Constrained Optimization Scarcity is a pervasive fact of economic life. It is most commonly expressed as constraints on permissible value of economic variables. Agents, often consumers and firms, are then represented as seeking to do the best they can within the constraints they face. This is the type of problem we will regularly encounter. We need to modify our techniques of optimization and the terms that characterize the optima in such cases, accordingly. There are three basic types of constraints we will encounter. They are equality constraints, nonnegativity constraints, and, amore generally, any form of inequality constraint. We will derive methods for solving problems that involve each of them in turn. We will confine discussion to problems of maximization, simply noting the modifications (if any) for minimization problems. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
29 Equality Constraints Consider choosing x 1 and x 2 to maximize f (x 1, x 2 ), when x 1 and x 2 must satisfy some particular relation to each other that we write in implicit form as g(x 1, x 2 ) = 0. Formally max x1,x 2 f (x 1, x 2 ) subject to g(x 1, x 2 ) = 0 Here f (x 1, x 2 ) is called the objective function. The x 1 and x 2 are called choice variables. The function g(x 1, x 2 ) is called the constraint. The set of all x 1 and x 2 that satisfy the constraint are sometimes called the constraint set or the feasible set. One way to solve this problem is by substitution. For example, suppose that g(x 1, x 2 ) = 0 can be written to isolate x 2 on one side as x 2 = g(x 1 ) Substitute the equation above into the objective function to replace x 2. This way, the two-variable constrained maximization problem can be rephrased as the single-variable problem with no constraints: Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
30 max x1 f (x 1, g(x 1 )) The usual first-order conditions require that we set the total derivative, f / x 1, equal to zero and solve for the optimal x1. That is, f (x1, g(x 1 )) + f (x 1, g(x 1 )) d g(x 1 )) = 0 (by chain rule) x 1 x 2 dx 1 When we have found x1, we plug it back to the constraint and find x2 = g(x 1 ). The pair (x 1, x 2 ) then solves the constrained problem, provided the appropriate second-order condition is also fulfilled. However, there more economic problems which involve more than two choice variables and more than one constrains. The substitution method is not well suited to these more complicated problems. The better way is using Lagrange s method. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
31 First Midterm Exam Date: Scheduled on Monday, October 26th, 2015 Time: 9:00 am 11:30 am Location: To be Announced Coverage: Week 1 - Week 5 and a small part of Week 6 Rules: The exam is closed-book, closed-notes and in-class. Taking the in-class exam is only way for earning grades in this course fro any student. No scratch paper (will be provided by the proctor), calculator, cellphone and other electronic devices are allowed. Pens, correction tools and basic requirements for life (ex. water, tissue paper, and medicine) are allowed. Microeconomic Theory Week 4: Calculus and Optimization (Jehle and Reny, Chapter September A2) 27, / 31
Week 3: Sets and Mappings/Calculus and Optimization (Jehle September and Reny, 20, 2015 Chapter A1/A2)
Week 3: Sets and Mappings/Calculus and Optimization (Jehle and Reny, Chapter A1/A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 20, 2015 Week 3: Sets and Mappings/Calculus
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More 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 informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationWeek 10: Theory of the Firm (Jehle and Reny, Chapter 3)
Week 10: Theory of the Firm (Jehle and Reny, Chapter 3) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 22, 2015 First Last (shortinst) Short title November 22, 2015 1
More informationMicroeconomics I. September, c Leopold Sögner
Microeconomics I c Leopold Sögner Department of Economics and Finance Institute for Advanced Studies Stumpergasse 56 1060 Wien Tel: +43-1-59991 182 soegner@ihs.ac.at http://www.ihs.ac.at/ soegner September,
More 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 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 informationWeek 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer November Theory 1, 2015 (Jehle and 1 / Reny, 32
Week 7: The Consumer (Malinvaud, Chapter 2 and 4) / Consumer Theory (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 1, 2015 Week 7: The Consumer
More 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 informationWeek 1: Conceptual Framework of Microeconomic theory (Malivaud, September Chapter 6, 20151) / Mathemat 1 / 25. (Jehle and Reny, Chapter A1)
Week 1: Conceptual Framework of Microeconomic theory (Malivaud, Chapter 1) / Mathematic Tools (Jehle and Reny, Chapter A1) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September
More informationMathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions
Mathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions Teng Wah Leo 1 Calculus of Several Variables 11 Functions Mapping between Euclidean Spaces Where as in univariate
More information7) Important properties of functions: homogeneity, homotheticity, convexity and quasi-convexity
30C00300 Mathematical Methods for Economists (6 cr) 7) Important properties of functions: homogeneity, homotheticity, convexity and quasi-convexity Abolfazl Keshvari Ph.D. Aalto University School of Business
More informationMathematical Economics: Lecture 16
Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave
More informationWeek 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1)
Week 6: Consumer Theory Part 1 (Jehle and Reny, Chapter 1) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 2, 2014 1 / 28 Primitive Notions 1.1 Primitive Notions Consumer
More informationEconomics 101A (Lecture 3) Stefano DellaVigna
Economics 101A (Lecture 3) Stefano DellaVigna January 24, 2017 Outline 1. Implicit Function Theorem 2. Envelope Theorem 3. Convexity and concavity 4. Constrained Maximization 1 Implicit function theorem
More 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 informationN. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:
0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationEC /11. Math for Microeconomics September Course, Part II 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 informationx +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a
UCM Final Exam, 05/8/014 Solutions 1 Given the parameter a R, consider the following linear system x +y t = 1 x +y +z +t = x y +z t = 7 x +6y +z +t = a (a (6 points Discuss the system depending on the
More 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 informationReview of Optimization Methods
Review of Optimization Methods Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Outline of the Course Lectures 1 and 2 (3 hours, in class): Linear and non-linear functions on Limits,
More informationWeek 9: Topics in Consumer Theory (Jehle and Reny, Chapter 2)
Week 9: Topics in Consumer Theory (Jehle and Reny, Chapter 2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China November 15, 2015 Microeconomic Theory Week 9: Topics in Consumer Theory
More informationII. An Application of Derivatives: Optimization
Anne Sibert Autumn 2013 II. An Application of Derivatives: Optimization In this section we consider an important application of derivatives: finding the minimum and maximum points. This has important applications
More informationChapter 2: Unconstrained Extrema
Chapter 2: Unconstrained Extrema Math 368 c Copyright 2012, 2013 R Clark Robinson May 22, 2013 Chapter 2: Unconstrained Extrema 1 Types of Sets Definition For p R n and r > 0, the open ball about p of
More informationSession: 09 Aug 2016 (Tue), 10:00am 1:00pm; 10 Aug 2016 (Wed), 10:00am 1:00pm &3:00pm 5:00pm (Revision)
Seminars on Mathematics for Economics and Finance Topic 2: Topics in multivariate calculus, concavity and convexity 1 Session: 09 Aug 2016 (Tue), 10:00am 1:00pm; 10 Aug 2016 (Wed), 10:00am 1:00pm &3:00pm
More informationMath 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros
Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros Midterm, October 6, 016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationEconS 301. Math Review. Math Concepts
EconS 301 Math Review Math Concepts Functions: Functions describe the relationship between input variables and outputs y f x where x is some input and y is some output. Example: x could number of Bananas
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 informationECE580 Exam 1 October 4, Please do not write on the back of the exam pages. Extra paper is available from the instructor.
ECE580 Exam 1 October 4, 2012 1 Name: Solution Score: /100 You must show ALL of your work for full credit. This exam is closed-book. Calculators may NOT be used. Please leave fractions as fractions, etc.
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 informationBoston College. Math Review Session (2nd part) Lecture Notes August,2007. Nadezhda Karamcheva www2.bc.
Boston College Math Review Session (2nd part) Lecture Notes August,2007 Nadezhda Karamcheva karamche@bc.edu www2.bc.edu/ karamche 1 Contents 1 Quadratic Forms and Definite Matrices 3 1.1 Quadratic Forms.........................
More informationwhere u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationMath 273a: Optimization Basic concepts
Math 273a: Optimization Basic concepts Instructor: Wotao Yin Department of Mathematics, UCLA Spring 2015 slides based on Chong-Zak, 4th Ed. Goals of this lecture The general form of optimization: minimize
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationLecture 3: Basics of set-constrained and unconstrained optimization
Lecture 3: Basics of set-constrained and unconstrained optimization (Chap 6 from textbook) Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 9, 2018 Optimization basics Outline Optimization
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 informationECE580 Fall 2015 Solution to Midterm Exam 1 October 23, Please leave fractions as fractions, but simplify them, etc.
ECE580 Fall 2015 Solution to Midterm Exam 1 October 23, 2015 1 Name: Solution Score: /100 This exam is closed-book. You must show ALL of your work for full credit. Please read the questions carefully.
More information2015 Math Camp Calculus Exam Solution
015 Math Camp Calculus Exam Solution Problem 1: x = x x +5 4+5 = 9 = 3 1. lim We also accepted ±3, even though it is not according to the prevailing convention 1. x x 4 x+4 =. lim 4 4+4 = 4 0 = 4 0 = We
More information1. 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 informationSummary Notes on Maximization
Division of the Humanities and Social Sciences Summary Notes on Maximization KC Border Fall 2005 1 Classical Lagrange Multiplier Theorem 1 Definition A point x is a constrained local maximizer of f subject
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationLecture 2: Convex Sets and Functions
Lecture 2: Convex Sets and Functions Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 2 Network Optimization, Fall 2015 1 / 22 Optimization Problems Optimization problems are
More informationComputational Optimization. Convexity and Unconstrained Optimization 1/29/08 and 2/1(revised)
Computational Optimization Convexity and Unconstrained Optimization 1/9/08 and /1(revised) Convex Sets A set S is convex if the line segment joining any two points in the set is also in the set, i.e.,
More informationMonotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2
Monotone Function Function f is called monotonically increasing, if Chapter 3 x x 2 f (x ) f (x 2 ) It is called strictly monotonically increasing, if f (x 2) f (x ) Convex and Concave x < x 2 f (x )
More 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 informationCHAPTER 4: HIGHER ORDER DERIVATIVES. Likewise, we may define the higher order derivatives. f(x, y, z) = xy 2 + e zx. y = 2xy.
April 15, 2009 CHAPTER 4: HIGHER ORDER DERIVATIVES In this chapter D denotes an open subset of R n. 1. Introduction Definition 1.1. Given a function f : D R we define the second partial derivatives as
More 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 informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationOptimality Conditions
Chapter 2 Optimality Conditions 2.1 Global and Local Minima for Unconstrained Problems When a minimization problem does not have any constraints, the problem is to find the minimum of the objective function.
More informationEC400 Math for Microeconomics Syllabus The course is based on 6 sixty minutes lectures and on 6 ninety minutes classes.
London School of Economics Department of Economics Dr Francesco Nava Offi ce: 32L.3.20 EC400 Math for Microeconomics Syllabus 2016 The course is based on 6 sixty minutes lectures and on 6 ninety minutes
More informationECON2285: Mathematical Economics
ECON2285: Mathematical Economics Yulei Luo Economics, HKU September 17, 2018 Luo, Y. (Economics, HKU) ME September 17, 2018 1 / 46 Static Optimization and Extreme Values In this topic, we will study goal
More informationJanuary 29, Introduction to optimization and complexity. Outline. Introduction. Problem formulation. Convexity reminder. Optimality Conditions
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis Dimensioning II Department of Electronics Communications Engineering Tampere University of Technology, Tampere, Finl January 29, 2014 1 2 3
More informationThe Kuhn-Tucker Problem
Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming - The Kuhn-Tucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The Kuhn-Tucker
More informationChapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44
Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It
More informationMATHEMATICS FOR ECONOMISTS. Course Convener. Contact: Office-Hours: X and Y. Teaching Assistant ATIYEH YEGANLOO
INTRODUCTION TO QUANTITATIVE METHODS IN ECONOMICS MATHEMATICS FOR ECONOMISTS Course Convener DR. ALESSIA ISOPI Contact: alessia.isopi@manchester.ac.uk Office-Hours: X and Y Teaching Assistant ATIYEH YEGANLOO
More informationE 600 Chapter 3: Multivariate Calculus
E 600 Chapter 3: Multivariate Calculus Simona Helmsmueller August 21, 2017 Goals of this lecture: Know when an inverse to a function exists, be able to graphically and analytically determine whether a
More information6 Optimization. The interior of a set S R n is the set. int X = {x 2 S : 9 an open box B such that x 2 B S}
6 Optimization The interior of a set S R n is the set int X = {x 2 S : 9 an open box B such that x 2 B S} Similarly, the boundary of S, denoted@s, istheset @S := {x 2 R n :everyopenboxb s.t. x 2 B contains
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 informationLakehead University ECON 4117/5111 Mathematical Economics Fall 2002
Test 1 September 20, 2002 1. Determine whether each of the following is a statement or not (answer yes or no): (a) Some sentences can be labelled true and false. (b) All students should study mathematics.
More informationPaul Schrimpf. October 18, UBC Economics 526. Unconstrained optimization. Paul Schrimpf. Notation and definitions. First order conditions
Unconstrained UBC Economics 526 October 18, 2013 .1.2.3.4.5 Section 1 Unconstrained problem x U R n F : U R. max F (x) x U Definition F = max x U F (x) is the maximum of F on U if F (x) F for all x U and
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationCHAPTER 2: QUADRATIC PROGRAMMING
CHAPTER 2: QUADRATIC PROGRAMMING Overview Quadratic programming (QP) problems are characterized by objective functions that are quadratic in the design variables, and linear constraints. In this sense,
More informationFinal Exam - Math Camp August 27, 2014
Final Exam - Math Camp August 27, 2014 You will have three hours to complete this exam. Please write your solution to question one in blue book 1 and your solutions to the subsequent questions in blue
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More information8. Constrained Optimization
8. Constrained Optimization Daisuke Oyama Mathematics II May 11, 2018 Unconstrained Maximization Problem Let X R N be a nonempty set. Definition 8.1 For a function f : X R, x X is a (strict) local maximizer
More informationCalculus Example Exam Solutions
Calculus Example Exam Solutions. Limits (8 points, 6 each) Evaluate the following limits: p x 2 (a) lim x 4 We compute as follows: lim p x 2 x 4 p p x 2 x +2 x 4 p x +2 x 4 (x 4)( p x + 2) p x +2 = p 4+2
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationStatic Problem Set 2 Solutions
Static Problem Set Solutions Jonathan Kreamer July, 0 Question (i) Let g, h be two concave functions. Is f = g + h a concave function? Prove it. Yes. Proof: Consider any two points x, x and α [0, ]. Let
More informationWritten Examination
Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes
More informationOPER 627: Nonlinear Optimization Lecture 2: Math Background and Optimality Conditions
OPER 627: Nonlinear Optimization Lecture 2: Math Background and Optimality Conditions Department of Statistical Sciences and Operations Research Virginia Commonwealth University Aug 28, 2013 (Lecture 2)
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationAppendix A Taylor Approximations and Definite Matrices
Appendix A Taylor Approximations and Definite Matrices Taylor approximations provide an easy way to approximate a function as a polynomial, using the derivatives of the function. We know, from elementary
More informationMATH 4211/6211 Optimization Constrained Optimization
MATH 4211/6211 Optimization Constrained Optimization Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 Constrained optimization
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 informationMATHEMATICAL ECONOMICS: OPTIMIZATION. Contents
MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4
More informationLecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then
Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then 1. x S is a global minimum point of f over S if f (x) f (x ) for any x S. 2. x S
More informationMathematical 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 information10-725/ Optimization Midterm Exam
10-725/36-725 Optimization Midterm Exam November 6, 2012 NAME: ANDREW ID: Instructions: This exam is 1hr 20mins long Except for a single two-sided sheet of notes, no other material or discussion is permitted
More informationPaul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions
UBC Economics 526 October 17, 2012 .1.2.3.4 Section 1 . max f (x) s.t. h(x) = c f : R n R, h : R n R m Draw picture of n = 2 and m = 1 At optimum, constraint tangent to level curve of function Rewrite
More information. This matrix is not symmetric. Example. Suppose A =
Notes for Econ. 7001 by Gabriel A. ozada The equation numbers and page numbers refer to Knut Sydsæter and Peter J. Hammond s textbook Mathematics for Economic Analysis (ISBN 0-13- 583600-X, 1995). 1. Convexity,
More informationNetwork Optimization: Notes and Exercises
SPRING 2016 1 Network Optimization: Notes and Exercises Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes provide a tutorial treatment of topics of
More informationMicroeconomic Analysis
Microeconomic Analysis Seminar 1 Marco Pelliccia (mp63@soas.ac.uk, Room 474) SOAS, 2014 Basics of Preference Relations Assume that our consumer chooses among L commodities and that the commodity space
More informationRules of Differentiation
Rules of Differentiation The process of finding the derivative of a function is called Differentiation. 1 In the previous chapter, the required derivative of a function is worked out by taking the limit
More informationCalculus Overview. f(x) f (x) is slope. I. Single Variable. A. First Order Derivative : Concept : measures slope of curve at a point.
Calculus Overview I. Single Variable A. First Order Derivative : Concept : measures slope of curve at a point. Notation : Let y = f (x). First derivative denoted f ʹ (x), df dx, dy dx, f, etc. Example
More informationPrinciples in Economics and Mathematics: the mathematical part
Principles in Economics and Mathematics: the mathematical part Bram De Rock Bram De Rock Mathematical principles 1/65 Practicalities about me Bram De Rock Office: R.42.6.218 E-mail: bderock@ulb.ac.be Phone:
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 informationARE202A, Fall 2005 CONTENTS. 1. Graphical Overview of Optimization Theory (cont) Separating Hyperplanes 1
AREA, Fall 5 LECTURE #: WED, OCT 5, 5 PRINT DATE: OCTOBER 5, 5 (GRAPHICAL) CONTENTS 1. Graphical Overview of Optimization Theory (cont) 1 1.4. Separating Hyperplanes 1 1.5. Constrained Maximization: One
More informationPreliminary draft only: please check for final version
ARE211, Fall2012 CALCULUS4: THU, OCT 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 15) Contents 3. Univariate and Multivariate Differentiation (cont) 1 3.6. Taylor s Theorem (cont) 2 3.7. Applying Taylor theory:
More informationLecture Unconstrained optimization. In this lecture we will study the unconstrained problem. minimize f(x), (2.1)
Lecture 2 In this lecture we will study the unconstrained problem minimize f(x), (2.1) where x R n. Optimality conditions aim to identify properties that potential minimizers need to satisfy in relation
More informationEcon 101A Problem Set 1 Solution
Econ 101A Problem Set 1 Solution Problem 1. Univariate unconstrained maximization. (10 points) Consider the following maximization problem: max x f(x; x 0)=exp( (x x 0 ) 2 ) 1. Write down the first order
More informationGradient Descent. Dr. Xiaowei Huang
Gradient Descent Dr. Xiaowei Huang https://cgi.csc.liv.ac.uk/~xiaowei/ Up to now, Three machine learning algorithms: decision tree learning k-nn linear regression only optimization objectives are discussed,
More informationConstrained Optimization Theory
Constrained Optimization Theory Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Constrained Optimization Theory IMA, August
More information