Chapter 4: Partial Differentiation
Section 4.10: Optimization on Closed Domains
|
Example 4.10.3
|
|
Find the extreme values of the function on the domain consisting of the triangular region whose edges are the -axis, and the lines and .
|
|
|
|
Solution
|
|
|
Mathematical Solution
|
|
•
|
Figure 4.10.3(a) shows that part of the surface defined by for which the support is the domain .
|
•
|
The unconstrained extrema, obtained by solving the equations , is .
|
•
|
Taking the constraints one at a time requires solving three constrained optimization problems, with each side of the triangle being the constraint in each of the three problems.
|
•
|
Figure 4.10.3(b), a graph of , suggests the maximum , and the minimum .
|
•
|
Figure 4.10.3(c), a graph of , suggests the maximum and the minimum .
|
•
|
Figure 4.10.3(d), a graph of , suggests the maximum and the minima .
|
•
|
Taking the constraints two at a time requires finding the values of at the intersection of the edges of the triangle, that is, at the vertices. These values are , , so the absolute minimum is , and the absolute maximum is 17.
|
|
>
|
use plots in
module()
local f,p1,p2,p3;
f:=x^2+y^2-x*y+1;
p1:=plot3d(f,x=0..4,y=x..4, style=patchcontour):
p2:=plot3d(0,x=0..4,y=x..4,color=red):
p3:=display([p1,p2],axes=frame,orientation=[-120,75,0],tickmarks=[5,5,4],labels=[x,y,z],lightmodel=none);
print(p3);
end module:
end use:
|
|
Figure 4.10.3(a) The surface over the triangle
|
|
|
|
|
|
|
Figure 4.10.3(b) Along
|
|
|
|
|
Figure 4.10.3(c) Along
|
|
|
|
|
Figure 4.10.3(d) Along
|
|
|
|
|
|
Each of the three constrained optimization problems obtained when applying the constraints one at a time is a candidate for the Lagrange multiplier method. However, in this example, the simplicity of the three optimization problems that result does not warrant the more elaborate machinery of the Lagrange multiplier approach.
|
|
Maple Solution - Interactive
|
|
Initialize
|
•
|
Context Panel: Assign Function
|
|
|
Solve the unconstrained problem
|
•
|
Calculus palette: Partial-derivative operator
|
•
|
Context Panel: Solve≻Solve
|
|
|
•
|
Context Panel: Evaluate and Display Inline
|
|
=
|
Apply the constraints one at a time
|
•
|
Along (the -axis):
Context Panel: Differentiate≻With Respect To≻
Context Panel: Solve≻Solve
|
|
=
=
|
•
|
Along :
Context Panel: Differentiate≻With Respect To≻
Context Panel: Solve≻Solve
|
|
=
=
|
•
|
Along : Press the Enter key.
|
•
|
Context Panel: Differentiate≻With Respect To≻
|
•
|
Context Panel: Solve≻Solve
|
•
|
Context Panel: Evaluate and Display Inline
|
|
=
|
Take the constraints two at a time, that is, evaluate at the vertices of the triangle
|
=
|
=
|
=
|
|
|
|
|
|
|
|
Maple Solution - Coded
|
|
Initialize
|
•
|
Define the objective function .
|
|
|
Solve the unconstrained optimization problem
|
•
|
Apply the diff command to form the equations , and the solve command to obtain their solution.
|
•
|
Evaluate at the critical point.
|
|
=
|
Apply the constraints one at a time
|
•
|
Along (the -axis):
Apply the solve and diff commands.
|
|
=
=
|
•
|
Along :
Apply the solve and diff commands.
|
|
=
=
|
•
|
Along :
Apply the diff and solve commands to obtain the critical number along this edge.
|
|
=
=
|
Apply the constraints two at a time
|
=
|
=
|
=
|
|
|
|
|
|
|
|
|
<< Previous Example Section 4.10
Next Example >>
© Maplesoft, a division of Waterloo Maple Inc., 2024. All rights reserved. This product is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation.
For more information on Maplesoft products and services, visit www.maplesoft.com
|