Multivariate Calculus - Bruce E. Shapiro
Multivariate Calculus - Bruce E. Shapiro Multivariate Calculus - Bruce E. Shapiro
116 LECTURE 14. UNCONSTRAINED OPTIMIZATION Case 2: d < 0 If d < 0 then write d = − |d| = m 2 > 0 for some number m > 0, so that [ ( g(u, v) = A u + B ) ] 2 ( mv ) 2 2A v − 2A If we make yet another change of variables, then p = u + Bv 2A , q = mv 2A g(u, v) = A [ p 2 − q 2] This is a hyperbolic paraboloid with a saddle at (p, q) = (0, 0). The original critical point is at u = 0, v = 0, which corresponds to (p, q) = 0. So this is also a saddle point in uv-space. Case 3: d=0 Finally, if d = 0 then ( g(u, v) = A u + Bv ) 2 2A Along the line u = −B/(2A)v, g(u, v) identically equal to zero. Thus g(u, v) is a constant along this line. Otherwise, g is always positive when A > 0 and always negative (when A < 0). Thus the origin is neither a maximum of a minimum. Revised December 6, 2006. Math 250, Fall 2006
Lecture 15 Constrained Optimization: Lagrange Multipliers In the previous section we learned how to find the maximum and minimum points of a function of two variables. In this section we will study how to find the maximum and minimum points on a function subject to a constraint using a technique called Lagrange’s Method or The Method of Langrange Multipliers. Theorem 15.1 Lagrange’s Method. An extreme value of the function f(x, y) subject to the constraint g(x, y) = 0 occurs when for some number λ. ∇f(x, y) = λ∇g(x, y) We introduce the method along with the concept of a constraint via the following example. Example 15.1 Find the dimensions and area of the largest rectangular area that can be enclosed with a fixed length of fence M. Solution Let the sides of the rectangle have length x and y. Then the area is given by the function f(x, y) where . Similarly, the perimeter M is f(x, y) = xy M = 2x + 2y One way to solve this problem is to solve for one of the variables, say y, as a function of x and M, substitute the result into the equation for the area, and then 117
- Page 77 and 78: LECTURE 9. THE PARTIAL DERIVATIVE 6
- Page 79 and 80: Lecture 10 Limits and Continuity In
- Page 81 and 82: LECTURE 10. LIMITS AND CONTINUITY 6
- Page 83 and 84: LECTURE 10. LIMITS AND CONTINUITY 7
- Page 85 and 86: Lecture 11 Gradients and the Direct
- Page 87 and 88: LECTURE 11. GRADIENTS AND THE DIREC
- Page 89 and 90: LECTURE 11. GRADIENTS AND THE DIREC
- Page 91 and 92: LECTURE 11. GRADIENTS AND THE DIREC
- Page 93 and 94: Lecture 12 The Chain Rule Recall th
- Page 95 and 96: LECTURE 12. THE CHAIN RULE 83 The p
- Page 97 and 98: LECTURE 12. THE CHAIN RULE 85 Examp
- Page 99 and 100: LECTURE 12. THE CHAIN RULE 87 becau
- Page 101 and 102: LECTURE 12. THE CHAIN RULE 89 Solut
- Page 103 and 104: LECTURE 12. THE CHAIN RULE 91 Examp
- Page 105 and 106: Lecture 13 Tangent Planes Since the
- Page 107 and 108: LECTURE 13. TANGENT PLANES 95 Solut
- Page 109 and 110: LECTURE 13. TANGENT PLANES 97 Multi
- Page 111 and 112: LECTURE 13. TANGENT PLANES 99 Accor
- Page 113 and 114: Lecture 14 Unconstrained Optimizati
- Page 115 and 116: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 117 and 118: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 119 and 120: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 121 and 122: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 123 and 124: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 125 and 126: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 127: LECTURE 14. UNCONSTRAINED OPTIMIZAT
- Page 131 and 132: LECTURE 15. CONSTRAINED OPTIMIZATIO
- Page 133 and 134: LECTURE 15. CONSTRAINED OPTIMIZATIO
- Page 135 and 136: LECTURE 15. CONSTRAINED OPTIMIZATIO
- Page 137 and 138: LECTURE 15. CONSTRAINED OPTIMIZATIO
- Page 139 and 140: Lecture 16 Double Integrals over Re
- Page 141 and 142: LECTURE 16. DOUBLE INTEGRALS OVER R
- Page 143 and 144: LECTURE 16. DOUBLE INTEGRALS OVER R
- Page 145 and 146: LECTURE 16. DOUBLE INTEGRALS OVER R
- Page 147 and 148: Lecture 17 Double Integrals over Ge
- Page 149 and 150: LECTURE 17. DOUBLE INTEGRALS OVER G
- Page 151 and 152: LECTURE 17. DOUBLE INTEGRALS OVER G
- Page 153 and 154: LECTURE 17. DOUBLE INTEGRALS OVER G
- Page 155 and 156: LECTURE 17. DOUBLE INTEGRALS OVER G
- Page 157 and 158: Lecture 18 Double Integrals in Pola
- Page 159 and 160: LECTURE 18. DOUBLE INTEGRALS IN POL
- Page 161 and 162: LECTURE 18. DOUBLE INTEGRALS IN POL
- Page 163 and 164: LECTURE 18. DOUBLE INTEGRALS IN POL
- Page 165 and 166: LECTURE 18. DOUBLE INTEGRALS IN POL
- Page 167 and 168: Lecture 19 Surface Area with Double
- Page 169 and 170: LECTURE 19. SURFACE AREA WITH DOUBL
- Page 171 and 172: LECTURE 19. SURFACE AREA WITH DOUBL
- Page 173 and 174: Lecture 20 Triple Integrals Triple
- Page 175 and 176: LECTURE 20. TRIPLE INTEGRALS 163 Fi
- Page 177 and 178: LECTURE 20. TRIPLE INTEGRALS 165 so
Lecture 15<br />
Constrained Optimization:<br />
Lagrange Multipliers<br />
In the previous section we learned how to find the maximum and minimum points of<br />
a function of two variables. In this section we will study how to find the maximum<br />
and minimum points on a function subject to a constraint using a technique called<br />
Lagrange’s Method or The Method of Langrange Multipliers.<br />
Theorem 15.1 Lagrange’s Method. An extreme value of the function f(x, y)<br />
subject to the constraint<br />
g(x, y) = 0<br />
occurs when<br />
for some number λ.<br />
∇f(x, y) = λ∇g(x, y)<br />
We introduce the method along with the concept of a constraint via the following<br />
example.<br />
Example 15.1 Find the dimensions and area of the largest rectangular area that<br />
can be enclosed with a fixed length of fence M.<br />
Solution Let the sides of the rectangle have length x and y. Then the area is<br />
given by the function f(x, y) where<br />
. Similarly, the perimeter M is<br />
f(x, y) = xy<br />
M = 2x + 2y<br />
One way to solve this problem is to solve for one of the variables, say y, as a<br />
function of x and M, substitute the result into the equation for the area, and then<br />
117