Interactive · 3 questions
Optimization is the process of extremizing continuous functions. Assume the following sample function.
We want to find the maximum of this.
The brute-force approach to this is to evaluate the function at every possible point and find the lowest number, but there are infinitely many points, which would make this task hard. We need to find some candidate points.
A continuous function will extremize when it has become so extremized it stops changing, whenever its derivative is equal to .
How many points are extremized on ?
This tells us that we have extreme values at and , but we need to determine whether these are local maxima or minima.
If a point is a local maximum, around that point the function will go up and then go down. If it is a local minimum, the function goes down and then goes up (look at the graph). What we now need to do is figure out where the derivative is positive and negative.
This makes the two square root... roots local maxima, and the zero root a local minimum.
The function goes go from both sides, which means that there should be an absolute maximum. Out of all of the local maxima that exist, the largest of those is the absolute maximum.
The absolute maximum of is .
How about a real world one?
We have 100 blocks of wood to build a rectangular... fence. What is the maximum area we can get?
We can get two equations out of this: a constraint and an area. Assume and are side lengths, and we want to extremize the area .
We can handily express the second equation in terms of , so we can get the first one in terms of only .
Now we have to find the derivative, find candidate points, determine whether they're maxima or minima, and finally find the absolute maximum area possible.
What are the dimensions of that fence?