

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
How to find the absolute maximum and minimum values of a continuous function defined on a closed and bounded region in the plane using the theorem of the same name. An algorithm to find these values and an example to illustrate the process.
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!
How to Find the Absolute Maximum and the Absolute Minimum Values of a Continuous Function on a Closed and Bounded Region in the Plane
Theorem: Let f (x, y) be a continuous function defined on a closed and bounded region R in the plane. Then f has an absolute maximum and an absolute minimum value on R.
This theorem is the analogue of the following theorem for 1-variable functions:
Theorem: Let f (x) be a continuous function defined on a closed interval of finite length [a, b]. Then f has an absolute maximum and an absolute minimum value on [a, b].
Let us recall how we find these values in the 1-variable case:
How to find the absolute maximum and the absolute minimum values of a continuous function f (x) on a closed interval of finite length [a, b]:
There is a similar algorithm in the 2-variable case:
How to find the absolute maximum and the absolute minimum values of a continuous function f (x, y) on a closed and bounded region R:
Example: Find the the absolute maximum and the absolute minimum values of f (x, y) = x^3 โ xy + y^2 โ x on R = {(x, y) : x โฅ 0 , y โฅ 0 and x + y โค 2 }.
We apply the algorithm:
This is important! If you include points that are not in R in your list, there is no guarantee that the algorithm will give the correct answer.
Side I : We parametrize this side in the obvious way: x = t, y = 0 for 0 โค t โค 2. Then the restrictions of f to Side I is f (t, 0) = t^3 ยท 0 โ t ยท 0 โ 02 โ t = t^3 โ t for 0 โค t โค 2. Now we find the list of points for this 1-variable optimization problem: d/dt(f (t, 0)) = 3t^2 โ 1 = 0 =โ t = 1/
3 or t = โ 1
3, and the endpoints of the interval [0, 2], t = 0 and t = 2. These correspond to the points (x, y) = (1/
(x, y) = (0, 0), and (x, y) = (2, 0).
Side II : This is similar to the previous calculation: f (0, t) = t^2 for 0 โค t โค 2. d/dt(f (0, t)) = 2t = 0 =โ t = 0. This is one of the endpoints, the other one is t = 2, and they correspond to the points (x, y) = (0, 0) and (x, y) = (0, 2) in the plane.
Side III : This time one possible parametrization is x = t, y = 2 โ t for 0 โค t โค 2. This gives f (t, 2 โ t) = t^3 + 2t^2 โ 7 t + 4 for 0 โค t โค 2. Then d/dt(f (t, 2 โ t)) = 3t^2 + 4 t โ 7 = 0 =โ t = 1 or t = โ 7 /3. Again the second solution is not in the interval we are looking at. The first one gives t = 1 =โ (x, y) = (t, 2 โ t) = (1, 1). So our points, including the endpoints, are (x, y) = (1, 1), (x, y) = (2, 0) and (x, y) = (0, 2).
To summarize, we found the points
(0, 0), (2, 0), (0, 2), (1/
in this step. So now the complete list of points we are going to look at is
(2/ 3 , 1 /3), (1/