Scribe logoScribeNotes & practice
Sign inStart free
  1. Notes
  2. ›AP Calculus AB
  3. ›5 Analytical Applications of Differentiation
  4. ›5.10 Introduction to optimization

AP Calculus AB · Unit 5 · Analytical Applications of Differentiation

5.10 Introduction to optimization

Identify optimization situations, model the target quantity, and outline how to find and check an optimum.

  • 3 min read
  • 4 parts
  • 10 questions
  • Draft
Start a Quick 5 on this topic→Jump to the 10 questions
1/4Optimization asks for the best value under a constraint
  1. 1Optimization asks for the best value under a constraint
  2. 2A constraint connects the variables in the objective
  3. 3Derivatives locate candidates, but context determines the answer
  4. 4A fencing model shows the complete optimization setup
  5. Check your recall
  6. Practice: 10 questions
1

Part 1 of 4: Optimization asks for the best value under a constraint

An optimization problem asks for the largest or smallest possible value of a quantity. The objective is the quantity being maximized or minimized. A store might seek maximum revenue, while a builder might seek minimum material use. These situations also have limits. A fixed budget, amount of fencing, or available time restricts the choices.

First, name the decision you can change. Then state what counts as the best outcome. For example, a gardener can change a rectangle’s dimensions but has a fixed length of fencing. The goal might be the greatest enclosed area. Without the fencing limit, the area could grow without bound.

Key terms · tap one for its definition

optimization problem

An optimization problem seeks the greatest or least feasible value of a quantity.

objective

The objective is the quantity whose value an optimization problem seeks to maximize or minimize.

Part 1 done

2

Part 2 of 4: A constraint connects the variables in the objective

Use variables for the changing quantities, including units. Write an equation for the objective before differentiating. A constraint expresses the fixed condition and connects those variables. Use it to rewrite the objective as a function of one variable. Then find the feasible domain: values that make sense in the situation.

For a rectangular enclosure, let its side lengths be xxx and yyy meters. Its area is A=xyA=xyA=xy, while 40 meters of fencing gives 2x+2y=402x+2y=402x+2y=40. Thus y=20−xy=20-xy=20−x and A(x)=x(20−x)A(x)=x(20-x)A(x)=x(20−x). Positive side lengths require 0<x<200<x<200<x<20. If zero area is allowed, the limiting cases x=0x=0x=0 and x=20x=20x=20 can also be considered.

Figure 1. The fixed perimeter connects the two side lengths. Area changes as those lengths change.

Key terms · tap one for its definition

constraint

A constraint is a condition that restricts the values of the variables in a model.

feasible domain

The feasible domain contains the input values allowed by the constraints and the real-world situation.

Part 2 done

Quick check

One question on the part you just read

Easy

A delivery company can vary the number of vehicles it sends out, but it must meet a fixed fuel budget. It wants to serve as many customers as possible. Which quantity is the objective?
Show answer and explanation

Answer: B · Worked explanation

The objective is the quantity the company wants to make as large or as small as possible, so it is the number of customers served. The fuel budget is a constraint because it limits the choices. The number of vehicles and travel distance may affect the outcome, but neither is stated as the target quantity.
3

Part 3 of 4: Derivatives locate candidates, but context determines the answer

Once the objective depends on one variable, differentiate it. An interior optimum can occur where the derivative is zero or undefined. Check those candidates against the domain and any included endpoints. A derivative of zero alone does not prove a maximum or minimum. Compare objective values or use derivative behavior to decide.

Finally, answer the original question with units and a brief interpretation. If the domain excludes an endpoint, do not claim the objective reaches a value there. You may still check what happens as values approach it. This matters when a problem asks for positive lengths, rather than allowing a side of zero.

Common mistake

Do not optimize the constraint instead of the objective. The fencing length is fixed; the enclosed area changes.

Part 3 done

4

Part 4 of 4: A fencing model shows the complete optimization setup

Suppose a gardener has 40 meters of fencing for a rectangle. The objective is to maximize area, not perimeter. The perimeter constraint reduces the area to one variable. Differentiation then gives a candidate, which must be checked before interpreting it.

Worked example

Largest area with fixed fencing

A rectangular enclosure uses all 40 meters of fencing. Find its greatest possible area.
  1. 1
    Let the sides be xxx and yyy meters. Write 2x+2y=402x+2y=402x+2y=40 and A=xyA=xyA=xy.
  2. 2
    Substitute y=20−xy=20-xy=20−x to get A(x)=20x−x2A(x)=20x-x^2A(x)=20x−x2, where 0<x<200<x<200<x<20.
  3. 3
    Differentiate: A′(x)=20−2xA'(x)=20-2xA′(x)=20−2x. Set 20−2x=020-2x=020−2x=0, giving x=10x=10x=10.
  4. 4
    Then y=10y=10y=10. Since A′(x)A'(x)A′(x) changes from positive to negative at x=10x=10x=10, this is a maximum.

Answer: The greatest area is A(10)=10⋅10=100 m2A(10)=10\cdot10=100\,\mathrm{m^2}A(10)=10⋅10=100m2, with sides of 10 meters.

