Study guide
5.5 Applied Optimization Problems
CLEP Calculus Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Introduction & Exam Overview
1.1 About the CLEP Calculus Exam
2 Chapter 2: Limits and Continuity
2.1 Limit Concepts and Limit Laws 2.2 Algebraic Evaluation of Limits & Indeterminate Forms 2.3 Limits Involving Infinity and Asymptotes 2.4 Continuity and the Intermediate Value Theorem
3 Chapter 3: Foundations of Derivatives
3.1 The Derivative Definition and Rates of Change 3.2 Basic Differentiation Rules & Rectilinear Motion 3.3 The Product and Quotient Rules 3.4 Derivatives of Trigonometric Functions
4 Chapter 4: Advanced Differentiation Techniques
4.1 The Chain Rule 4.2 Derivatives of Exponential & Logarithmic Functions 4.3 Derivatives of Inverse Trigonometric Functions 4.4 Derivatives of Inverse Functions 4.5 Implicit Differentiation 4.6 L'Hôpital's Rule and Indeterminate Forms
5 Chapter 5: Applications of Differential Calculus
5.1 Tangent Lines, Normal Lines & Linear Approximation 5.2 Rolle's Theorem & The Mean Value Theorem 5.3 Curve Analysis & The First Derivative Test 5.4 Concavity and the Second Derivative Test 5.5 Applied Optimization Problems 5.6 Related Rates of Change
6 Chapter 6: Foundations of Integral Calculus
6.1 Antiderivatives and Indefinite Integrals 6.2 Integration by Substitution (Indefinite) 6.3 Riemann Sums and the Definite Integral 6.4 Properties of the Definite Integral
7 Chapter 7: Fundamental Theorem of Calculus & Net Change
7.1 The Fundamental Theorem of Calculus 7.2 Definite Integrals via Substitution 7.3 The Net Change Theorem & Rectilinear Particle Motion
8 Chapter 8: Applications of Integrals & Differential Equations
8.1 Area Between Curves 8.2 Volumes of Solids of Revolution 8.3 Average Value of a Function & The Mean Value Theorem for Integrals 8.4 Separable Differential Equations & Growth/Decay Models
5.5 Applied Optimization Problems
Key Takeaways Explain This Topic AI
Applied optimization translates real-world geometric, physical, or economic constraints into an objective function f(x) of a single independent variable to find an absolute maximum or minimum.
The feasible domain is strictly bounded by physical limitations (e.g. dimensions > 0, cutout sizes < half the total sheet width).
Classic geometric archetypes include the open-top cutout box (V = x(L - 2x)(W - 2x)), the fenced corral enclosure, and the optimal cylinder (where minimum surface area for fixed volume always occurs when height equals diameter, h = 2r).
In distance optimization problems, minimizing squared distance S(x) = d^2 eliminates radicals and substantially simplifies algebraic differentiation while preserving identical critical numbers.
In economic models, maximum profit occurs where Marginal Revenue equals Marginal Cost (MR = MC), and minimum average cost occurs where Marginal Cost equals Average Cost (MC = C_avg).
Last updated: August 2026
5.5 Applied Optimization Problems
Core CLEP Concept: Applied optimization represents one of the most practical and heavily weighted problem categories on the CLEP Calculus examination. The goal is to maximize desirable quantities (such as enclosed area, box volume, or business profit) or minimize undesirable quantities (such as material surface area, construction cost, or physical travel time) subject to explicit geometric and algebraic constraints.
1. The 6-Step Master Optimization Framework
Every applied optimization problem on the CLEP exam—regardless of whether it involves cardboard boxes, fencing wire, or corporate pricing—can be resolved through this systematic protocol. 6-Step Master Optimization Strategy
- │
- 1. Read & Sketch Diagram ──────────────┼───> Draw figure and label all constant & variable terms
- 2. Formulate Objective Function ───────┼───> Equation for quantity to maximize/minimize: Q = f(x, y)
- 3. Formulate Constraint Equation ──────┼───> Geometric/physical relationship: g(x, y) = Constant
- 4. Reduce to Single Variable ──────────┼───> Solve constraint for y and substitute: Q(x)
- 5. Establish Feasible Domain ──────────┼───> Physical bounds: a ≤ x ≤ b or (0, ∞)
- 6. Differentiate, Solve & Justify ─────┴───> Find Q'(x) = 0 and justify absolute extremum (EVT or 2nd Deriv)
- Detailed Breakdown of the Steps
Read & Sketch: Draw a clear geometric diagram. Assign algebraic variables to unknown quantities and record all numerical constants.
Identify the Objective Function: Formulate the primary formula representing the quantity Q Q Q to be maximized or minimized (e.g., Area A = x y A = xy A = x y , Volume V = l w h V = lwh V = lw h , Cost C = 2 x + 5 y C = 2x + 5y C = 2 x + 5 y , Profit P = R − C P = R - C P = R − C ).
Identify the Constraint Equation: Formulate the secondary equation connecting the variables based on given limitations (e.g., fixed perimeter 2 x + 2 y = 100 2x + 2y = 100 2 x + 2 y = 100 , fixed volume π r 2 h = 500 \pi r^2 h = 500 π r 2 h = 500 ).
Reduce to a Single Variable: Solve the constraint equation for one variable (e.g., y = 50 − x y = 50 - x y = 50 − x ) and substitute into the objective function to obtain Q ( x ) Q(x) Q ( x ) .
Determine the Feasible Domain: Determine the allowable physical interval for x x x . (Dimensions cannot be negative; cutouts cannot exceed total material dimensions).
Differentiate, Solve & Rigorously Justify: Compute Q ′ ( x ) Q'(x) Q ′ ( x ) , set Q ′ ( x ) = 0 Q'(x) = 0 Q ′ ( x ) = 0 , and find critical numbers. Prove the extremum is global using the Closed Interval Method (if domain is [ a , b ] [a, b] [ a , b ] ) or the First/Second Derivative Test (if domain is open ( 0 , ∞ ) (0, \infty) ( 0 , ∞ ) ).
- 2. Core Archetype 1: Geometric Enclosures & Cutouts
- Archetype A: The Open-Top Cardboard Box
Problem: A rectangular sheet of cardboard measures 24 inches 24\text{ inches} 24 inches by 15 inches 15\text{ inches} 15 inches . Equal squares of side length x x x are cut from each of the four corners, and the remaining flaps are folded upward to form an open-top box. Find the value of x x x that maximizes the volume of the box. +---------+-----------------------+---------+
- | x | x | | x | x |
- | - - + - - - - + - - |
- | x | x | | x | x |
- 15 +---------+ +---------+
- | | | | Fold along dashed lines
- | | Base of Box | | Height = x
- | | (24 - 2x) by (15 - 2x)| | Length = 24 - 2x
- 15 +---------+ +---------+ Width = 15 - 2x
- | x | x | | x | x |
- | - - + - - - - + - - |
- | x | x | | x | x |
- +---------+-----------------------+---------+
- 24
Objective Function: V = length × width × height = ( 24 − 2 x ) ( 15 − 2 x ) ( x ) V = \text{length} \times \text{width} \times \text{height} = (24 - 2x)(15 - 2x)(x) V = length × width × height = ( 24 − 2 x ) ( 15 − 2 x ) ( x ) .
Expand algebraically: V ( x ) = x ( 360 − 48 x − 30 x + 4 x 2 ) = x ( 4 x 2 − 78 x + 360 ) = 4 x 3 − 78 x 2 + 360 x V(x) = x(360 - 48x - 30x + 4x^2) = x(4x^2 - 78x + 360) = 4x^3 - 78x^2 + 360x V ( x ) = x ( 360 − 48 x − 30 x + 4 x 2 ) = x ( 4 x 2 − 78 x + 360 ) = 4 x 3 − 78 x 2 + 360 x
Feasible Domain: Height must be positive ( x > 0 x > 0 x > 0 ), and width must be positive ( 15 − 2 x > 0 ⟹ x < 7.5 15 - 2x > 0 \implies x < 7.5 15 − 2 x > 0 ⟹ x < 7.5 ). Thus, domain is [ 0 , 7.5 ] [0, 7.5] [ 0 , 7.5 ] . (At x = 0 x = 0 x = 0 or x = 7.5 x = 7.5 x = 7.5 , V = 0 V = 0 V = 0 ).
Differentiate and set V ′ ( x ) = 0 V'(x) = 0 V ′ ( x ) = 0 : V ′ ( x ) = 12 x 2 − 156 x + 360 = 0 V'(x) = 12x^2 - 156x + 360 = 0 V ′ ( x ) = 12 x 2 − 156 x + 360 = 0 Divide by 12 12 12 : x 2 − 13 x + 30 = 0 ⟹ ( x − 3 ) ( x − 10 ) = 0 x^2 - 13x + 30 = 0 \implies (x - 3)(x - 10) = 0 x 2 − 13 x + 30 = 0 ⟹ ( x − 3 ) ( x − 10 ) = 0
Evaluate critical numbers:
x = 10 x = 10 x = 10 is outside the feasible domain [ 0 , 7.5 ] [0, 7.5] [ 0 , 7.5 ] (rejected).
x = 3 x = 3 x = 3 is inside the feasible domain .
Justify Maximum: Using the Second Derivative Test: V ′ ′ ( x ) = 24 x − 156 ⟹ V ′ ′ ( 3 ) = 24 ( 3 ) − 156 = 72 − 156 = − 84 < 0 V''(x) = 24x - 156 \implies V''(3) = 24(3) - 156 = 72 - 156 = -84 < 0 V ′′ ( x ) = 24 x − 156 ⟹ V ′′ ( 3 ) = 24 ( 3 ) − 156 = 72 − 156 = − 84 < 0 (Concave down ⟹ \implies ⟹ Absolute Maximum). Optimal Cutout: x = 3 inches ( V max = ( 18 ) ( 9 ) ( 3 ) = 486 in 3 ) \text{Optimal Cutout: } x = 3\text{ inches} \quad (V_{\text{max}} = (18)(9)(3) = 486\text{ in}^3) Optimal Cutout: x = 3 inches ( V max = ( 18 ) ( 9 ) ( 3 ) = 486 in 3 )
Archetype B: The Optimal Cylindrical Container
Problem: A closed cylindrical beverage can is designed to hold a fixed volume of V 0 = 16 π cm 3 V_0 = 16\pi\text{ cm}^3 V 0 = 16 π cm 3 . Find the dimensions (radius r r r and height h h h ) that minimize the total surface area of metal required.
Objective Function: Total Surface Area A = 2 π r 2 + 2 π r h A = 2\pi r^2 + 2\pi r h A = 2 π r 2 + 2 π r h (two circular ends + side wall).
Constraint Equation: Volume V 0 = π r 2 h = 16 π ⟹ h = 16 π π r 2 = 16 r 2 V_0 = \pi r^2 h = 16\pi \implies h = \frac{16\pi}{\pi r^2} = \frac{16}{r^2} V 0 = π r 2 h = 16 π ⟹ h = π r 2 16 π = r 2 16 .
Express A A A in terms of r r r alone: A ( r ) = 2 π r 2 + 2 π r ( 16 r 2 ) = 2 π r 2 + 32 π r = 2 π r 2 + 32 π r − 1 , r ∈ ( 0 , ∞ ) A(r) = 2\pi r^2 + 2\pi r \left(\frac{16}{r^2}\right) = 2\pi r^2 + \frac{32\pi}{r} = 2\pi r^2 + 32\pi r^{-1}, \quad r \in (0, \infty) A ( r ) = 2 π r 2 + 2 π r ( r 2 16 ) = 2 π r 2 + r 32 π = 2 π r 2 + 32 π r − 1 , r ∈ ( 0 , ∞ )
Differentiate and find critical numbers: A ′ ( r ) = 4 π r − 32 π r − 2 = 4 π r − 32 π r 2 = 0 A'(r) = 4\pi r - 32\pi r^{-2} = 4\pi r - \frac{32\pi}{r^2} = 0 A ′ ( r ) = 4 π r − 32 π r − 2 = 4 π r − r 2 32 π = 0 4 π r = 32 π r 2 ⟹ 4 π r 3 = 32 π ⟹ r 3 = 8 ⟹ r = 2 cm 4\pi r = \frac{32\pi}{r^2} \implies 4\pi r^3 = 32\pi \implies r^3 = 8 \implies r = 2\text{ cm} 4 π r = r 2 32 π ⟹ 4 π r 3 = 32 π ⟹ r 3 = 8 ⟹ r = 2 cm
Find optimal height: h = 16 r 2 = 16 ( 2 ) 2 = 16 4 = 4 cm h = \frac{16}{r^2} = \frac{16}{(2)^2} = \frac{16}{4} = 4\text{ cm} h = r 2 16 = ( 2 ) 2 16 = 4 16 = 4 cm
Universal Proportionality Principle: Notice that h = 4 = 2 ( 2 ) = 2 r h = 4 = 2(2) = 2r h = 4 = 2 ( 2 ) = 2 r . For any closed cylinder with fixed volume, material surface area is minimized when the height equals the diameter ( h = 2 r h = 2r h = 2 r ) .
3. Core Archetype 2: Distance Minimization
Finding the point ( x , y ) (x, y) ( x , y ) on a specified curve y = f ( x ) y = f(x) y = f ( x ) that is closest to a given external point ( x 0 , y 0 ) (x_0, y_0) ( x 0 , y 0 ) is a classic CLEP archetype.
The Squared Distance Simplification Rule
The Euclidean distance formula between ( x , y ) (x, y) ( x , y ) and ( x 0 , y 0 ) (x_0, y_0) ( x 0 , y 0 ) is: d = ( x − x 0 ) 2 + ( y − y 0 ) 2 d = \sqrt{(x - x_0)^2 + (y - y_0)^2} d = ( x − x 0 ) 2 + ( y − y 0 ) 2
Calculus Simplification Rule: Because distance d ≥ 0 d \ge 0 d ≥ 0 , minimizing d d d is mathematically identical to minimizing the squared distance : S ( x ) = d 2 = ( x − x 0 ) 2 + [ f ( x ) − y 0 ] 2 S(x) = d^2 = (x - x_0)^2 + [f(x) - y_0]^2 S ( x ) = d 2 = ( x − x 0 ) 2 + [ f ( x ) − y 0 ] 2 Minimizing S ( x ) S(x) S ( x ) completely eliminates the square root, avoiding messy chain rule and radical algebra while yielding the exact same critical numbers!
Step-by-Step Worked Example: Closest Point on a Parabola
Problem: Find the point on the parabola y = x 2 y = x^2 y = x 2 that is closest to the point ( 0 , 2 ) (0, 2) ( 0 , 2 ) .
Set up squared distance function: S ( x ) = ( x − 0 ) 2 + ( y − 2 ) 2 = x 2 + ( x 2 − 2 ) 2 S(x) = (x - 0)^2 + (y - 2)^2 = x^2 + (x^2 - 2)^2 S ( x ) = ( x − 0 ) 2 + ( y − 2 ) 2 = x 2 + ( x 2 − 2 ) 2
Expand algebraically: S ( x ) = x 2 + ( x 4 − 4 x 2 + 4 ) = x 4 − 3 x 2 + 4 , x ∈ ( − ∞ , ∞ ) S(x) = x^2 + (x^4 - 4x^2 + 4) = x^4 - 3x^2 + 4, \quad x \in (-\infty, \infty) S ( x ) = x 2 + ( x 4 − 4 x 2 + 4 ) = x 4 − 3 x 2 + 4 , x ∈ ( − ∞ , ∞ )
Differentiate and set S ′ ( x ) = 0 S'(x) = 0 S ′ ( x ) = 0 : S ′ ( x ) = 4 x 3 − 6 x = 2 x ( 2 x 2 − 3 ) = 0 S'(x) = 4x^3 - 6x = 2x(2x^2 - 3) = 0 S ′ ( x ) = 4 x 3 − 6 x = 2 x ( 2 x 2 − 3 ) = 0 x = 0 or 2 x 2 = 3 ⟹ x = ± 3 2 = ± 6 2 x = 0 \quad \text{or} \quad 2x^2 = 3 \implies x = \pm\sqrt{\frac{3}{2}} = \pm\frac{\sqrt{6}}{2} x = 0 or 2 x 2 = 3 ⟹ x = ± 2 3 = ± 2 6
Evaluate distances:
At x = 0 x = 0 x = 0 : y = 0 2 = 0 ⟹ S ( 0 ) = 4 ⟹ d = 4 = 2 y = 0^2 = 0 \implies S(0) = 4 \implies d = \sqrt{4} = 2 y = 0 2 = 0 ⟹ S ( 0 ) = 4 ⟹ d = 4 = 2
At x = ± 3 / 2 x = \pm\sqrt{3/2} x = ± 3/2 : y = ( ± 3 / 2 ) 2 = 3 / 2 ⟹ S = ( 3 / 2 ) 2 − 3 ( 3 / 2 ) + 4 = 9 / 4 − 18 / 4 + 16 / 4 = 7 / 4 ⟹ d = 7 / 4 = 7 2 ≈ 1.323 y = (\pm\sqrt{3/2})^2 = 3/2 \implies S = (3/2)^2 - 3(3/2) + 4 = 9/4 - 18/4 + 16/4 = 7/4 \implies d = \sqrt{7/4} = \frac{\sqrt{7}}{2} \approx 1.323 y = ( ± 3/2 ) 2 = 3/2 ⟹ S = ( 3/2 ) 2 − 3 ( 3/2 ) + 4 = 9/4 − 18/4 + 16/4 = 7/4 ⟹ d = 7/4 = 2 7 ≈ 1.323
Conclusion: Since 7 2 < 2 \frac{\sqrt{7}}{2} < 2 2 7 < 2 , the closest points are ( − 3 2 , 3 2 ) \left(-\sqrt{\frac{3}{2}}, \frac{3}{2}\right) ( − 2 3 , 2 3 ) and ( 3 2 , 3 2 ) \left(\sqrt{\frac{3}{2}}, \frac{3}{2}\right) ( 2 3 , 2 3 ) .
4. Core Archetype 3: Economic & Business Optimization
Economic models optimize monetary functions using marginal calculus analysis.
Fundamental Economic Definitions
Demand (Price) Function p ( x ) p(x) p ( x ) : The price per unit when x x x units are produced and sold.
Total Revenue R ( x ) R(x) R ( x ) : Total incoming cash: R ( x ) = x ⋅ p ( x ) R(x) = x \cdot p(x) R ( x ) = x ⋅ p ( x )
Total Cost C ( x ) C(x) C ( x ) : Total production cost to manufacture x x x units.
Total Profit P ( x ) P(x) P ( x ) : Net earnings: P ( x ) = R ( x ) − C ( x ) = x ⋅ p ( x ) − C ( x ) P(x) = R(x) - C(x) = x\cdot p(x) - C(x) P ( x ) = R ( x ) − C ( x ) = x ⋅ p ( x ) − C ( x )
- Marginal Revenue M R ( x ) MR(x) MR ( x ) : R ′ ( x ) = d R d x R'(x) = \frac{dR}{dx} R ′ ( x ) = d x d R
- Marginal Cost M C ( x ) MC(x) MC ( x ) : C ′ ( x ) = d C d x C'(x) = \frac{dC}{dx} C ′ ( x ) = d x d C
- The Maximum Profit Theorem
To maximize profit, set P ′ ( x ) = 0 P'(x) = 0 P ′ ( x ) = 0 : P ′ ( x ) = R ′ ( x ) − C ′ ( x ) = 0 ⟹ R ′ ( x ) = C ′ ( x ) ⟺ M R = M C P'(x) = R'(x) - C'(x) = 0 \implies R'(x) = C'(x) \iff MR = MC P ′ ( x ) = R ′ ( x ) − C ′ ( x ) = 0 ⟹ R ′ ( x ) = C ′ ( x ) ⟺ MR = MC
Economic Golden Rule: Profit is maximized at the production volume x x x where Marginal Revenue equals Marginal Cost ( M R = M C MR = MC MR = MC ) , provided P ′ ′ ( x ) < 0 P''(x) < 0 P ′′ ( x ) < 0 ( R ′ ′ ( x ) < C ′ ′ ( x ) R''(x) < C''(x) R ′′ ( x ) < C ′′ ( x ) ).
Average Cost Minimization
The average cost per unit is C ˉ ( x ) = C ( x ) x \bar{C}(x) = \frac{C(x)}{x} C ˉ ( x ) = x C ( x ) . Differentiating using the Quotient Rule: C ˉ ′ ( x ) = x C ′ ( x ) − C ( x ) ( 1 ) x 2 = 0 ⟹ x C ′ ( x ) = C ( x ) ⟹ C ′ ( x ) = C ( x ) x = C ˉ ( x ) \bar{C}'(x) = \frac{x C'(x) - C(x)(1)}{x^2} = 0 \implies x C'(x) = C(x) \implies C'(x) = \frac{C(x)}{x} = \bar{C}(x) C ˉ ′ ( x ) = x 2 x C ′ ( x ) − C ( x ) ( 1 ) = 0 ⟹ x C ′ ( x ) = C ( x ) ⟹ C ′ ( x ) = x C ( x ) = C ˉ ( x )
Average Cost Rule: Average cost is minimized at the production level where Marginal Cost equals Average Cost ( M C = C ˉ MC = \bar{C} MC = C ˉ ) .
5. Summary of Common Optimization Archetypes
Problem Archetype Objective Function Q Q Q Typical Constraint Single-Variable Key Formula
Open Box Cutout Volume V = l w h V = lwh V = lw h l = L − 2 x , w = W − 2 x , h = x l = L - 2x, w = W - 2x, h = x l = L − 2 x , w = W − 2 x , h = x V ( x ) = x ( L − 2 x ) ( W − 2 x ) V(x) = x(L - 2x)(W - 2x) V ( x ) = x ( L − 2 x ) ( W − 2 x )
Fenced Corral Area A = x y A = xy A = x y Perimeter 2 x + y = L 2x + y = L 2 x + y = L (river) or 2 x + 3 y = L 2x + 3y = L 2 x + 3 y = L A ( x ) = x ( L − 2 x ) A(x) = x(L - 2x) A ( x ) = x ( L − 2 x )
Can Surface Area Area A = 2 π r 2 + 2 π r h A = 2\pi r^2 + 2\pi rh A = 2 π r 2 + 2 π r h Volume π r 2 h = V 0 \pi r^2 h = V_0 π r 2 h = V 0 A ( r ) = 2 π r 2 + 2 V 0 r A(r) = 2\pi r^2 + \frac{2V_0}{r} A ( r ) = 2 π r 2 + r 2 V 0
Point to Curve Distance Squared dist S = d 2 S = d^2 S = d 2 y = f ( x ) y = f(x) y = f ( x ) S ( x ) = ( x − x 0 ) 2 + [ f ( x ) − y 0 ] 2 S(x) = (x - x_0)^2 + [f(x) - y_0]^2 S ( x ) = ( x − x 0 ) 2 + [ f ( x ) − y 0 ] 2
Profit Maximization Profit P ( x ) = R ( x ) − C ( x ) P(x) = R(x) - C(x) P ( x ) = R ( x ) − C ( x ) Price curve p ( x ) p(x) p ( x ) Set R ′ ( x ) = C ′ ( x ) ⟹ M R = M C R'(x) = C'(x) \implies MR = MC R ′ ( x ) = C ′ ( x ) ⟹ MR = MC