Calculus I · Unit 2B · lesson
The Anatomy of an Optimization Problem
Learning objectives
Identify the four essential ingredients of a one-variable optimization model.
A critical number is not the final answer
Optimization has two layers. Calculus finds candidates where local improvement stops; the model decides which candidates are feasible and whether endpoints or boundaries do better. Every final answer must return to the original variables and constraints.
Objective, Constraint, Feasible Domain, and Verification
Before the formulas
In The Anatomy of an Optimization Problem, the derivative locates where improvement stops locally, but the surrounding analysis establishes whether the result is a maximum, minimum, or neither. Closed intervals require endpoint comparison; open or unbounded domains may require limits and model-specific reasoning.
Keep the objective function visible throughout the solution. Students often optimize an intermediate constraint expression by accident. A final sentence should name the optimized quantity and its value, then give the corresponding design or decision variables.
The difficult step is reducing the situation to one variable
A diagram often contains several dimensions, but the constraint links them. Solve the constraint for one variable and substitute into the objective. This produces a one-variable function whose domain comes from the original geometry or context.
Writing the domain before differentiating protects against extraneous critical points and clarifies whether endpoints must be tested.
Every optimization problem has an objective to maximize or minimize and constraints that limit what choices are possible. The constraint is used to rewrite the objective in one variable. The feasible domain then determines which critical numbers and endpoints are physically allowed.
Four ingredients
• Objective. The quantity being maximized or minimized. • Constraint. The relationship among the variables. • Feasible domain. Values that satisfy geometry, units, and the real situation. • Verification. A sign test, second-derivative argument, endpoint comparison, or convexity argument showing that the candidate is the requested optimum.
optimization-anatomy-01A rectangle has perimeter and should have maximum area. Name the objective and constraint.
Your work stays on this device. No account or AI grader is used.
Show hint
The objective is what is maximized; the constraint is the fixed relationship.
Attempt once to unlock the solution
Submit an answer first. The hint is available now.
After the explanation
Use the section idea
Separate the objective from the constraint, reduce to one feasible variable, and interpret the winning candidate in the original design.
Optimization is a modeling problem first: the derivative only compares candidates after the geometry, units, and feasible domain are correct.
Write variables and units, identify the objective, use the constraint to eliminate a variable, then test critical and boundary candidates.
Optimizing the constraint, ignoring the feasible domain, or keeping an algebraic critical point that cannot exist in the real design.
Have you compared every feasible candidate and explained why the result is physically and economically reasonable?
Practice this skill
Continue
Use one focused companion
Source & rights
Original instruction with traceable references.
BetterGrades-original composition declared by source handoff; owner provenance review required before public release
Reference textbooks remain rights-separated and are not published as application assets. Any direct adaptation requires separate identification and attribution.