Applications of Derivatives/Curve Sketching and Optimization

Lesson 3.31,173 words

Curve Sketching and Optimization

A checklist that synthesizes domain, symmetry, asymptotes, monotonicity, extrema, and concavity into a hand sketch of any function, plus the slant asymptote for rational functions whose degree exceeds the denominator's. The same extremum machinery, applied to a word problem, becomes the optimization template: model one quantity, reduce it to a function of a single variable, and find its absolute extremum.

╌╌╌╌

Monotonicity, extrema, concavity, and end behavior are separate readings of a function. A hand sketch merges them into one picture. Optimization runs the same extremum tests in the other direction: reduce a real quantity to a function of one variable and find its extreme value.

The curve-sketching checklist

A calculus sketch places the features that matter — intercepts, asymptotes, extrema, inflections — rather than sampling points blindly. Stewart organizes the work as eight steps.1

  • A. Domain. Determine the set of for which is defined.
  • B. Intercepts. The -intercept is . Find -intercepts by solving (skip if intractable).
  • C. Symmetry. If , is even and the graph is symmetric about the -axis. If , is odd and symmetric about the origin. If , is periodic with period .
  • D. Asymptotes. Horizontal: gives . Vertical: where a one-sided limit is . Slant: handled below.
  • E. Intervals of increase/decrease. Sign of by the Increasing/Decreasing Test.
  • F. Local extrema. Critical numbers plus the First (or Second) Derivative Test.
  • G. Concavity and inflection. Sign of by the Concavity Test; inflections where it changes.
  • H. Sketch. Draw asymptotes as dashed lines, plot the intercepts and the extreme and inflection points, then join them respecting E and G.

Symmetry is a labor saver. For an even or odd function, sketch and reflect; for a periodic function, sketch one period and translate.

Even functions reflect across the -axis; odd functions rotate about the origin. Either halves the sketching work.

A worked sketch

Apply the checklist to .

  • Domain: all with , so .
  • Intercepts: ; the only -intercept is the origin.
  • Symmetry: , so the graph is even.
  • Asymptotes: , so is a horizontal asymptote. The denominator vanishes at , giving vertical asymptotes there.
  • Monotonicity: , positive for and negative for (away from ). So increases on and , decreases on and .
  • Extrema: with a sign change from to , so is a local maximum.
  • Concavity: , positive when and negative when , so the graph is concave up on and and concave down on . No inflection points, since are not in the domain.
The finished sketch of : even, with vertical asymptotes at , horizontal asymptote , and a local maximum at the origin.

Slant asymptotes

When the numerator of a rational function has degree exactly one more than the denominator, the graph approaches a slanted line rather than a horizontal one. Polynomial division writes

so and the line is a slant asymptote. The curve approaches that line at both ends, above it where the remainder is positive and below where it is negative.

The finished sketch of : odd, strictly increasing, with the slant asymptote approached from below on the right and from above on the left.

Optimization: modeling one quantity

The extremum tools answer applied questions once the situation is written as a function. The difficulty is almost always the setup, not the calculus. A fixed template turns a word problem into a single-variable extremum.

Algorithm:Optimize\textsc{Optimize} — solving an applied maximum/minimum problem
  1. 1
    read the problem; identify the quantity QQ to be optimized and the given data
  2. 2
    draw a diagram and label every relevant quantity with a symbol
  3. 3
    express QQ in terms of those symbols
  4. 4
    use the constraints to eliminate variables until Q=f(x)Q = f(x) of one variable
  5. 5
    record the domain of xx implied by the physical setting
  6. 6
    find the absolute extremum of ff on that domain
  7. 7
    translate the optimizing xx back into the answer the problem asked for

The last step matters: a problem asking for dimensions is not answered by the critical number alone.

Maximizing an area under a constraint

A farmer has ft of fencing for a rectangular field bordering a straight river, needing no fence along the river. Which dimensions maximize the area?

Let be the depth (the two sides perpendicular to the river) and the width (the side parallel to it). The area is , and the fence covers three sides:

Substituting eliminates :

Then at . Since , the graph is concave down everywhere and the critical number is the absolute maximum; confirms it by the Closed Interval Method. The width is , so the field is ft deep and ft wide, with area ft.

The fenced field (left) and its area function (right): the parabola peaks at the critical number .

Minimizing material with an open domain

A cylindrical can must hold L cm. Which radius and height use the least metal? The cost tracks the total surface area of the top, bottom, and side.

The side unrolls into a rectangle of height and width equal to the circumference , so its area is ; the two disks contribute . Thus . The volume constraint gives , and substituting eliminates :

The can and its unrolled surface: two disks of area and a rectangular side of height and width equal to the circumference.

The domain is open, , so the Closed Interval Method does not apply and the First Derivative Test for absolute extrema takes over. Differentiate:

The only critical number is cm. For below it and above it , so this critical number is the absolute minimum.

The corresponding height is : the most economical can is exactly as tall as it is wide across the diameter. This single-critical-number argument is the standard replacement for the Closed Interval Method whenever the physical domain is an open or infinite interval.

The two examples used different closing arguments because their domains differed. The choice is dictated by whether the domain is a closed bounded interval.

Closed Interval MethodFirst Derivative Test for absolute extrema
Domainclosed and bounded, any interval, including open or infinite
Candidatescritical numbers and endpointsthe critical number alone
Decision rulecompare all candidate valuessign change of across the critical number
GuaranteeExtreme Value Theorem ensures extrema existvalid only when a single critical number controls the whole domain
Example abovefenced field, cylindrical can,

Minimizing distance to a curve

A closest-point problem models the distance from a fixed point to a curve, then minimizes it. Minimizing the squared distance avoids the square root and has the same minimizer.

The point on is the one nearest the target ; the shortest segment joins them.

Least-time paths

Fermat's principle in optics states that light takes the path of least time. The same structure governs a traveler choosing where to cross terrain of two speeds.

The least-time crossing: rowing from to a landing point on the far bank, then running along the bank to . The optimum balances the two legs.

Footnotes

  1. Stewart, §3.5 — Summary of Curve Sketching: the eight-step guideline (domain, intercepts, symmetry, asymptotes, monotonicity, extrema, concavity, sketch) and slant asymptotes; §3.7 — Optimization Problems: the six-step problem-solving procedure, the fencing and cylindrical-can examples, and the First Derivative Test for Absolute Extreme Values.

╌╌ END ╌╌