Lagrange Multipliers
We are going to take a look at another way of optimizing a function subject to given constraint(s). The constraint(s) may be the equation(s) that describe the boundary of a region although in this section we won’t concentrate on those types of problems since this method just requires a general constraint and doesn’t really care where the constraint came from. We want to optimize ( i.e. find the minimum and maximum value of) a function, f ( x , y , z ) f ( x , y , z ) , subject to the constraint g ( x , y , z ) = k g ( x , y , z ) = k . Again, the constraint may be the equation that describes the boundary of a region or it may not be. The process is actually fairly simple, although the work can still be a little overwhelming at times. Notice that the system of equations from the method actually has four equations, we just wrote the system in a simpler form. To see this let’s take the first equation and put in the definition of the gradient vector to see what we get. ⟨ f...