Maximum and Minimum with Restricted Inputs
Summary: A function may have an obvious maximum or minimum, but a TMUA problem may restrict which inputs are allowed. The maximum or minimum must be found using only those allowed inputs.
Consider .
Over all real values of , the graph has its minimum at .
Now compare two different restrictions on .
For , the vertex is allowed, so it gives the minimum.
For , the vertex is not allowed. The minimum occurs at the endpoint .
The formula has not changed. Only the allowed inputs have changed.
So the first question should be:
Which values of am I actually allowed to use?
Find the Allowed Inputs First
A restriction may be given directly, or it may need to be extracted from another condition.
| Given condition | Allowed inputs |
|---|---|
Do this before searching for a maximum or minimum.
A turning point outside the allowed interval cannot give the required maximum or minimum.
First find the allowed inputs. Then optimise only over those inputs.
The restriction does not always apply directly to .
For example, if , then .
So if an expression is rewritten in terms of , only positive values of can be used.
Similarly, if and we define , then .
Any maximum or minimum involving must therefore be found using only this range of values.
The same idea applies whenever a new variable is introduced: first find which values that variable can actually take.
Find the Candidates
Once the allowed interval is known, there are usually only a few points that can give the maximum or minimum.
| Candidate | When should it be checked? |
|---|---|
| Stationary point | It lies inside the allowed interval |
| Sharp turning point | It lies inside the allowed interval |
| Left endpoint | The endpoint is included |
| Right endpoint | The endpoint is included |
A turning point outside the allowed interval is not a candidate.
Sometimes the behaviour of the function makes the comparison even quicker.
| Behaviour throughout the interval | What follows? |
|---|---|
| Increasing | Minimum at the left endpoint; maximum at the right endpoint |
| Decreasing | Maximum at the left endpoint; minimum at the right endpoint |
For a differentiable function on a closed interval, a useful approach is:
| Step | Question |
|---|---|
| 1 | What inputs are allowed? |
| 2 | Which stationary points lie inside the interval? |
| 3 | What are the endpoint values? |
| 4 | Which candidate gives the largest value? |
| 5 | Which candidate gives the smallest value? |
If the graph has a sharp turning point, such as the vertex of a modulus graph, include that point as well.
Stationary Points Are Only Candidates
Consider for .
Differentiating gives .
So the stationary points satisfy , giving .
Both lie inside the allowed interval.
Together with the endpoints, there are four candidates.
| Why check it? | ||
|---|---|---|
| Left endpoint | ||
| Stationary point | ||
| Stationary point | ||
| Right endpoint |
Therefore and .
Finding the stationary points is not enough. Compare every allowed candidate.
Check Whether the Boundary Is Included
A maximum or minimum must actually be reached.
Compare the following two domains for .
| Domain | What happens near ? | Minimum |
|---|---|---|
| is allowed | ||
| Values can approach , but is excluded | No minimum |
For , the function can take values as close to as we like, but it can never equal .
So is a lower bound, but it is not a minimum.
A maximum or minimum must actually be reached.
This distinction is important whenever a problem contains strict inequalities or excludes a boundary point.
When a Parameter Changes the Candidates
A parameter can change which points are available or which point gives the maximum or minimum.
There are two common ways this happens:
- the turning point moves;
- the allowed interval moves.
The important question is always:
As the parameter changes, which candidates are available, and which one gives the required extreme?
A Moving Turning Point
Consider for .
The vertex is at .
| Value of | Position of the vertex | Minimum |
|---|---|---|
| Left of the interval | At | |
| Inside the interval | at | |
| Right of the interval | At |
So are important values because they mark when the vertex enters or leaves the allowed interval.
The maximum requires a different comparison.
When , the maximum occurs at whichever endpoint is farther from .
At the endpoints, and .
These are equal when , which gives .
Therefore:
| Value of | Where is the maximum? |
|---|---|
| Both endpoints | |
Different parameter values matter for different reasons:
- and determine whether the vertex is inside the allowed interval;
- determines which endpoint gives the maximum.
A Moving Allowed Interval
Now consider for .
The function has its unrestricted minimum at .
But the allowed interval now moves as changes.
If , the whole interval lies to the left of .
The allowed point closest to is the right endpoint , so .
If , then is allowed, so .
This happens when .
If , the whole interval lies to the right of .
The allowed point closest to is the left endpoint , so .
Therefore
The graph of shows clearly what happens as the allowed interval moves.
For , the moving interval contains .
So the minimum remains , which produces the flat part of the graph.
When or , the interval no longer contains .
The minimum is then determined by the endpoint closest to , and the minimum value increases as the interval moves farther away.
So the graph makes the change in candidates visible:
but
The function itself has not changed. The allowed interval has moved, and this creates a new function .
More generally, in parameter questions look for values where:
- a turning point enters or leaves the allowed interval;
- an endpoint passes a turning point;
- two candidate values become equal;
- a different candidate begins to give the maximum or minimum.
These values often mark where the formula for the extreme value changes.
Optimising a Maximum or Minimum
Sometimes finding the maximum or minimum is only the first stage of the problem.
For each value of a parameter, we may first obtain a maximum or minimum.
That extreme value is then itself a function of the parameter.
For example, we might call it for a maximum, or for a minimum.
The problem may then ask how large or small this new quantity can be.
The important idea is:
This same method works whether the question asks for:
- the smallest possible maximum;
- the largest possible maximum;
- the smallest possible minimum;
- the largest possible minimum.
There is no need to learn four separate methods.
First Find the Extreme for Each Parameter Value
Return to , with .
For a fixed value of , the maximum occurs at whichever endpoint is farther from .
At the endpoints, and .
For , the farther endpoint is , so .
For , the farther endpoint is , so .
Therefore
The first stage is complete.
Seeing the Extreme Value as a New Graph
The original function was a function of .
The new function records the maximum value obtained for each value of .
For every value of , the height of this graph is the maximum value of the original function.
Now we can optimise the new graph.
Its lowest point occurs at , where .
Therefore the smallest possible maximum is .
The largest values occur at the ends of the parameter range: .
Therefore the largest possible maximum is .
So the two stages can be viewed as
The same idea applies if the first stage gives a minimum rather than a maximum.
Do not try to optimise everything at once. First find the required maximum or minimum for each parameter value. Then optimise those extreme values.
The second stage also needs the usual boundary check.
If the allowed range of the parameter has an excluded endpoint, the new function or may approach a value without ever reaching it.
What Should You Look For?
When the first-stage extreme depends on a parameter, important parameter values often occur when:
- the point giving the extreme changes;
- two competing candidate values become equal;
- a stationary or turning point enters or leaves the allowed region;
- the parameter reaches an endpoint of its own allowed range.
These are the natural places to check when optimising the extreme value itself.
When an Extreme Value Becomes a Condition
Sometimes the question does not ask you to optimise or .
Instead, it tells you that the extreme value must satisfy a condition.
Return again to , where .
We already know that
Suppose the maximum is required to satisfy .
The graph gives a useful picture of the condition.
We want the part of the graph at or below the level .
The graph meets this level at .
So the graph suggests .
Now confirm this algebraically.
For , we need .
Since is positive in this range, , so .
Together with the case condition, .
For , we need , so .
Together with the case condition, .
Combining the two cases gives
The structure is
This works with conditions such as .
If the extreme value has different formulas in different cases, there is one final check:
After solving a case, keep only the parameter values that actually belong to that case.
For example, a solution obtained from the formula for cannot be used if it gives .
The graph helps show the structure, while the algebra confirms the exact answer.
Worked Example
For real satisfying , let .
Find the difference between the maximum and minimum values of .
Solution
First find the allowed inputs.
Since , the condition gives .
Now rewrite the function as .
The vertex occurs at , which lies inside the allowed interval.
The candidates are therefore:
| Why check it? | ||
|---|---|---|
| Left endpoint | ||
| Vertex | ||
| Right endpoint |
Hence and .
Therefore the required difference is .
The key step was finding the allowed interval first. Without the restriction , the optimisation problem would be different.
Practical Approach
For a maximum or minimum problem with restricted inputs:
| Step | Action |
|---|---|
| 1 | Find the allowed inputs. |
| 2 | Find stationary points, turning points and included endpoints. |
| 3 | Evaluate the function at the candidates. |
| 4 | Check that the claimed maximum or minimum is actually reached. |
| 5 | If a parameter is present, identify where the available or winning candidate changes. |
| 6 | If this creates a new extreme-value function such as or , write it down clearly, often piecewise. |
| 7 | If the extreme value itself must be optimised, optimise this new function over the allowed parameter range. |
| 8 | If the extreme value must satisfy a condition, apply the condition and solve for the parameter. |
| 9 | For a piecewise result, check that every solution belongs to the case in which it was found. |
| 10 | Check that any final maximum or minimum is actually attained. |