Multivariate Calculus - Bruce E. Shapiro

Multivariate Calculus - Bruce E. Shapiro Multivariate Calculus - Bruce E. Shapiro

bruce.shapiro.com
from bruce.shapiro.com More from this publisher
21.04.2015 Views

124 LECTURE 15. CONSTRAINED OPTIMIZATION: LAGRANGE MULTIPLIERS Solution. The idea is to find the extreme values of the function f(x, y, z) subject to the constraints imposed by and g(x, y, z) = x 2 + y 2 − 2 = 0 h(x, y, z) = y + 2z − 1 Lagrange’s method says that ∇f = λ∇g + µ∇h (−1, 2, 2) = λ (2x, 2y, 0) + µ (0, 1, 2) Hence we have 5 equations in 5 unknowns, We can immediately elminate µ = 1, to give Using equations 15.20 and 15.15 in equation 15.18 gives or 2xλ = −1 (15.15) 2yλ + µ = 2 (15.16) 2µ = 2 (15.17) x 2 + y 2 = 2 (15.18) y + 2z = 1 (15.19) 2yλ = 1 (15.20) 2 = x 2 + y 2 = (1/2λ) 2 + (−1/2λ) 2 = 1/(2λ 2 ) (15.21) λ = ±1/2 (15.22) For λ = 1/2 we have x = −1, y = 1 and z = (1 − y)/2 = 0. At this point f(−1, 1, 0) = 1 + 2(1) + 0 = 3. For λ = −1/2 we have x = 1, y = −1, and z = 1. Here f(1, −1, 1) = −1 − 2 + 2 = −1. Hence the maximum of 3 occurs at (-1, 1, 0) and the minimum of -1 occurs at (1, -1, 1). Example 15.8 The cone z 2 = x 2 + y 2 is cut by the plane z = 1 + x + y in some curve C. Find the point on C that is closest to the origin. Solution We need to minimize subject to the two constraints f(x, y, z) = x 2 + y 2 + z 2 (15.23) g(x, y, z) = z 2 − x 2 − y 2 = 0 (15.24) h(x, y, z) = z − 1 − x − y = 0 (15.25) Revised December 6, 2006. Math 250, Fall 2006

LECTURE 15. CONSTRAINED OPTIMIZATION: LAGRANGE MULTIPLIERS 125 Applying our usual technique, ∇f = λ∇g + µ∇h, so that or (2x, 2y, 2z) = λ (−2x, −2y, 2z) + µ (−1, −1, 1) (15.26) 2x = −2xλ − µ (15.27) 2y = −2yλ − µ (15.28) 2z = 2zλ + µ (15.29) We can elminate µ by adding equation 15.29 to each of equations 15.27 and 15.28 to give 2x + 2z = 2λ(z − x) (15.30) or Equating the two expressions for λ, Hence y = x or z = 0. Case 1: z=0 2y + 2z = 2λ(z − y) (15.31) λ = z + x z − x λ = z + y z − y z + x z − x = z + y z − y (z + x)(z − y) = (z + y)(z − x) z 2 + xz − yz − xy = z 2 + yz − xz − xy xz − yz = yz − xz yz = xz (15.32) (15.33) From the constraint g we have x 2 + y 2 = 0 which means x = 0 and y = 0. The origin is the only point on the cone that satisfies z = 0. But this point is not on the plane z = 1 + x + y. So there is no solution here. Case 2: x=y The first constraint (g) gives z 2 = 2x 2 . The second constraint (h) gives z = 1 + 2x, hence (1 + 2x) 2 = 2x 2 ⇒ 1 + 4x + 4x 2 = 2x 2 ⇒ 2x 2 + 4x + 1 = 0 hence y = x = −4 ± √ 8 4 = −1 ± 1 √ 2 ( z = 1 + 2 −1 ± √ 1 ) = −1 ± √ 2 2 Math 250, Fall 2006 Revised December 6, 2006.

LECTURE 15. CONSTRAINED OPTIMIZATION: LAGRANGE<br />

MULTIPLIERS 125<br />

Applying our usual technique, ∇f = λ∇g + µ∇h, so that<br />

or<br />

(2x, 2y, 2z) = λ (−2x, −2y, 2z) + µ (−1, −1, 1) (15.26)<br />

2x = −2xλ − µ (15.27)<br />

2y = −2yλ − µ (15.28)<br />

2z = 2zλ + µ (15.29)<br />

We can elminate µ by adding equation 15.29 to each of equations 15.27 and 15.28<br />

to give<br />

2x + 2z = 2λ(z − x) (15.30)<br />

or<br />

Equating the two expressions for λ,<br />

Hence y = x or z = 0.<br />

Case 1: z=0<br />

2y + 2z = 2λ(z − y) (15.31)<br />

λ = z + x<br />

z − x<br />

λ = z + y<br />

z − y<br />

z + x<br />

z − x = z + y<br />

z − y<br />

(z + x)(z − y) = (z + y)(z − x)<br />

z 2 + xz − yz − xy = z 2 + yz − xz − xy<br />

xz − yz = yz − xz<br />

yz = xz<br />

(15.32)<br />

(15.33)<br />

From the constraint g we have x 2 + y 2 = 0 which means x = 0 and y = 0. The<br />

origin is the only point on the cone that satisfies z = 0. But this point is not on the<br />

plane z = 1 + x + y. So there is no solution here.<br />

Case 2: x=y<br />

The first constraint (g) gives z 2 = 2x 2 . The second constraint (h) gives z = 1 + 2x,<br />

hence<br />

(1 + 2x) 2 = 2x 2 ⇒ 1 + 4x + 4x 2 = 2x 2 ⇒ 2x 2 + 4x + 1 = 0<br />

hence<br />

y = x = −4 ± √ 8<br />

4<br />

= −1 ± 1 √<br />

2<br />

(<br />

z = 1 + 2 −1 ± √ 1 )<br />

= −1 ± √ 2<br />

2<br />

Math 250, Fall 2006 Revised December 6, 2006.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!