Lagrange Multipliers By Dr. Julia Arnold Professor of Mathematics

Slides:



Advertisements
Similar presentations
Chapter 11-Functions of Several Variables
Advertisements

ESSENTIAL CALCULUS CH11 Partial derivatives
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Lagrange Multipliers OBJECTIVES  Find maximum and minimum values using Lagrange.
Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Optimization 4.7. A Classic Problem You have 40 feet of fence to enclose a rectangular garden along the side of a barn. What is the maximum area that.
Chapter 7: Vectors and the Geometry of Space
4.4 Optimization Finding Optimum Values. A Classic Problem You have 40 feet of fence to enclose a rectangular garden. What is the maximum area that you.
Linear Programming Unit 2, Lesson 4 10/13.
15 PARTIAL DERIVATIVES.
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization
Chapter 14 – Partial Derivatives 14.8 Lagrange Multipliers 1 Objectives:  Use directional derivatives to locate maxima and minima of multivariable functions.
Cylindrical and Spherical Coordinates
Chapter 7: The Cross Product of Two Vectors In Space Section 7.4 Written by Dr. Julia Arnold Associate Professor of Mathematics Tidewater Community College,
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.
Section 4.4: Modeling and Optimization
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.
Optimization Section 4.7 Optimization the process of finding an optimal value – either a maximum or a minimum under strict conditions.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
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.
7.1 Solving Systems of Linear Equations in Three Variables.
4.1 Extreme Values of Functions
Optimization Problems Example 1: A rancher has 300 yards of fencing material and wants to use it to enclose a rectangular region. Suppose the above region.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
LaGrange Multipliers Consider an example from Calculus I:
Economics 2301 Lecture 37 Constrained Optimization.
Systems of Equations By Dr. Marinas. Solving Systems Graphing Method Substitution Method Elimination (or Adding) Method.
2.7 Mathematical Models. Optimization Problems 1)Solve the constraint for one of the variables 2)Substitute for the variable in the objective Function.
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.
A25 & 26-Optimization (max & min problems). Guidelines for Solving Applied Minimum and Maximum Problems 1.Identify all given quantities and quantities.
1.1 The row picture of a linear system with 3 variables.
Partial Derivatives Written by Dr. Julia Arnold Professor of Mathematics Tidewater Community College, Norfolk Campus, Norfolk, VA With Assistance from.
Ch. 5 – Applications of Derivatives 5.4 – Modeling and Optimization.
Lesson 9.6 Topic/ Objective: To solve non linear systems of equations. EQ: How do you find the point of intersection between two equations when one is.
Chapter 14 Partial Derivatives
4.5 Optimization II Dr. Julia Arnold
Cylindrical and Spherical Coordinates
Copyright © 2006 Pearson Education, Inc
Functions of Several Variables
6.3 Solving Systems of Linear Equations in Three Variables
Algebra Review Systems of Equations page 69
4.5 Optimization II Dr. Julia Arnold
Copyright © Cengage Learning. All rights reserved.
Calculus I (MAT 145) Dr. Day Wednesday Nov 8, 2017
Calculus I (MAT 145) Dr. Day Friday Nov 10, 2017
3.6 Solving Systems of Linear Equations in Three Variables
Vectors and the Geometry of Space
6.3 Solving Systems of Linear Equations in Three Variables
Vectors and the Geometry of Space
Ch3/4 Lesson 8b Problem Solving Involving Max and Min
Chapter 8: Partial Derivatives
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
13 Functions of Several Variables
Copyright © Cengage Learning. All rights reserved.
Chapter 7 Functions of Several Variables
Cylindrical and Spherical Coordinates
Lagrange Multipliers.
Calculus I (MAT 145) Dr. Day Wednesday March 27, 2019
Tutorial 3 Applications of the Derivative
9.1 Solving Systems of Linear Equations in Three Variables
Systems of three equations with three variables are often called 3-by-3 systems. In general, to find a single solution to any system of equations,
Presentation transcript:

Lagrange Multipliers By Dr. Julia Arnold Professor of Mathematics Tidewater Community College, Norfolk Campus, Norfolk, VA With Assistance from a CPDP Grant

In this lesson you will Understand the method of Lagrange Multipliers Use Lagrange Multipliers to solve constrained optimization problems Use the method of Lagrange multipliers with two constraints

Understand the method of Lagrange Multipliers Objective 1 Understand the method of Lagrange Multipliers

Fig.13.77

Recall Fig. 13.48

Use Lagrange Multipliers to solve constrained optimization problems Objective 2 Use Lagrange Multipliers to solve constrained optimization problems

Basically, Lagrange Multipliers are another way to think about solving optimization problems with constraints. Lets look at a problem we can solve either way. Problem: Suppose I have 50 feet of fencing for a rectangular shaped garden and want to enclose the maximum area. The usual way we would solve this problem is to look at a picture and put in variables. Next we write the constraint equation 2x + 2y = 50 Last we determine we want to maximize the Area of the Garden whose formula is A = xy y x

Problem: Suppose I have 50 feet of fencing for a rectangular shaped garden and want to enclose the maximum area. 2x + 2y = 50 Constraint A = xy Objective y x We want to get the Area in terms of just x or y so we use the constraint to eliminate one or the other. 2y=50-2x Y = 25-x A = x (25-x)=25x – x2 A’ = 25 – 2x 0= 25 – 2x X = 12.5 and y = 12.5

Now we will use the method of Lagrange Multipliers to Solve the same problem. 2x + 2y = 50 Constraint A = xy Objective f(x,y)=xy is the objective equation and g(x,y)=2x +2y is the constraint equation. Find

Now let’s look at a problem that might be difficult to solve the old way. Problem 2: Find the maximum and minimum values for

Z= The constraint is the red graph. The blue graph and green graph are level curves of the paraboloid. The blue graph is at 1 and the green graph is at which is the exact value for the max. As the paraboloid extends in the z direction it gets wider than the constraint. Z=1

Use the method of Lagrange multipliers with two constraints Objective 3 Use the method of Lagrange multipliers with two constraints

Suppose we want to find the max and min values of f(x,y,z) subject to two constraints of the form g(x,y,z)=p and h(x,y,z)= q. Geometrically, this means that we are looking for the extreme values of f when (x,y,z) is restricted to lie on the curve of intersection of the level surfaces g and h. It can be shown that if an extreme value occurs at , then the gradient vector is in the plane determined by and . We assume these gradient vectors are not 0 or parallel and thus there are numbers (Lagrange multipliers) such that

Problem: Maximize f(x,y,z) = xyz subject to the two constraints

Solved eq 2 for mu Solved eq 3 for lambda Substituted into eq 1 for mu and lambda.

Continued

Check it out. http://www.youtube.com/watch?v=ry9cgNx1QV8 I found this very interesting website written by a student who is sharing his talents with everyone. The topic is Lagrange Multipliers. Check it out. http://www.youtube.com/watch?v=ry9cgNx1QV8 His method is slightly different from the way your text presented it. Are they equivalent?