LaGrange Multipliers Consider an example from Calculus I:

Slides:



Advertisements
Similar presentations
Chapter 11-Functions of Several Variables
Advertisements

Equation of a Tangent Line
Semester 1 Review Unit vector =. A line that contains the point P(x 0,y 0,z 0 ) and direction vector : parametric symmetric.
5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
Lesson 7.6, page 767 Linear Programming
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
15 PARTIAL DERIVATIVES.
Tutorial 7 Constrained Optimization Lagrange Multipliers
Chapter 14 – Partial Derivatives 14.8 Lagrange Multipliers 1 Objectives:  Use directional derivatives to locate maxima and minima of multivariable functions.
7.1 Area of a Region Between Two Curves.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Solving System of Equations Using Graphing
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Maximum and Minimum Values
The Second Degree Equations. Determine whether the following equations represent a circle, parabola, ellipse or hyperbola. 1. x 2 + 4y 2 – 6x + 10y.
Orthogonal Trajectories
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Systems of Inequalities in Two Variables Sec. 7.5a.
Consider minimizing and/or maximizing a function z = f(x,y) subject to a constraint g(x,y) = c. y z x z = f(x,y) Parametrize the curve defined by g(x,y)
LAGRANGE mULTIPLIERS By Rohit Venkat.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
G.K.BHARAD INSTITUTE OF ENGINEERING Division:D Subject:CALCULUS Subject code: TOPIC.
Tangents and Normals We’re going to talk about tangents and normals to 3-D surfaces such as x 2 + y 2 + z 2 = 4 It’s useful to think of these surfaces.
P roblem of the Day - Calculator Let f be the function given by f(x) = 3e 3x and let g be the function given by g(x) = 6x 3. At what value of x do the.
Optimization unconstrained and constrained Calculus part II.
Solving Systems of Equations: The Elimination Method Solving Systems of Equations: The Elimination Method Solving Systems of Equations: The Elimination.
Extreme Values Let f (x,y) be defined on a region R containing P(x 0,y 0 ): P is a relative max of f if f (x,y) ≤ f (x 0,y 0 ) for all (x,y) on an open.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Functions of Several Variables 13 Copyright © Cengage Learning. All rights reserved.
Section Lagrange Multipliers.
Optimization Ex. A rectangular box lies on the xy-axis with one vertex on the origin. If the opposite vertex lies on the plane 3x + 2y + z = 12, find.
Calculus III Hughes-Hallett Chapter 15 Optimization.
Section 15.3 Constrained Optimization: Lagrange Multipliers.
Lagrange Multipliers. Objective: -Understand the method of Lagrange multipliers -Use Lagrange multipliers to solve constrained optimization problems (functions.
Copyright © Cengage Learning. All rights reserved Maximum and Minimum Values.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Differential Equations
Multiple- Choice, Section I Part A Multiple- Choice, Section I Part B Free- Response, Section II Part A Free- Response, Section II Part B # of Questions.
Calculus Continued Tangents and Normals Example Find the equations of the tangent and normal to the graph of at the point where.
Unit 2 Lesson #3 Tangent Line Problems
Multivariate Optimization Problems
Chapter 14 Partial Derivatives
Chapter 14 Partial Derivatives.
Differential Equations
Digital Lesson Linear Programming.
Digital Lesson Linear Programming.
Copyright © Cengage Learning. All rights reserved.
Concentric and Tangent Circles
Lagrange Multipliers By Dr. Julia Arnold Professor of Mathematics
Linear Programming.
Linear Programming Objectives: Set up a Linear Programming Problem
Circle Centre (a, b) radius r
Solve the differential equation. {image}
7.2 Area Between Two Curves
3-4 Linear Programming.
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
13 Functions of Several Variables
SIMULTANEOUS EQUATIONS 1
Copyright © Cengage Learning. All rights reserved.
Chapter 7 Functions of Several Variables
Section Linear Programming
Chapter 9 Lesson 3 Pg. 699 Solving Systems of Equations by Graphing
Where do these graphs intersect
Lagrange Multipliers.
Chapter 9 Lesson 3 Pg. 699 Solving Systems of Equations by Graphing
Intersection Method of Solution
Presentation transcript:

LaGrange Multipliers Consider an example from Calculus I: Find the maximal area of the rectangle bounded by the curve Our function f (x,y) = 4xy is subject to the constrain

If we let , our constraint is the level curve where g(x,y) = 1. The family of level curves of f (x,y) is a bunch of hyperbolas. The one that is tangent to the level curve g(x,y) = 1 is the maximal one.

At the point of tangency, both gradients are parallel (remember, gradients are orthogonal to level curves). So f (x0,y0) = λg(x0,y0)  λ is called a LaGrange Multiplier

To find the extreme value of f (x,y) subject to the constraint g(x,y) = c: Solve the simultaneous equations f = λg and g(x,y) = c. Specifically, solve fx = λgx fy = λgy g(x,y) = c 2. Evaluate f (x,y) at each solution. The largest is your maximum, the smallest is your minimum.

Ex. Find the extreme values of f (x,y) = x2 + 2y2 on the circle x2 + y2 = 1.

Ex. Find the points on the sphere x2 + y2 + z2 = 4 that are closest to the point (3,1,-1).

Remember that f is the function to be maximized and g = c is the constraint equation. This method gives us points on the boundary of a region, but we should still use relative max./min. to check the interior of a region.

Ex. Find the extreme values of f (x,y) = x2 + 2y2 on the disk x2 + y2 ≤ 1.

If there are two constrains g(x,y,z) = k and h(x,y,z) = c, we solve the simultaneous equations: f = λg + μh g(x,y,z) = k h(x,y,z) = c

Ex. Find the maximum value of f (x,y,z) = x + 2y + 3z on curve of intersection of x – y + z = 1 and x2 + y2 = 1.

This is the last lesson for Chapter 15, so we will review next class and your test will be on Wednesday