Chapter 8 Nonlinear programming. Extreme value theorem. Maxima and minima. LC Abueg: mathematical economics. chapter 8: nonlinear programming 1
|
|
- Ralph Houston
- 5 years ago
- Views:
Transcription
1 Chapter 8 Nonlinear programming Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Extreme value theorem Maxima and minima Definition. Let f: D R D R A point x* in Dis said to be a global maximizer of f iff f( x) f( x*), x D The value f(x*) is called the global maximum of f. n chapter 8: nonlinear programming 1
2 Maxima and minima Definition. Let f: D R D R A point x # in Dis said to be a global minimizer of f iff f( x) f( x ), x D # The value f(x # ) is called the global minimum of f. n Maxima and minima Definition. Let f: D R D R A point x* in Dis said to be a local maximizer of f iffthere is a neighborhood V r (x*)(with r> 0) such that f( x) f( x*), x D V r ( x*) The value f(x*) is called the local maximum of f. n Maxima and minima Definition. Let f: D R D R A point x # in Dis said to be a local minimizer of f iffthere is a neighborhood V r (x # )(with r> 0) such that f( x) f( x ), x D V r ( x ) # # The value f(x # ) is called the local minimum of f. n chapter 8: nonlinear programming 2
3 Maxima and minima f(x) a x* c x m x M d b global maximizer local minimizer global minimizer local maximizer Maxima and minima Definition.A maximizer or a minimizer of a function f is in general, referred to as an optimizer(or an optimum point of f). The value of fat the optimum point is called an optimum of f. Suprema and infima Definition. Let S R A number v is said to be an upper boundof S if s v, s S A number w is said to be a lower boundof S if w s, s S chapter 8: nonlinear programming 3
4 Suprema and infima Definition. Let S R Sis said to be bounded above, if S has an upper bound. Sis said to be bounded below, if Shas a lower bound. Sis said to be bounded, if S has both an upper bound and a lower bound. Sis said to be unbounded, if Shas no upper bound nor a lower bound. Suprema and infima Definition. Let S R If Sis bounded above, then an upper bound u is said to be a supremum(or a least upper bound) of Sif no number smaller than uis an upper bound of S. We denote u: = sups Suprema and infima Definition. Let S R If Sis bounded below, then a lower bound z is said to be an infimum(or a greatest lower bound) of Sif no number bigger than zis a lower bound of S.We denote z: = infs chapter 8: nonlinear programming 4
5 Suprema and infima lower bounds of S upper bounds of S R w S v inf S sup S Suprema and infima In symbols, we have u = sups { v s v s S} = min :, and z = infs { w s w s S} = max :, Suprema and infima Example. Consider the interval [ 1,2] R We have sup[ 1,2] = 2 and inf[ 1,2] = 1. Now consider the interval ( 1,2) R We have sup( 1,2) = 2 and inf( 1,2) = 1. chapter 8: nonlinear programming 5
6 Suprema and infima Example. The intervals [ a, ) ( a, ) have infimaequal to a, but no suprema exist. Also, the intervals (, b) (, b] have suprema equal to b, but no infima exist. Suprema and infima Remark. Let S R If Shas a lower bound or an upper bound (or both), it must be finite. Moreover, the supremum or infimum of a set may not be an element of the set. For intervals, the sup and inf are always its finite endpoints. Extreme value theorem Theorem 8.1.[B. Bolzano (1830)] If Iis a closed and bounded interval and f: I R is continuous on I, then fis bounded on I. Moreover, if then M = sup( f x) m = inf f( x) x I x I ( ) x, x I f( x ) = m f( x ) = M m M m M chapter 8: nonlinear programming 6
7 Extreme value theorem f(x M ) = M f(x) f(x m ) = m a x M x m b Extreme value theorem Theorem 8.2.[K. Weierstrass (1860)] Let Kbe a compact n subset of R. Suppose that f: K R is continuous. Then fhas a maximizer and a minimizer in K. Unconstrained optimization chapter 8: nonlinear programming 7
8 Critical points Definition. Let f: D R D R A point x 0 in Dis said to be a critical point of f iff f ( x ) = 0 f ( x ) = 0 0 A critical point x 0 in Dthat satisfies f (x 0 ) = 0 is called a stationary point. n Univariate case Theorem 8.3.[Necessary condition for local optima] Let f: D R D R and suppose further that f is differentiable at x*, where x* intd If x* is a local optimizer of f, then f ( x*) = 0 Univariate case Example.Find the stationary point(s) of the function y = exp( x) x + 2 chapter 8: nonlinear programming 8
9 Univariate case Remark.The converse of Theorem 8.3 is not true. Consider 3 y = x Univariate case Theorem 8.4.[Sufficient condition for local optima] Let f: D R D R and suppose further that f is twice continuously differentiable on intdcontaining x* and that f (x*) = 0. Then Univariate case ( i) f ( x*) > 0 f( x*) < f( x), x V ( *) r x D ( ii) f ( x*) < 0 f( x*) > f( x), x V ( *) r x D chapter 8: nonlinear programming 9
10 Univariate case Remark.The condition that f( x*) < f( x), x V( x*) D means that x* is a strict local minimizer of f. Similarly, the condition that f( x*) > f( x), x V( x*) D means that x* is a strict local maximizer of f. r r Univariate case Example. Consider the function 2 y = f( x) = ax + bx + c, a 0 Univariate case Example.Consider the cubic polynomial f x x x x 3 2 ( ) = chapter 8: nonlinear programming 10
11 Univariate case Example.Consider the cubic polynomial 1 3 y = x x 3 Univariate case Remark.Consider again the function 3 y = x Univariate case Theorem 8.5.Let f: D R D R and suppose further that f have a continuous n th order derivative on V r (x*) contained in D. Suppose that ( k) f ( x*) = 0, k = 1,..., n 1 ( n) f ( x*) 0 chapter 8: nonlinear programming 11
12 Univariate case i. If n is even and f (n) (x*) > 0, then x* is a strict local minimizer of f. ii. If n is even and f (n) (x*) < 0, then x* is a strict local maximizer of f. iii. If n is odd, then x* is horizontal inflection point of f. Univariate case Example.Consider the quintic polynomial 1 1 g( x) = x x Univariate case Example.Consider the quartic polynomial h x x x x 4 2 ( ) = chapter 8: nonlinear programming 12
13 Univariate case Example.Consider a perfectly competitive firm with revenue function R(q) and cost function C(q). The profit function of the firm is given by Π ( q) = R( q) C( q) Univariate case p MC( x) AC( x) q* q Univariate case y Total cost Total revenue MR(q 1 *) = MC(q 1 *) MR(q 2 *) = MC(q 2 *) q 1 * q 2 * q chapter 8: nonlinear programming 13
14 Univariate case Exercise. Consider the function x 3 f( x) = 2 x 3x + 2 State the necessary restrictions for x(if necessary, since this is a rational function). Determine all critical points. Among those, which are stationary? Univariate case Exercise. Let y = F( z), z = f( x) be differentiable functions and let ybe increasing in z. Prove that x*is a local maximum of fiff x*is a local maximum of F. Review: matrix calculus Definition. Consider the function y = f x = f x x x 1 2 n ( ) (,,..., ) If fis continuously differentiable, then the vector y y y f = x x x 1 2 n is called the gradientof f, read del f. T chapter 8: nonlinear programming 14
15 Review: matrix calculus Definition. Consider the function y = f x = f x x x 1 2 n ( ) (,,..., ) If f is twice continuously differentiable, then the matrix where H = H( x, x,..., x ) 1 2 n Review: matrix calculus f f f 2 x x x x x n f f f 2 H() f = x2 x1 x x 2 2 xn f f f 2 x x x x n 1 n 2 xn Review: matrix calculus is called the Hessian matrix, and its determinant is the Hessian determinant. We may also denote the Hessian matrix as H() f = H = 2 f f chapter 8: nonlinear programming 15
16 Multivariate case Theorem 8.6.[Necessary condition for local optima] Let n f: D R D R and suppose further that f have partial derivatives at x*, where x* intd If x* is a local optimizer of f, then f( x*) = θn Multivariate case Definition. A function f(x,y) is said to have a saddle point (x #,y # ) iff f x y f x y f x y # # # # (, ) (, ) (, ), ( x, y) Df Remark.A saddle point is an n dimensional analogue of the horizontal point of inflection. Multivariate case Theorem 8.7.[Sufficient condition for local optima] Let n f: D R D R and suppose further that fhave continuous second order partials on V ( x *) D r and that f( x*) = θn chapter 8: nonlinear programming 16
17 Multivariate case If 2 f( x*) is positive definite (resp., negative definite, indefinite), then x* is a strict local minimizer (resp., strict local maximizer, saddle point) of f. Multivariate case Example. Consider 2 2 f( x, y) = x y + x y Multivariate case Example.Classify the stationary points of the following functions: 2 2 ( i) f( x, y) = x y + xy ( ) 2 = ( iii) 2 2 x y h( x, y) = e ii g( x, y) x y xy x 5y chapter 8: nonlinear programming 17
18 Multivariate case f( x, y) = x 2 y 2 + xy Multivariate case g( x, y) = x 2 + y 2 + xy + x + 5y Multivariate case 2 2 h( x, y) = exp( x y ) chapter 8: nonlinear programming 18
19 Multivariate case Exercise. Consider the function 2 3 z = f( x, y) = xy + x y xy Show that there are six optimizers for this function: (0,0),(1,0),( 1,0), (0,1),,,, Multivariate case Exercise. Verify that g( x, y, z) = x + y + z xyz has four saddle points: { ( x*, y*, z *) = (2,2,2),( 2, 2,2), ( 2,2, 2),(2, 2, 2) } Multivariate case Remark.In the case of a function with two variables z = f(x,y), we can restate the sufficiency condition: let 2 f: D R D R and suppose further that have continuous second order partials on V ( x*, y*) D r ( ) chapter 8: nonlinear programming 19
20 Multivariate case and Define f f ( x*, y*) = 0, ( x*, y*) = 0 x y D( x, y) = f ( x, y) f ( x, y) f ( x, y) xx yy xy assumes that for this class of multivariate functions, Young s Theorem holds (Theorem 3.15) 2 Multivariate case Then ( i) D( x*, y*), f ( x*, y*), f ( x*, y*) > 0 ( ii) D x y > xx yy ( x*, y*) local minimum ( *, *) 0, f ( x*, y*), f ( x*, y*) < 0 xx yy ( x*, y*) local maximum Multivariate case ( iii) D( x*, y*) < 0 ( x*, y*) saddle point ( iv) D( x*, y*) = 0 no conclusion can be made about ( x*, y*) chapter 8: nonlinear programming 20
21 Multivariate case Example.Consider a perfectly competitive firm with revenue function R(x,y) and cost function C(x,y), where xand y are the two goods produced by the said firm. The firm s objective is to maximize profit. Find the necessary and sufficiency conditions that the firm must satisfy, if x* and y* exist. Multivariate case Solution: Formulate the profit function Π(x,y) as follows: Π ( x, y) = R( x, y) C( x, y) Multivariate case Exercise. Consider the function z = f( x, y) = (1 + y) x + y defined over the Cartesian plane. Show that fhas a unique local minimum at the origin, but it does not have a global minimum. chapter 8: nonlinear programming 21
22 Convex sets Definition. A set Cis said to be convexiff x, y C r [0,1] rx + (1 r) y C We call rx+ (1 r)ya convex combinationof xand y. If the above is true for all r in (0,1), we then call Ca strictly convex set. Convex sets convex set the line segment (i.e., the convex combination) is contained in the set, possibly at the border/edge/ boundary of the set) strictly convex set the line segment (i.e., the convex combination) cannot be placed at the boundary of the set (at most only one point of the line segment) chapter 8: nonlinear programming 22
23 Convex sets Example. Consider the [real] Cartesian plane R 2 {( a, b): a, b R} = Define the following sets: S = [0,1] [0,1] {(, ): 1} C = x y x + y 1 S 1 is called the unit square and C 1 is called the unit circle. Convex sets y (0,1) y (0,1) (1,1) ( 1,0) (0, 1) (0,0) (1,0) x (0,0) (1,0) x unit circle (C 1 ) unit square(s 1 ) a strictly convex set a convex set Convex sets Example. In microeconomics, the set defined by the budget constraint p x + p y m x y is called the budget set of the consumer, which is a convex set. The property of convexity of the budget set implies perfect divisibilityof x and y: possibility of consuming these in fractional units. chapter 8: nonlinear programming 23
24 Convex sets Budget set, which is [always] convex Exercise. True or false. i. If Aand Bare convex sets, then both their union and intersection are convex. ii. Let Uand Vbe convex subsets of the reals. Define { u v: u U, v V} U + V = + Then U + Vis convex. iii. Consider the linear programming problem max T z = c x s.t. Ax b, x θn Then the set of feasible [and optimal] solutions is convex. Hint: Consider Exhibit A, Special Cases in 6. chapter 8: nonlinear programming 24
25 Convex functions Definition. Let f: C R where Cis a convex subset in R. We say that fis a convex function iff x, y C r [0,1] ( (1 r) y) r ( f( x) ) (1 r) ( f( y) ) f rx + + Convex functions Definition. Let f: C R where Cis a convex subset in R. We say that fis a strictly convex function iff x, y C r (0,1) ( (1 r) y) r ( f( x) ) (1 r) ( f( y) ) f rx + < + Convex functions f( x ) 2 f( x) 1 f( rx + (1 r) x ) 1 2 x rx + (1 r) x x chapter 8: nonlinear programming 25
26 not strictly convex function strictly convex function Concave functions Definition. Let g: C R where Cis a convex subset in R. We say that gis a concave function iff x, y C r [0,1] ( (1 r) y) r ( g( x) ) (1 r) ( g( y) ) g rx + + Concave functions Definition. Let g: C R where Cis a convex subset in R. We say that gis a strictly concave function iff x, y C r (0,1) ( (1 r) y) r ( g( x) ) (1 r) ( g( y) ) g rx + > + chapter 8: nonlinear programming 26
27 Concave functions f( rx + (1 r) x ) 1 2 f( x) 1 f( x ) 2 rx r x x + (1 ) x strictly concave function not strictly concave function Example. The function exp(x) is convex on the whole real line, and ln(x) is concave on (0, ). y = exp( x) y = ln( x) -6 chapter 8: nonlinear programming 27
28 Concave functions Remark. In general, the quadratic function y ax 2 = + bx + c a, 0 is concave on R if a < 0, and convex on R if a >0. In particular, the function y = x 2 is convex on the whole real line, while the function y = x 2 + 2xis concave on the real line. 2 2 y = x y = x + 2x -2-4 Example. The cubic function y = x 3 is concave on (,0] and is convex on [0, ). In the whole of the real line, it is neither concave nor convex chapter 8: nonlinear programming 28
29 Example. The hyperbola y = 1/x is concave on (,0) and is convex on (0, ). In the whole of the real line it is neither concave nor convex Example. The absolute value function y = x is convex on the whole of R, but, it is both concave on convex on the intervals (,0] and [0, ) Exercise. i. Prove: a line [in the Cartesian plane] is both convex and concave. ii. Is the requirement of convexity of domain essential for the class of concave and convex functions? Explain why or why not. chapter 8: nonlinear programming 29
30 Remark. In either a concave function g(x)or a convex function f(x),graphically, there are no breaks or jumps that occur in the respective graphs of gand f, because the respective domains are convex sets. The nonconvexity of the domainwill not make fa valid convex function f( x ) 2 f( x) 1 x x 1 2 f( x ) 2 f( x) 1 The presence of the jump discontinuity will not make fa valid concave function x x 1 2 chapter 8: nonlinear programming 30
31 To avoid confusion with the word convex, old terminology used the word convex to denote a convex set and the word concave to denote the following: concave upward (for convex functions), and concave downward (for concave functions). Theorem 8.8. A concave function is continuous in the interior of its domain. Theorem 8.9. A convex function is continuous in the interior of its domain. Remark. If fis concave (resp., convex), then fis convex (resp., concave). Theorem Let f(x) be twice continuously differentiable on ain open interval (a,b). i. fis concave on (a,b) iff f (x) 0, for every xin (a,b). ii. fis convex on (a,b) iff f (x) 0, for every xin (a,b). chapter 8: nonlinear programming 31
32 Theorem Let f(x) be twice continuously differentiable on ain open interval (a,b). i. If f (x) < 0, for every xin (a,b), then fis strictly concave on (a,b). ii. If f (x) > 0, for every xin (a,b), then fis strictly convex on (a,b). Remark. The converse of Theorem 8.11 is not true. For example, the function g(x) = x 4 is strictly convex on R. But f (0) = 0 Recall that we had this similar case when we considered the function h(x) = x 3. In here, x* = 0 is a horizontal point of inflection. Thus, the condition that f ( x*) = 0 does not always yield to the conclusion that the stationary point x* = 0 is indeed a horizontal point of inflection. chapter 8: nonlinear programming 32
33 4 y = x 2 y = x The point x* = 0 is the minimum point of y = x 4, but it does not satisfy the sufficiency condition. (0,0) Theorem Let f(x) have continuous second order partial derivatives on an [open] convex n Cof R. i. fis concave on C iffthe Hessian matrix 2 f is negative semidefinite on C. ii. fis convex on C iffthe Hessian matrix 2 f is positive semidefinite on C. Theorem Let f(x) have continuous second order partial derivatives on an [open] convex n Cof R. i. If the Hessian matrix 2 f is negative definite x C, then fis strictly concave on C. ii. If the Hessian matrix 2 f is positive definite x C, then fis strictly convex on C. chapter 8: nonlinear programming 33
34 Example. Consider the function f( x, y) = x y 2 2 f( x, y) = x y 2 2 By the remark after Theorem 8.9, g( x, y): = f( x, y) = x + y 2 2 is a strictly convex function. chapter 8: nonlinear programming 34
35 g( x, y) = x + y 2 2 Theorem Let Cbe convex, f, g: C R, C R If fand gare (strictly) concave on Cthen i. f + gis (strictly) concave on C ii. rfis (strictly) concave on C for every r> 0. iii. sfis (strictly) convex on C for every s< 0. n Example. Consider the functions y = f( x) = x y = g( x) = x 2 and let r = 1, s = 2. 2 chapter 8: nonlinear programming 35
36 Example. Consider a firm in the perfectly competitive market producing output qwith revenue function R(q) and cost function C(q). The profit function is given by Π ( q) = R( q) C( q) If pis the market price of q, then R( q) = pq Theorem Let C be convex, f, g: C R, C R If fand gare (strictly) convex on Cthen i. f + gis (strictly) convex on C ii. rfis (strictly) convex on C for every r> 0. iii. sfis (strictly) concave on C for every s< 0. n Example. Consider the functions y = f x = + 2 ( ) x 1 y = g( x) = (5/2) x and let r = 2, s = 1. chapter 8: nonlinear programming 36
37 Theorem Let Cbe convex, f: C R, C R Let the function g: f( C) R be defined on f(c), and f(c) is convex. If both fand gare (strictly) concave (with respect to domains) with gincreasing on f(c), then g fis (strictly) concave on C. n Theorem Let Cbe convex, f: C R, C R Let the function g: f( C) R be defined on f(c), and f(c) is convex. If both fand gare (strictly) convex (with respect to domains) with gincreasing on f(c), then g fis (strictly) convex on C. n Exercise. Consider the function a b z = f( x, y) = Cx y, a, b, C > 0 Show that i. zis concave iff a + b = 1. ii. z is strictly concave iff a + b < 1 iii. z is not concave iff a + b > 1. chapter 8: nonlinear programming 37
38 Theorem Let Cbe an open convex set, f: C R, x* C R where fhave continuous first order partial derivatives on C. If f is (strictly) concave on C, then x* is a (strict) local maximizer of fiff x* is a stationary point of f. n Theorem Let Cbe an open convex set, f: C R, x* C R where fhave continuous first order partial derivatives on C. If f is (strictly) convex on C, then x* is a (strict) local minimizer of fiff x* is a stationary point of f. n Theorem Every local maximizer of a concave function is a global maximizer. Also, every local minimizer of a convex function is a global minimizer. Theorem A local maximizer of a strictly concave function is unique. Also, a local minimizer of a strictly convex function is unique. chapter 8: nonlinear programming 38
39 A local minimum of a strictly convex function is unique, and also it is the global minimum f( x ) 2 f( x) 1 f( rx + (1 r) x ) 1 2 x rx + (1 r) x x f( rx + (1 r) x ) 1 2 f( x) 1 A local maximum of a strictly concave function is unique, and also it is the global maximum f( x ) 2 (1 ) x rx + r x x Example. Consider w = x + xz y + y + yz + 3z chapter 8: nonlinear programming 39
40 Exercise. To make economic sense, what restrictions must be imposed to the parameters a, b, c, and dof the total cost function 3 2 C( q) = aq + bq + cq + d Justify your answer. Optimization Optimization Definition.The general optimization problem, also known as the mathematical programming problem (or a constrained optimization problem), is given by max(ormin) f( x) subject to x X chapter 8: nonlinear programming 40
41 Optimization where fis a real-valued function and Xis a subset of the Euclidean n space R. We call fthe objective functionand Xis called the feasible setor the feasible region. An element of the feasible set is called a feasible pointor feasible solution. The feasible set is described by equalities or inequalities which we call constraints. Optimization If the objective function and all the constraints are linear, we call the optimization problem a linear programming problem. If either the objective function or at least one of the constraints are nonlinear, we call the optimization problem a nonlinear programming problem. chapter 8: nonlinear programming 41
42 Definition. Consider the nonlinear programming problem max z = f( x, y) s.t. g( x, y) = b The above problem is also called as a constrained optimization problem. We call z= f(x,y)the objective function and g(x,y) = b the constraint. Geometric interpretation Remark. Consider the constrained problem max z = f ( x, y ) s.t. ax + by = c The constraint restricts the values of fto the points of the constraint; i.e., the intersection of the surface fand the plane ax+ by = c; thereby maximizing fon this plane. Geometric interpretation z f(x,y) x ax + by = c y chapter 8: nonlinear programming 42
43 Definition. Given the problem max(ormin) z = f( x, y) s.t. g( x, y) = b The Lagrangean function(or simply, Lagrangean) is defined by ( λ, x, y) = f( x, y) + λ b g( x, y) The scalar λis called the Lagrange multiplier. Remark. The gradient of from the above problem is given by ( λ, x, y) λ x(, x, y) / λ = λ y(, x, y) = / x λ λ / y (, x, y) The Hessian matrix of (with arguments suppressed) is given by λλ λx λy 2 = xλ xx xy y λ yx yy called the bordered Hessian. chapter 8: nonlinear programming 43
44 Theorem [Necessary condition] Given the problem max(ormin) z = f( x, y) s.t. g( x, y) = b where fand g have continuous first order partial derivatives. Let (x*,y*) be an optimizer of fon the feasible set and suppose that g x( x, y) 0 g( x, y) = g ( x, y) 0 y Then, there is a scalar λ* such that ( λ*, x*, y*) = θ i.e., (λ*,x*,y*)is a stationary point of. 3 Theorem [Sufficient condition] Given the problem max(ormin) z = f( x, y) s.t. g( x, y) = b where fand g have continuous second order partial derivatives. Let (x*,y*) be an optimizer of fon the feasible set and suppose that chapter 8: nonlinear programming 44
45 g ( x, y) 0 g ( x, y) 0 x and that λ* and x*, y* satisfy 2 ( i) ( λ*, x*, y*) = θ det[ ( λ*, x*, y*)] < 0 2 ( ii) y ( x*, y*)localmin of f det[ ( λ*, x*, y*)] > 0 ( x*, y*)localmax of f 3 Example. Consider the firm s problem max F( K, L) = 5KL s.t. K + L = 10 Example. Examine for maxima or minima: s.t. f( x, y) = kxy x 2 + y 2 = b where band kare positive constants. chapter 8: nonlinear programming 45
46 Remark. Given the problem max(ormin) f( x, y) subjectto g( x, y) = b It is possible to solve the above by graphical methodor to do a substitution method: to rewrite the constraint and substitute into the objective function as if it were an unconstrained problem. Example. What is the point on the line x+ 2y = 4 that is closest to the origin? l (0,2) P = (0,0) (4,0) chapter 8: nonlinear programming 46
47 Graphical method: A careful sketching of the objective function and the constraint will yield the point Substitution method: We can rewrite the constraint as x = 4 2y Lagrangean method: Recall that the constrained problem is given by min 2 2 x + y = z s.t. x + 2y = 4 chapter 8: nonlinear programming 47
48 Exercise. i. What is the maximum product of n positive numbers and whose sum is unity? ii. Show that of all rectangles with a fixed perimeter P, the square will have the largest area. Remark. In the previous slide (exercise 1), if there are two positive numbers, we have the nonlinear programming problem max xy = z s.t. x + y = 1, x, y > 0 Exercise. Consider again the problem max F( K, L) = 5KL s.t. K + L = 10 Verify the solution obtained previously using the Lagrangean method by using the graphical and substitution methods. chapter 8: nonlinear programming 48
49 Theorem Consider the problem max(ormin) z = f( x, y) s.t. g( x, y) = b where fand ghave continuous second order partial derivatives and bis a parameter. Suppose that (x*,y*) solves the problem and λ* is the associated Lagrange multiplier. If f(x*,y*) is a differentiable function of b, then df( x*, y*) = λ* db Theorem Consider the problem max(ormin) f( x) = z subject to g( x) = b Suppose that x*solves the problem and f(x*) is a differentiable function of b. Then df( x*) = λ* db chapter 8: nonlinear programming 49
50 Exercise. Consider the problem min z = f( x, y) = x + y s.t. ( x 1) y = 0 Show that the method of Lagrange multipliers does not work in this case and explain why. Exercise. Examine for optima using the accompanying Lagrangean function: z = x + y 2 2 s.t. xy = 1 Verify the answers using graphical method. Does the substitution method apply? Definition. Consider the problem max f( x) s.t. g( x) = b m < n with Lagrangean k n x R, k = 1,..., m m ( λ, x ) = f( x ) + λ b g( ) k x k k k k= 1 chapter 8: nonlinear programming 50
51 A point (λ*,x*) is called a saddle pointof iff ( λ*, x) ( λ*, x*) ( λ, x*) Remark. The saddle point of the Lagrangean is defined similarly with that of a function f(x,y); i.e., a point (x #,y # ) is a saddle point of fiff f x y f x y f x y # # # # (, ) (, ) (, ), ( x, y) Df Theorem Given the problem max f( x), s.t. g( x) = b, k = 1,..., m k x R where f,g 1,g 2,...,g k are real-valued functions defined on k n X R n m < n If (λ*,x*) is a saddle point of, then g( x*) b = 0, k = 1,..., m k k Remark. More generally, we have the next result, stated in a theorem. chapter 8: nonlinear programming 51
52 Theorem Given the problem max f( x), s.t. g( x) = b, k = 1,..., m k x R where f,g 1,g 2,...,g k are real-valued functions defined on k n X R n m < n If (λ*,x*) is a saddle point of, then x* is a global maximizer of f, subject to the constraints g( x) = b, k = 1,..., m k k Exercise. Consider again the problem max F( K, L) = 5KL s.t. K + L = 10 Verify the stationary point (λ*,x*,y*) = (25,5,5) is a saddle point of the corresponding Lagrangean function. chapter 8: nonlinear programming 52
53 To end... It is true that a mathematician who is not also something of a poet will never be a perfect mathematician. Karl Weierstrass chapter 8: nonlinear programming 53
where u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More 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 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 informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
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 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 informationCalculus 221 worksheet
Calculus 221 worksheet Graphing A function has a global maximum at some a in its domain if f(x) f(a) for all other x in the domain of f. Global maxima are sometimes also called absolute maxima. A function
More informationMathematics for Economics ECON MA/MSSc in Economics-2017/2018. Dr. W. M. Semasinghe Senior Lecturer Department of Economics
Mathematics for Economics ECON 53035 MA/MSSc in Economics-2017/2018 Dr. W. M. Semasinghe Senior Lecturer Department of Economics MATHEMATICS AND STATISTICS LERNING OUTCOMES: By the end of this course unit
More informationV. Graph Sketching and Max-Min Problems
V. Graph Sketching and Max-Min Problems The signs of the first and second derivatives of a function tell us something about the shape of its graph. In this chapter we learn how to find that information.
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 informationFunctions. A function is a rule that gives exactly one output number to each input number.
Functions A function is a rule that gives exactly one output number to each input number. Why it is important to us? The set of all input numbers to which the rule applies is called the domain of the function.
More informationEconomics 205 Exercises
Economics 05 Eercises Prof. Watson, Fall 006 (Includes eaminations through Fall 003) Part 1: Basic Analysis 1. Using ε and δ, write in formal terms the meaning of lim a f() = c, where f : R R.. Write the
More 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 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 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 informationMath 118, Fall 2014 Final Exam
Math 8, Fall 4 Final Exam True or false Please circle your choice; no explanation is necessary True There is a linear transformation T such that T e ) = e and T e ) = e Solution Since T is linear, if T
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 informationMA102: Multivariable Calculus
MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable
More information3 Applications of partial differentiation
Advanced Calculus Chapter 3 Applications of partial differentiation 37 3 Applications of partial differentiation 3.1 Stationary points Higher derivatives Let U R 2 and f : U R. The partial derivatives
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 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 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 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 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 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 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 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 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 informationNONLINEAR. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
NONLINEAR PROGRAMMING (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Nonlinear Programming g Linear programming has a fundamental role in OR. In linear programming all its functions
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 informationMATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.
MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if
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 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 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 information1. Introduction. 2. Outlines
1. Introduction Graphs are beneficial because they summarize and display information in a manner that is easy for most people to comprehend. Graphs are used in many academic disciplines, including math,
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 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 informationIndex. Cambridge University Press An Introduction to Mathematics for Economics Akihito Asano. Index.
, see Q.E.D. ln, see natural logarithmic function e, see Euler s e i, see imaginary number log 10, see common logarithm ceteris paribus, 4 quod erat demonstrandum, see Q.E.D. reductio ad absurdum, see
More informationSTUDY MATERIALS. (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.
STUDY MATERIALS MATHEMATICAL TOOLS FOR ECONOMICS III (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.) & MATHEMATICAL TOOLS FOR
More informationFinal Exam Study Guide
Final Exam Study Guide Final Exam Coverage: Sections 10.1-10.2, 10.4-10.5, 10.7, 11.2-11.4, 12.1-12.6, 13.1-13.2, 13.4-13.5, and 14.1 Sections/topics NOT on the exam: Sections 10.3 (Continuity, it definition
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 informationOptimization Theory. Lectures 4-6
Optimization Theory Lectures 4-6 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the non-negative orthant {x0ú n x$0} Existence of a maximum:
More 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 informationChapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics
Chapter 3a Topics in differentiation Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Problems in differentiation Problems in differentiation Problem 1.
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent
More informationSuppose that f is continuous on [a, b] and differentiable on (a, b). Then
Lectures 1/18 Derivatives and Graphs When we have a picture of the graph of a function f(x), we can make a picture of the derivative f (x) using the slopes of the tangents to the graph of f. In this section
More informationWeek 4: Calculus and Optimization (Jehle and Reny, Chapter A2)
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
More information1. Which one of the following points is a singular point of. f(x) = (x 1) 2/3? f(x) = 3x 3 4x 2 5x + 6? (C)
Math 1120 Calculus Test 3 November 4, 1 Name In the first 10 problems, each part counts 5 points (total 50 points) and the final three problems count 20 points each Multiple choice section Circle the correct
More informationBi-Variate Functions - ACTIVITES
Bi-Variate Functions - ACTIVITES LO1. Students to consolidate basic meaning of bi-variate functions LO2. Students to learn how to confidently use bi-variate functions in economics Students are given the
More informationECARES Université Libre de Bruxelles MATH CAMP Basic Topology
ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationWorkshop I The R n Vector Space. Linear Combinations
Workshop I Workshop I The R n Vector Space. Linear Combinations Exercise 1. Given the vectors u = (1, 0, 3), v = ( 2, 1, 2), and w = (1, 2, 4) compute a) u + ( v + w) b) 2 u 3 v c) 2 v u + w Exercise 2.
More informationAdvanced Calculus Notes. Michael P. Windham
Advanced Calculus Notes Michael P. Windham February 25, 2008 Contents 1 Basics 5 1.1 Euclidean Space R n............................ 5 1.2 Functions................................. 7 1.2.1 Sets and functions........................
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationExamination paper for TMA4180 Optimization I
Department of Mathematical Sciences Examination paper for TMA4180 Optimization I Academic contact during examination: Phone: Examination date: 26th May 2016 Examination time (from to): 09:00 13:00 Permitted
More informationChapter 4E - Combinations of Functions
Fry Texas A&M University!! Math 150!! Chapter 4E!! Fall 2015! 121 Chapter 4E - Combinations of Functions 1. Let f (x) = 3 x and g(x) = 3+ x a) What is the domain of f (x)? b) What is the domain of g(x)?
More informationMath 1120 Calculus Test 3
March 27, 2002 Your name The first 7 problems count 5 points each Problems 8 through 11 are multiple choice and count 7 points each and the final ones counts as marked In the multiple choice section, circle
More informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
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 informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationOptimization: Problem Set Solutions
Optimization: Problem Set Solutions Annalisa Molino University of Rome Tor Vergata annalisa.molino@uniroma2.it Fall 20 Compute the maxima minima or saddle points of the following functions a. f(x y) =
More information14 Lecture 14 Local Extrema of Function
14 Lecture 14 Local Extrema of Function 14.1 Taylor s Formula with Lagrangian Remainder Term Theorem 14.1. Let n N {0} and f : (a,b) R. We assume that there exists f (n+1) (x) for all x (a,b). Then for
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 informationMath 10C - Fall Final Exam
Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient
More informationLagrange Multipliers
Lagrange Multipliers 3-15-2018 The method of Lagrange multipliers deals with the problem of finding the maxima and minima of a function subject to a side condition, or constraint. Example. Find graphically
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 informationHigher order derivative
2 Î 3 á Higher order derivative Î 1 Å Iterated partial derivative Iterated partial derivative Suppose f has f/ x, f/ y and ( f ) = 2 f x x x 2 ( f ) = 2 f x y x y ( f ) = 2 f y x y x ( f ) = 2 f y y y
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationApplications of Derivatives
Applications of Derivatives Extrema on an Interval Objective: Understand the definition of extrema of a function on an interval. Understand the definition of relative extrema of a function on an open interval.
More informationReading Mathematical Expressions & Arithmetic Operations Expression Reads Note
Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ
More informationAPPLICATION OF DERIVATIVES
94 APPLICATION OF DERIVATIVES Chapter 6 With the Calculus as a key, Mathematics can be successfully applied to the explanation of the course of Nature. WHITEHEAD 6. Introduction In Chapter 5, we have learnt
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationUniversidad Carlos III de Madrid
Universidad Carlos III de Madrid Question 1 3 4 5 6 Total Grade Economics Department Final Exam, Mathematics I January 14, 011 Total length: hours. SURNAME: NAME: DNI: Degree: Group: { 4(x 4) if 3 x 4
More informationMath for Economics 1 New York University FINAL EXAM, Fall 2013 VERSION A
Math for Economics 1 New York University FINAL EXAM, Fall 2013 VERSION A Name: ID: Circle your instructor and lecture below: Jankowski-001 Jankowski-006 Ramakrishnan-013 Read all of the following information
More informationPartial Derivatives. w = f(x, y, z).
Partial Derivatives 1 Functions of Several Variables So far we have focused our attention of functions of one variable. These functions model situations in which a variable depends on another independent
More informationFinal Exam Review Packet
1 Exam 1 Material Sections A.1, A.2 and A.6 were review material. There will not be specific questions focused on this material but you should know how to: Simplify functions with exponents. Factor quadratics
More informationFinal Exam Review Packet
1 Exam 1 Material Sections A.1, A.2 and A.6 were review material. There will not be specific questions focused on this material but you should know how to: Simplify functions with exponents. Factor quadratics
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 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 informationOptimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50
Sherif Khalifa Sherif Khalifa () Optimization 1 / 50 Y f(x 0 ) Y=f(X) X 0 X Sherif Khalifa () Optimization 2 / 50 Y Y=f(X) f(x 0 ) X 0 X Sherif Khalifa () Optimization 3 / 50 A necessary condition for
More informationECON 186 Class Notes: Optimization Part 2
ECON 186 Class Notes: Optimization Part 2 Jijian Fan Jijian Fan ECON 186 1 / 26 Hessians The Hessian matrix is a matrix of all partial derivatives of a function. Given the function f (x 1,x 2,...,x n ),
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 A-level maths,
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More 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 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 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 information0, otherwise. Find each of the following limits, or explain that the limit does not exist.
Midterm Solutions 1, y x 4 1. Let f(x, y) = 1, y 0 0, otherwise. Find each of the following limits, or explain that the limit does not exist. (a) (b) (c) lim f(x, y) (x,y) (0,1) lim f(x, y) (x,y) (2,3)
More informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier Martinez-Giralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization - Non-Linear programming OPT p.1/45
More informationLagrange Multipliers
Lagrange Multipliers (Com S 477/577 Notes) Yan-Bin Jia Nov 9, 2017 1 Introduction We turn now to the study of minimization with constraints. More specifically, we will tackle the following problem: minimize
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 informationChapter 7. Extremal Problems. 7.1 Extrema and Local Extrema
Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced
More informationApplications of Differentiation
MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Module9 7 Introduction Applications of to Matrices Differentiation y = x(x 1)(x 2) d 2
More informationMath Maximum and Minimum Values, I
Math 213 - Maximum and Minimum Values, I Peter A. Perry University of Kentucky October 8, 218 Homework Re-read section 14.7, pp. 959 965; read carefully pp. 965 967 Begin homework on section 14.7, problems
More informationMATH Midterm 1 Sample 4
1. (15 marks) (a) (4 marks) Given the function: f(x, y) = arcsin x 2 + y, find its first order partial derivatives at the point (0, 3). Simplify your answers. Solution: Compute the first order partial
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 informationARE211, Fall2015. Contents. 2. Univariate and Multivariate Differentiation (cont) Taylor s Theorem (cont) 2
ARE211, Fall2015 CALCULUS4: THU, SEP 17, 2015 PRINTED: SEPTEMBER 22, 2015 (LEC# 7) Contents 2. Univariate and Multivariate Differentiation (cont) 1 2.4. Taylor s Theorem (cont) 2 2.5. Applying Taylor theory:
More informationAB CALCULUS SEMESTER A REVIEW Show all work on separate paper. (b) lim. lim. (f) x a. for each of the following functions: (b) y = 3x 4 x + 2
AB CALCULUS Page 1 of 6 NAME DATE 1. Evaluate each it: AB CALCULUS Show all work on separate paper. x 3 x 9 x 5x + 6 x 0 5x 3sin x x 7 x 3 x 3 5x (d) 5x 3 x +1 x x 4 (e) x x 9 3x 4 6x (f) h 0 sin( π 6
More informationChapter 3 Prerequisite Skills. Chapter 3 Prerequisite Skills Question 1 Page 148. a) Let f (x) = x 3 + 2x 2 + 2x +1. b) Let f (z) = z 3 6z 4.
Chapter 3 Curve Sketching Chapter 3 Prerequisite Skills Chapter 3 Prerequisite Skills Question 1 Page 148 a) Let f (x) = x 3 + 2x 2 + 2x +1. f (1) = 6 f (Ğ1) = 0 (x +1) is a factor. x 3 + 2x 2 + 2x +1
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 information