Exam tip

State the quantity being optimized, the constraint, and the feasible domain. Give the final result in the units requested.

Note read

Check your recall[14 marks]

5 written questions. Answer each one in your head or on paper, then open the mark scheme.

  1. 1.Identify[2 marks]

    Identify the objective and constraint when a store seeks maximum revenue within a fixed advertising budget.

    Show mark schemeHide mark scheme

    Model answer

    The objective is revenue, which the store wants to maximize. The advertising budget is the constraint.

    • 1 mark for identifying revenue as the quantity to maximize
    • 1 mark for identifying the fixed advertising budget as a constraint
  2. 2.Explain[2 marks]

    Explain why an objective should be written as a function of one variable before differentiating.

    Show mark schemeHide mark scheme

    Model answer

    The constraint connects the variables, so one can be replaced. This gives an objective function whose derivative can locate candidates.

    • 1 mark for explaining that the constraint allows one variable to be substituted
    • 1 mark for explaining that the resulting one-variable function can be differentiated to find candidates
  3. 3.Construct[3 marks]

    Construct an area function and feasible domain for a rectangle made with 40 meters of fencing. Let one side be xxx meters.

    Show mark schemeHide mark scheme

    Model answer

    The other side is 20−x20-x20−x meters, so A(x)=x(20−x)A(x)=x(20-x)A(x)=x(20−x). Both side lengths must be positive, giving 0<x<200<x<200<x<20.

    • 1 mark for using the perimeter constraint to find the other side as 20−x20-x20−x
    • 1 mark for writing A(x)=x(20−x)A(x)=x(20-x)A(x)=x(20−x) or an equivalent expression
    • 1 mark for giving the feasible domain 0<x<200<x<200<x<20
  4. 4.Calculate[4 marks]

    Calculate the greatest area of a rectangle made with 40 meters of fencing.

    Show mark schemeHide mark scheme

    Model answer

    Since A(x)=20x−x2A(x)=20x-x^2A(x)=20x−x2, its derivative is A′(x)=20−2xA'(x)=20-2xA′(x)=20−2x. Setting this to zero gives x=10x=10x=10. The derivative changes from positive to negative there, so the greatest area is A(10)=100 m2A(10)=100\,\mathrm{m^2}A(10)=100m2.

    • 1 mark for writing the one-variable area function A(x)=20x−x2A(x)=20x-x^2A(x)=20x−x2
    • 1 mark for finding A′(x)=20−2xA'(x)=20-2xA′(x)=20−2x and solving A′(x)=0A'(x)=0A′(x)=0 to obtain x=10x=10x=10
    • 1 mark for justifying that the candidate gives a maximum
    • 1 mark for calculating the greatest area as 100 m2100\,\mathrm{m^2}100m2
  5. 5.Explain[3 marks]

    Explain why solving f′(x)=0f'(x)=0f′(x)=0 does not, by itself, finish an optimization problem.

    Show mark schemeHide mark scheme

    Model answer

    It only finds a possible interior optimum. The candidate must satisfy the feasible domain, and its value must be checked against other candidates and included endpoints.

    • 1 mark for stating that a zero derivative identifies only a candidate
    • 1 mark for checking that the candidate lies in the feasible domain
    • 1 mark for comparing candidates and included endpoints, or using derivative behavior to establish the optimum

Practice this topic

10 quick-fire multiple-choice questions, easy to hard. Tap an answer to see if you're right and the worked explanation. (The written questions with mark schemes are under “Check your recall” above.)

0 right0 of 10 answered

Includes the quick check in the note above.

2.

Easy·Identify[1 mark]

A designer wants to minimize the material used to make a box while keeping its volume at 500 cubic centimeters. Which equation represents the constraint?
Show answer and explanation

Answer: C · Worked explanation

The fixed volume condition connects the box's dimensions and restricts the possible designs, so it is the constraint. Minimizing material is the goal, not the constraint. Positive dimensions describe part of the feasible domain, while least surface area is another way to describe the goal rather than the fixed condition.
3.

Easy·State[1 mark]

State what the feasible domain represents in an optimization model.
Show answer and explanation

Answer: C · Worked explanation

The feasible domain consists of input values that satisfy the constraints and make sense in the real-world situation. A derivative equal to zero may identify an interior candidate, but it does not define the whole feasible domain. The objective's output values and the model equations are related ideas, but neither is the set of allowed inputs.
4.

Easy·Identify[1 mark]

A farmer has a fixed length of wire and wants to enclose the greatest possible area. Which statement correctly identifies the objective and the constraint?
Show answer and explanation

Answer: B · Worked explanation

The farmer wants the enclosed area to be as large as possible, making area the objective. The fixed wire length limits the possible side lengths, so it is the constraint. The wire length is not being optimized, and the feasible domain is a set of allowed input values rather than a fixed physical quantity.
5.

Medium·Construct[2 marks]

A poster has a rectangular printed region with width www inches and height hhh inches. Its printed area must be 48 square inches. The designer wants to minimize the printed region's perimeter. Which equations give the objective and constraint?
Show answer and explanation

