Read · 2 min
Optimization on open or unbounded intervals is almost exactly the same as optimization on closed intervals.
Suppose that we have a function which we would like to optimize (maximize, minimize, take your pick) over some open or unbounded interval.
The first step is to find the critical numbers. These are all numbers such that or is undefined.
Now, to find the relative maxima and minima, one may use any of the tests that we are familiar with, such as simply charting the values of to see where it is positive or negative, or the second derivative test.
However, we are interested in the absolute extrema, and this is going to require simply checking the values in the general case. Check the value of at all critical numbers plus the boundary cases! If the function is unbounded on one or both sides, check the value of the function "at infinity." That is, compute or .
Out of all of these values, you should find a maximum and a minimum value. If one or both of these values are at the boundaries (or at infinity), you should discard them and say that there is no maximum/minimum value. This is because the interval is open, so it does not contain the boundary. However, if the extreme value is one of the critical points, you can declare than as the optimum value on the interval.
Here is an example: compute the extreme values of on the open interval .
First, we find the critical points. Since is a polynomial, the derivative is always defined: Compute the value of at the critical points and at the boundaries: The maximum value is , at . But this is a boundary value, so we discard it. Thus, there is no maximum value on this interval, although we may obtain values arbitrarily close to .
The minimum value is , at . We discard because it is a boundary, but we are still left with one value of at which achieves its minimum. Thus, the minimum value is , at .

