SAT Optimization in Piecewise Functions: Finding Maximum and Minimum Values Across Pieces

A piecewise function defines different rules on different domain intervals. For example, f(x) might equal x^2 for x<0 and 2x+1 for x≥0. Finding a maximum or minimum requires checking the maximum and minimum within each piece, plus the values at boundaries where the function switches. Students often find the maximum of one piece and assume it is the overall maximum, missing that another piece or a boundary point has a higher value. The optimization process is mechanical: evaluate the function at critical points within each piece (where the derivative is zero, if you use calculus, or by checking endpoints and corner points), then compare all candidates to find the global maximum or minimum.

This appears on the SAT in disguised form. A word problem might describe a function that changes rules at certain points, and you need to find the overall maximum. Recognizing this as a piecewise optimization problem prevents missing candidates.

Step 1: Identify all pieces of the function and their domain intervals. Step 2: For each piece, find the maximum and minimum within its domain (either by calculus, testing endpoints, or by recognizing the function's shape). Step 3: Evaluate the function at all boundary points (where pieces switch). Compare all candidates to find the global maximum and minimum. This systematic approach ensures you do not miss a boundary point or overlook a candidate. It requires no advanced calculus; you are just systematically checking all important points.

Application: If f(x)=x^2 for x<1 and f(x)=3 for x≥1, the maximum of the first piece as x approaches 1 from the left is approaching 1. At the boundary x=1, f(1)=3 (using the second rule). So the global maximum on a reasonable domain includes both f(1)=3 and the behavior of the first piece. Checking both pieces and the boundary gives the complete picture.

Example 1: f(x) equals x+2 for x<0 and -x+2 for x≥0. Maximum at x=0: f(0)=2. As x goes to negative infinity, f(x) goes to negative infinity. As x goes to positive infinity, f(x) goes to negative infinity. The global maximum is 2 at x=0 (the boundary). Example 2: f(x) equals x^2 for x<2 and 5 for x≥2. The second piece is constant at 5. The first piece at x approaching 2 approaches 4. The boundary x=2 gives f(2)=5. The global maximum is 5. In both cases, the boundary point or a specific piece produces the extremum. Checking only the interior of one piece would miss the correct answer.

This skill appears subtle but is testable. An optimization problem that does not look piecewise might actually involve a piecewise structure hidden in the word problem setup. Recognizing the structure and systematically checking all pieces and boundaries finds the correct answer.

For five days, solve three piecewise optimization problems daily. Write out the three-step routine explicitly: identify pieces, find maxima/minima within each, check boundaries, compare all candidates. By day five, this routine becomes automatic. You will recognize piecewise optimization problems and systematically find extrema without missing candidates.

On test day, when a word problem describes a situation with different rules in different regions, you will instinctively recognize it as piecewise and apply your systematic routine. This prevents the error of finding an extremum within one piece and assuming it is the global extremum. The five-day drill catches 1-2 optimization errors on comprehensive practice tests.