Geometric Optimization
Maximum/minimum length or area, shortest paths, extremal configurations
Geometric OptimizationAMC 10 Step by Step
Name: Date: October 28, 2026
Geometry · 4 problems have this as their main idea
4
primary-topic problems (0.3% of all)
7
more as a secondary topic
Where it appears
3
P1-10
0
P11-15
1
P16-20
0
P21-25
What you need to know
- Triangle Inequality. Any two sides must add up to more than the third, strictly. It is enough to check the two shorter sides against the longest: , , fails because , even though . If the two shorter sides add up to exactly the longest, the "triangle" is flat. Example: with sides and , the third side is strictly between and . So the largest or smallest possible length is often only approached, as the triangle flattens into a line.
- Shortest path by reflection. Let and be on the same side of a line . To make smallest with on , reflect across to get . Since , the minimum is the straight distance , reached where crosses . Example: for , and the -axis, , so the shortest path is , through . (If and are on opposite sides, no reflection is needed: crosses .)
- Largest triangle with two given sides. With sides and , the area is at most , reached when the angle between them is . Why: with base , the height is at most (in trig terms, ). Example: sides and give area at most .
How AMC 10 tests it
- "Largest possible area of a triangle with sides and ?" or "...with integer sides and perimeter ?" (problems 8–15).
- A spider or ant on a box or cylinder. Unfold the surface flat and compare a few nets.
- The largest number of crossing points of lines, circles, and polygons. You need an upper bound (why it can't be more) and a construction (a drawing that reaches it).
Standard approaches
- Reflect a fixed point across the line the path must touch (or unfold the surface), so the path becomes a straight segment.
- Push the figure to its extreme case (points in a line, a right angle, a tangent), then check that the problem allows it.
- For "largest number of" questions, find the most each pair of shapes can contribute, then draw an example that reaches the total. Example: for circles and line, each of the pairs crosses at most twice, so there are at most points, and can be drawn.
Worked example
Points and lie on the same side of line , at distances and from , and the feet of the perpendiculars from and to are units apart. Point on minimizes . What is ?
(A) (B) (C) (D) (E)
Solution. Step 1. Reflect across to get , units below . For every on , , so .
Step 2. and are apart vertically and apart horizontally, so .
Step 3. is where crosses . The right triangles on either side of (heights and ) are similar, so splits the in the ratio . That puts at from the foot of .
Step 4. is the hypotenuse of a right triangle with legs and :
The answer is .
Pitfalls
- Reflecting both points (which gives back the same problem), or reflecting the wrong one.
- Giving the whole minimum ( above) when the problem asks for one piece ().
- Forgetting the construction in a "largest number" problem. Showing it can't be more than is only half; you must also show can happen.
Traps that recur
- Picking choice (E), which needs 5 space diagonals, without checking that a corner can be the endpoint of only one space diagonal. (2010 AMC 10A #20)
- Assuming a triangle with the given perimeter and area exists and answering 2 or 4 by symmetry, without checking whether height 20 is reachable. (2019 AMC 10B #10)
- Answering 13 by allowing the longest side to equal the sum of the other three, which gives a degenerate flat figure. (2023 AMC 10A #4)
- Stacking the rectangles end to end (3 + 4 = 7) and answering 49, without trying the side-by-side arrangement. (2006 AMC 10B #5)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.