SOLID STATE PRESS
← Back to catalog
Optimization cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

Optimization

Maximize, Minimize, and Solve Real Problems with Calculus — A High School & College Primer

Optimization problems are where most AP Calculus and Calc I students hit a wall. The derivative rules feel manageable — but then a word problem asks you to build a box, fence a field, or minimize cost, and suddenly you don't know where to start. This guide cuts straight to what you need.

**TLDR: Optimization** covers the complete single-variable optimization toolkit in under 20 pages. You'll learn what optimization actually means, how to find and classify critical points using the first and second derivative tests, and how to apply the Closed-Interval Method to guarantee you've found the true maximum or minimum. Most importantly, you'll get a reusable five-step recipe for turning a confusing word problem into a single-variable function you can actually differentiate — the skill that separates students who struggle from students who score.

The second half of the book works through four fully solved classic problems: the open-top box, the cylindrical can, the fenced enclosure, and the closest-point-on-a-curve problem. These are the exact patterns that appear most often on AP Calculus exams and college Calc I tests. Each solution is annotated so you see not just the answer but the reasoning behind every step.

This guide is written for high school juniors and seniors in AP Calculus AB or BC, college freshmen in Calc I, and parents or tutors helping students prepare. If you need a quick calculus word problems maximize-and-minimize refresher before an exam, or you're working through ap calculus optimization problems for the first time, this is the shortest path to clarity.

Pick it up, work the examples, walk into your exam ready.

What you'll learn
  • Translate a real-world word problem into an objective function with a clear domain
  • Use derivatives to locate critical points and classify them as maxima, minima, or neither
  • Apply the first and second derivative tests, and the closed-interval method, with confidence
  • Handle constraint equations by substitution to reduce a problem to one variable
  • Solve canonical optimization problems: boxes, fences, cans, distance, and revenue
What's inside
  1. 1. What Optimization Really Means
    Defines optimization as finding the input that makes some quantity as large or as small as possible, and previews the calculus toolkit.
  2. 2. Critical Points and the Derivative Tests
    Explains why extrema occur where the derivative is zero or undefined, and how the first and second derivative tests classify them.
  3. 3. The Closed-Interval Method
    Walks through the Extreme Value Theorem and the candidates-list procedure for finding absolute extrema on a closed interval.
  4. 4. Setting Up Word Problems: From Story to Function
    A reusable five-step recipe for turning a word problem into a single-variable objective function, including how to use a constraint to eliminate variables.
  5. 5. Worked Classics: Boxes, Cans, Fences, and Distance
    Full solutions to four canonical optimization problems that cover the patterns students see most often on exams.
  6. 6. Where This Shows Up Next
    Briefly connects single-variable optimization to economics (marginal analysis), physics (least action), machine learning (gradient descent), and multivariable calculus.
Published by Solid State Press
Optimization cover
TLDR STUDY GUIDES

Optimization

Maximize, Minimize, and Solve Real Problems with Calculus — A High School & College Primer
Solid State Press

Optimization

Maximize, Minimize, and Solve Real Problems with Calculus — A High School & College Primer

Copyright © 2026 Solid State Press.

Published by Solid State Press.

All rights reserved. No part of this book may be reproduced or transmitted in any form without prior written permission, except for brief quotations in critical reviews and educational use.

Part of the TLDR Study Guides series.

Who This Book Is For

If you're staring down AP Calculus optimization problems and the setup still feels slippery, or you're a college freshman working through single-variable calculus exam prep and need concepts explained without the textbook bloat, this short calculus primer is for you. It's also useful for high school students who want a focused review before a unit test, and for tutors who need a clean, example-driven reference.

This book covers how to set up calculus optimization problems from scratch — translating a word problem into a function, finding critical points, and applying the First and Second Derivative Tests to confirm a maximum or minimum. It also walks through the Closed-Interval Method, classic calculus word problems involving maximizing and minimizing boxes, cans, and fences, and a look at where these skills lead. About 15 pages, no filler.

Read straight through once for orientation. Work each example yourself before reading the solution. Then hit the problem set at the end — that's where the ideas actually stick.

Contents

  1. 1 What Optimization Really Means
  2. 2 Critical Points and the Derivative Tests
  3. 3 The Closed-Interval Method
  4. 4 Setting Up Word Problems: From Story to Function
  5. 5 Worked Classics: Boxes, Cans, Fences, and Distance
  6. 6 Where This Shows Up Next
Chapter 1

What Optimization Really Means

Every decision you make can be framed as a search for the best option. The best route to school. The cheapest plan that meets your needs. The angle that sends a ball the farthest. Mathematics formalizes that search, and optimization is the branch that handles it: given some quantity that depends on your choices, find the choice that makes the quantity as large or as small as possible.

The quantity you are trying to push to an extreme is called the objective function. Think of it as a measuring stick — it scores any given choice with a number, and your job is to find the choice that earns the highest (or lowest) score. You might write it $f(x)$, where $x$ represents the decision you control. For example, if you are deciding how wide to make a rectangular garden, $x$ might be the width in meters, and $f(x)$ might be the total area. You want the width $x$ that makes $f(x)$ as large as possible.

Most real problems come with restrictions. You only have 40 meters of fencing. The box must fit inside a shipping crate. The budget caps at $500. These restrictions are called **constraints**, and they are not optional fine print — they are what make the problem nontrivial. Without a constraint, you could just let $x$ grow forever and area would grow with it. The constraint is what forces a genuine trade-off and a genuine answer.

Constraints also define the domain of the problem: the set of input values that are physically or logically allowed. If $x$ is a width, it cannot be negative, and the fencing constraint will put an upper limit on it too. The collection of all allowed values — after you apply every constraint — is sometimes called the feasible region. For single-variable problems, the feasible region is usually an interval on the number line, something like $0 < x < 20$ or $0 \le x \le 20$. Identifying this interval precisely is one of the most important (and most skipped) steps students take.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon