What Are Optimization Problems?
Optimization problems are word problems that ask you to make some quantity as large or as small as possible. In calculus, you solve them by turning the quantity into a function and finding its highest or lowest point. The largest value is a maximum; the smallest value is a minimum; together they are the extreme values of the function.
Every optimization problem has the same two ingredients:
The objective. The thing you want to make biggest or smallest: an area, a volume, a cost, a distance, a profit. This becomes the function you differentiate.
The constraint. A fixed condition that ties the variables together: a fixed length of fencing, a fixed volume, a fixed budget. This is the equation that lets you rewrite the objective in terms of a single variable.
The geometric idea underneath is simple. At a smooth maximum or minimum, the graph stops rising or falling for an instant, so the tangent line is flat and its slope is zero. Because the derivative measures that slope, the best value hides wherever . Finding these turning points is the same skill covered in maxima and minima and critical points; optimization is where that skill meets a real design question.
How Do You Solve An Optimization Problem Step By Step?
Almost every optimization problem yields to the same six-step workflow. Learn the workflow once and the individual problems stop looking different from each other.
Table: The six-step method for solving an optimization problem.
Step | What you do | Why it matters |
|---|---|---|
1. Draw and name | Sketch the situation and label every unknown with a letter | Turns words into variables you can compute with |
2. Write the objective | Write the quantity to maximise or minimise as a formula | Names the function whose peak or valley you want |
3. Write the constraint | Write the fixed condition as an equation | Gives the relationship that removes a variable |
4. Reduce to one variable | Substitute the constraint so the objective uses a single variable | You can only differentiate a one-variable function |
5. Differentiate and solve | Find , set , solve for the critical points | The maximum or minimum sits where the slope is zero |
6. Verify and answer | Confirm max vs min, check the domain endpoints, state the answer | A critical point alone is not yet the answer |
Two cautions live inside this table. Step 4 is the one students skip: you cannot differentiate an objective that still contains two unknowns, so the constraint must be used to eliminate one of them first. Step 6 is the one students forget: setting finds a candidate, but you still have to confirm it is the kind of extreme value you wanted and read off what the question actually asked for, often the dimensions, not just the maximum value.
What Are Some Worked Optimization Problems?
Each example below runs the full six-step method. Every derivative is verified, and every maximum or minimum is confirmed with the second-derivative test.
Example 1: Maximum area with a fixed length of fencing.
A farmer has metres of fencing and wants to enclose a rectangular field along a straight river. The river forms one side, so only the other three sides need fencing. What dimensions give the maximum area?
Let the two sides perpendicular to the river be and the side parallel to it be . The objective is the area:
The constraint is that the three fenced sides use metres: , so . Substitute to reduce the area to one variable:
Differentiate and set the derivative to zero:
Confirm it is a maximum with the second derivative: , so the curve is concave down and is a maximum. Then , and the domain endpoints and both give zero area, so the turning point wins.
Final answer: the field is , giving a maximum area of .
Example 2: Maximum volume of an open-top box.
A square sheet of cardboard measures inches on each side. You cut a small square of side from each corner and fold the flaps up to make an open-top box. What value of gives the maximum volume?
After cutting, the base is a square of side and the height is . The objective is the volume:
The domain is , since the base side cannot be negative. Differentiate:
Setting gives or . The value collapses the base to zero, so test with the second derivative: , and , a maximum. Both endpoints and give zero volume, confirming the interior peak.
Final answer: cut corners of side inches for a maximum volume of .
Example 3: Minimum material for a closed cylindrical can.
A closed cylindrical can must hold a volume of . What radius and height use the least metal, that is, the minimum total surface area?
The objective is the surface area of a closed cylinder (two circular ends plus the curved side):
The constraint is the fixed volume: , so . Substitute to reduce to the single variable :
Differentiate and set to zero:
Confirm a minimum: for every positive , so the curve is concave up and this critical point is a minimum. The height follows from the constraint:
Notice the clean result : the most economical closed can is exactly as tall as it is wide. Since means , the minimum surface area is .
Final answer: radius , height (with ), giving a minimum surface area of about .
Example 4: Minimum material for an open-top storage box.
An open-top box with a square base must hold . Material costs are proportional to surface area, so minimising material means minimising the area of the base plus the four sides. What dimensions cost the least?
Let the base be and the height be . The objective (base plus four sides, no top) is:
The constraint is the fixed volume: , so . Substitute:
Differentiate and set to zero:
Confirm a minimum: , concave up, so is a minimum. Then .
Final answer: a base of and height , using a minimum of of material.
How Do You Confirm A Maximum Or Minimum?
Solving only finds candidates. A flat tangent happens at a peak, at a valley, and sometimes at a plateau that is neither. You must confirm which one you have, and there are two standard ways.
The second-derivative test. Evaluate at the critical point. If the graph is concave down and is a maximum; if the graph is concave up and is a minimum. This is the quickest confirmation when the second derivative is easy to compute, and it is the one used in all four examples above.
The first-derivative test. Check the sign of on either side of the critical point. A change from positive to negative marks a maximum; negative to positive marks a minimum. Use this when the second derivative is awkward.
Neither test is the whole story, because the true maximum or minimum can sit at the edge of the allowed domain rather than at an interior turning point. When the variable is restricted to a closed interval , the closed-interval method (backed by the extreme value theorem) is airtight: evaluate the objective at every critical point and at both endpoints and , then compare. The largest of those values is the absolute maximum and the smallest is the absolute minimum.
In the fencing and open-box examples the endpoints gave zero, so the interior critical point won, but skipping the endpoint check is exactly how a correct derivative still leads to a wrong final answer. This edge-versus-interior comparison is part of the wider toolkit in applications of derivatives.
Why Do Optimization Problems Work?
Optimization works because a smooth curve cannot switch from rising to falling without going flat in between. That flat instant is the whole trick.
A maximum is a hilltop. Just before the peak the function is increasing, so the slope is positive; just after, it is decreasing, so the slope is negative. In between, at the very top, the slope passes through zero. Setting is nothing more than asking "where does the graph stop climbing?"
A minimum is a valley floor. The same argument runs upside down: the slope moves from negative to positive, passing through zero at the lowest point.
Concavity tells the two apart. At a hilltop the curve bends downward, so ; at a valley floor it bends upward, so . The second derivative reads the shape of the bend and names the extreme value.
The constraint step has a geometric meaning too. Every constraint removes one degree of freedom, collapsing a surface of possibilities down to a single curve you can walk along. Optimization is then just finding the highest or lowest point on that one curve. This is why the method feels the same whether the objective is area, volume, or cost: underneath, you are always locating the turning point of a single-variable function.
Who Invented The Method Of Maxima And Minima?
Finding a best value is older than calculus itself. The idea of setting a rate of change to zero to catch a maximum was worked out before Newton and Leibniz built the derivative.
Two more figures shaped the subject:
Johannes Kepler (1571–1630, Germany) studied how to gauge the volume of wine barrels and, in doing so, noticed that near the best proportions the volume barely changes as the shape varies, an early glimpse of the flat tangent at a maximum.
Joseph-Louis Lagrange (1736–1813, France and Italy) extended optimization to problems with constraints that cannot be substituted away, inventing the method of multipliers still used for constrained optimization across engineering and economics today.
Where Are Optimization Problems Used In The Real World?
The same "make it biggest or smallest" question runs through nearly every quantitative field.
Packaging and manufacturing: designing a can, carton, or bottle that holds a required volume with the least material, exactly the cylinder and box problems above, saves money on every unit produced.
Logistics and delivery: routing trucks and scheduling deliveries to minimise total distance, time, or fuel is optimization on a large scale.
Economics and business: a firm maximises profit or minimises cost by setting marginal revenue equal to marginal cost, which is the condition in disguise.
Machine learning: training a model means minimising a loss function, and the algorithm literally follows the slope downhill toward the minimum, a numerical cousin of setting the derivative to zero.
Engineering and architecture: choosing beam dimensions for maximum strength with minimum weight, or shaping a structure to minimise stress, are optimization problems with physical constraints.
One method, find where the rate of change vanishes, quietly decides the shape of a soda can, the route of a delivery van, and the settings of a learning machine.
What Are The Most Common Mistakes With Optimization Problems?
These four errors account for most lost marks on optimization, and each matches a question real students ask on r/calculus, r/learnmath, and university calculus-pitfalls handouts. Most of them are setup errors, not calculus errors.
Differentiating before reducing to one variable.
Where it slips in:
A student writes the objective with two unknowns still in it, such as , and tries to differentiate straight away.
Don't do this:
Do not differentiate a formula that contains more than one variable. There is no single derivative of with respect to one letter while the other floats free.
The correct way:
Use the constraint first to eliminate a variable, turning into , and only then differentiate.
Optimising the constraint instead of the objective.
Where it slips in:
A student differentiates the fixed condition (the perimeter or the volume equation) rather than the quantity the question asks to maximise or minimise.
Don't do this:
Do not set the derivative of the constraint to zero. The constraint is fixed; it never changes, so it has no maximum to find.
The correct way:
Keep the two roles straight: the objective is what you differentiate, the constraint is what you substitute. Label them before you compute.
Ignoring the domain and its endpoints.
Where it slips in:
A student finds an interior critical point and stops, without asking whether the variable is limited to an interval or whether the endpoints give a larger or smaller value.
Don't do this:
Do not assume the critical point is automatically the answer. On a closed interval the extreme value can sit at an endpoint.
The correct way:
State the domain from the physical situation (a length cannot be negative), then compare the critical-point value against the values at both endpoints, as the extreme value theorem requires.
Not answering the actual question.
Where it slips in:
A student solves , gets , and writes that as the final answer, when the question asked for the maximum volume or the full dimensions.
Don't do this:
Do not stop at the critical value of . That number is usually an input, not the quantity being optimised.
The correct way:
Substitute the critical value back to report exactly what was asked: the maximum volume , or the dimensions in full. Re-read the final sentence of the problem before writing your answer.
Practice Problems On Optimization Problems
Work each one with the six-step method, then check against the answer. Every answer is verified.
Find two positive numbers whose sum is and whose product is a maximum.
(Answer: both numbers are ; maximum product .)A rectangle has a fixed perimeter of m. What dimensions give the maximum area?
(Answer: a square; maximum area .)An open-top box is made by cutting equal corner squares of side from an inch sheet. Find for maximum volume.
(Answer: in; maximum volume .)A rectangle of fixed area is to be fenced. What dimensions use the least fencing?
(Answer: a square; minimum perimeter m.)A closed cylinder must hold . Find the radius that minimises surface area.
(Answer: , with .)A rectangular field beside a river is fenced on three sides with m of fencing. Find the dimensions of maximum area.
(Answer: along the river by deep; maximum area .)
Where Should You Go Next After Optimization Problems?
Optimization pulls together several derivative skills, and each of these is a natural next door.
Maxima and minima. Go deeper on the turning-point theory that every optimization problem rests on, including local versus absolute extremes.
Second-derivative test. Master the concavity check that confirms whether a critical point is the maximum or the minimum you wanted.
Related rates. The other great applied-derivative topic, where a constraint links quantities that change together over time.
If your child is meeting applied max-and-min problems for the first time, a live Bhanzu trainer teaches optimization from the setup up, so the word problem stops being the hard part, in the Bhanzu math program.
Was this article helpful?
Your feedback helps us write better content