Answer: A · Worked explanation

The perimeter is the quantity to minimize, so the objective is P=2w+2hP=2w+2hP=2w+2h. The fixed-area requirement is the constraint wh=48wh=48wh=48.
6.

Medium·Determine[2 marks]

A farmer uses 60 meters of fencing to make a rectangle against a straight wall, so fencing is needed for only three sides. If xxx is the width perpendicular to the wall and yyy is the side parallel to it, which one-variable area model follows from the fencing constraint?
Show answer and explanation

Answer: C · Worked explanation

The fencing constraint is 2x+y=602x+y=602x+y=60, so y=60−2xy=60-2xy=60−2x. Substituting this into the area objective A=xyA=xyA=xy gives A(x)=x(60−2x)A(x)=x(60-2x)A(x)=x(60−2x). The alternative y=60−xy=60-xy=60−x would incorrectly count only one width, while multiplying by an extra factor of 2 does not represent the rectangle's area.
7.

Medium·Determine[2 marks]

An open-top box is made by cutting equal squares of side length xxx from the corners of a 20-inch by 12-inch sheet and folding up the sides. Which expression gives the box's volume as an objective in terms of xxx?
Show answer and explanation

Answer: A · Worked explanation

After the corner squares are removed, the box height is xxx, and its base dimensions are 20−2x20-2x20−2x and 12−2x12-2x12−2x. Multiplying these three dimensions gives V(x)=x(20−2x)(12−2x)V(x)=x(20-2x)(12-2x)V(x)=x(20−2x)(12−2x). Using only one xxx subtraction from each base side misses the cuts at both ends, and the final expression without the height describes base area, not volume.
8.

Medium·Outline[2 marks]

A model has objective Q(x)Q(x)Q(x) on a feasible interval. Which sequence best outlines a sound optimization process?
Show answer and explanation

Answer: C · Worked explanation

A constraint lets the objective be expressed using one variable, after which derivatives can locate interior candidates. The candidates must be checked against the feasible domain and any included endpoints, and the result must be interpreted in context. A zero derivative does not automatically establish a maximum, and the constraint itself is not the quantity being optimized.
9.

Medium·Explain[2 marks]

A company models profit as a differentiable function P(x)P(x)P(x) for production levels 0≤x≤500\le x\le500≤x≤50. Why should it consider feasible endpoints as well as values where P′(x)=0P'(x)=0P′(x)=0?
Show answer and explanation

Answer: D · Worked explanation

Derivative-zero values are possible interior optima, but a maximum can also occur at either included endpoint, 0 or 50. Endpoints are not guaranteed to be best, and negative production is outside the stated domain.
10.

Hard·Deduce[2 marks]

A rectangular garden must have positive side lengths and a fixed perimeter of 32 meters. Let one side be xxx meters, so its area is A(x)=x(16−x)A(x)=x(16-x)A(x)=x(16−x) for 0<x<160<x<160<x<16. A student finds A′(x)=0A'(x)=0A′(x)=0 at x=8x=8x=8. Which conclusion is justified by the model and derivative behavior?
Show answer and explanation

Answer: B · Worked explanation

Since A′(x)=16−2xA'(x)=16-2xA′(x)=16−2x, the area increases for x<8x<8x<8 and decreases for x>8x>8x>8, so x=8x=8x=8 gives an interior maximum. The other side is also 8 meters, giving A=8⋅8=64A=8\cdot8=64A=8⋅8=64 square meters. The endpoint x=16x=16x=16 is excluded and would give zero area anyway; the perimeter is not the area.

Keep going

Next topic5.11 Solving optimization problemsPrevious topic5.9 Connecting f, f' and f''

More in Unit 5 · Analytical Applications of Differentiation

  1. 5.4First derivative testNotes · 10 questions
  2. 5.5Candidates testNotes · 10 questions
  3. 5.6ConcavityNotes · 10 questions
  4. 5.7Second derivative testNotes · 10 questions
  5. 5.8Sketching functions and their derivativesNotes · 10 questions
  6. 5.9Connecting f, f' and f''Notes · 10 questions
  7. 5.10Introduction to optimizationNotes · 10 questions
  8. 5.11Solving optimization problemsNotes · 10 questions
  9. 5.12Behaviour of implicit relationsNotes · 10 questions

All AP Calculus AB topics →

Draft: written by Scribe and checked automatically, not yet by a subject reviewer.

Practice questions are original, written by Scribe and checked automatically for correctness.

Topic codes follow the official numbering. Not endorsed by College Board or any exam board.

On this page

0/4 read

  1. 1Optimization asks for the best value under a constraint
  2. 2A constraint connects the variables in the objective
  3. 3Derivatives locate candidates, but context determines the answer
  4. 4A fencing model shows the complete optimization setup
  5. Check your recall
  6. Practice: 10 questions
All coursesScribeHow it worksPricingPrivacyTerms

Notes and questions are written by Scribe in our own words. Topic codes follow the official course numbering so you can find your place. Not produced or endorsed by the IB, College Board, AQA, OCR, Pearson Edexcel or any exam board.

© 2026 Scribe