Absolute Extrema — Finding Absolute Extrema on an Interval - Business Calculus

SECTION 1

Historical Context & Motivation

The search for maximum and minimum values is among the oldest problems in mathematics, predating formal calculus by centuries. Ancient Greek geometers, including Euclid and Apollonius, explored optimization when they proved that among all rectangles with a given perimeter, the square encloses the greatest area. However, their methods were geometric and ad hoc, lacking the systematic algebraic framework that modern calculus provides. The formal study of absolute extrema — the largest and smallest values a function attains over an entire domain or interval — became possible only after the development of derivatives and the rigorous notion of continuity in the seventeenth and eighteenth centuries.

In the business world, optimization questions are ubiquitous: a manufacturer wants to know the production level that maximizes profit, a logistics firm seeks the shipping schedule that minimizes cost, and a marketing team aims to find the advertising budget that maximizes return on investment. These questions translate naturally into the mathematical problem of finding absolute extrema on a closed interval, where the interval represents a feasible range of inputs such as units produced, hours worked, or dollars spent.

~300 BCE • Euclid's Optimization

Euclid demonstrated that the square maximizes area among rectangles of fixed perimeter, establishing the earliest known extremal result in geometry.

1629 • Fermat's Method of Adequality

Pierre de Fermat developed a technique resembling differentiation to find maxima and minima of polynomial expressions, foreshadowing the modern derivative-based approach.

1684 • Leibniz Publishes Calculus

Gottfried Wilhelm Leibniz published the first systematic treatment of differential calculus, providing notation and rules that made extrema-finding algorithmic.

1821 • Cauchy & the Extreme Value Theorem

Augustin-Louis Cauchy and later Bernard Bolzano rigorously proved that a continuous function on a closed, bounded interval must attain both a maximum and a minimum value.

20th C. • Operations Research & Business Calculus

The rise of operations research during World War II brought systematic optimization into economics, logistics, and management, firmly embedding extrema-finding in business decision-making.

The central question this lesson addresses is deceptively straightforward: given a continuous function on a closed interval [a, b], how do we systematically identify the absolute maximum and absolute minimum values? The answer hinges on a powerful theorem from real analysis — the Extreme Value Theorem — and a clean algorithmic procedure known as the Closed Interval Method.

SECTION 2

Core Principles & Definitions

Before diving into the algorithm for finding absolute extrema, it is essential to establish clear definitions and distinguish absolute extrema from their local counterparts. A function f defined on a domain D has an absolute maximum at a point c if f(c) ≥ f(x) for every x in D. Similarly, f has an absolute minimum at c if f(c) ≤ f(x) for every x in D. These are global statements — they compare f(c) against all other function values, not just those in a small neighborhood. By contrast, a local (relative) extremum requires only that f(c) dominate nearby values, so a local maximum need not be the largest value overall.

Extreme Value Theorem (EVT)

If f is continuous on a closed interval [a, b], then f attains both an absolute maximum and an absolute minimum on [a, b]. Continuity and a closed interval are both required.

Critical Numbers

A critical number c in (a, b) is a value where f′(c) = 0 or f′(c) does not exist. Absolute extrema can only occur at critical numbers or at the endpoints of the interval.

Closed Interval Method

Evaluate f at each critical number in (a, b) and at both endpoints a and b. The largest value is the absolute maximum; the smallest is the absolute minimum.

Absolute vs. Local Extrema

Every absolute extremum on a closed interval is either a local extremum or an endpoint value. However, a local extremum is not necessarily an absolute extremum.

✦

KEY TAKEAWAY

Think of the Closed Interval Method like evaluating every peak and valley along a hiking trail between two trailheads. You already know the elevation at the start and finish (the endpoints). You also check each summit and each depression along the way (the critical numbers). The highest elevation you record is the absolute maximum, and the lowest is the absolute minimum. Because you are on a continuous trail with defined boundaries, you are guaranteed to find both.

SECTION 3

Visual Explanation

The following diagram illustrates a continuous function f on a closed interval [a, b]. Notice how the absolute maximum and absolute minimum are identified by comparing the function's values at every critical number and at both endpoints. The graph features two critical numbers — one where the derivative equals zero (a smooth turning point) and one where the derivative is undefined (a cusp). The absolute maximum in this case occurs at a critical number, while the absolute minimum occurs at an endpoint, demonstrating that extrema can appear at either type of candidate.

A continuous function on [a, b] with two critical numbers c₁ and c₂. The absolute maximum occurs at c₁ where f′(c₁) = 0, while the endpoints f(a) and f(b) (shown in amber) are also evaluated. The absolute minimum in this case is at f(a).

The key insight from this diagram is that absolute extrema are found by comparing a finite list of candidates: the function values at all critical numbers inside the interval and the function values at the two endpoints. This comparison reduces what might seem like an infinite search (checking every point on a continuous curve) to a manageable, finite process. The Extreme Value Theorem guarantees that the answer exists, and the Closed Interval Method tells you exactly where to look.

SECTION 4

Mathematical Framework

The mathematical foundation of finding absolute extrema rests on two pillars: the Extreme Value Theorem, which guarantees existence, and the concept of critical numbers, which narrows the search space. Together, they yield the Closed Interval Method — an algorithm that is both rigorous and computationally straightforward.

EXTREME VALUE THEOREM

If f is continuous on [a, b], then ∃ c, d ∈ [a, b] such that f(c) ≤ f(x) ≤ f(d) for all x ∈ [a, b].

f(c) is the absolute minimum and f(d) is the absolute maximum. Both hypotheses — continuity and a closed, bounded interval — are essential.

CRITICAL NUMBER DEFINITION

c is a critical number of f if c ∈ domain(f) and either f′(c) = 0 or f′(c) does not exist.

Critical numbers where f′(c) = 0 correspond to horizontal tangent lines (smooth turning points). Critical numbers where f′(c) does not exist correspond to cusps, corners, or vertical tangent lines.

CLOSED INTERVAL METHOD

Absolute max = max{ f(a), f(c₁), f(c₂), …, f(cₙ), f(b) } ; Absolute min = min{ f(a), f(c₁), f(c₂), …, f(cₙ), f(b) }

where c₁, c₂, …, cₙ are all critical numbers of f in the open interval (a, b). This comparison yields both the absolute maximum value and the absolute minimum value, along with the x-values at which they occur.

The Algorithm Step by Step

Step 1: Verify that f is continuous on [a, b]. If f has any discontinuities on the interval, the Extreme Value Theorem does not apply directly.
Step 2: Compute f′(x) and find all critical numbers c in the open interval (a, b) by solving f′(x) = 0 and identifying points where f′(x) does not exist.
Step 3: Evaluate f at each critical number found in Step 2 and at both endpoints a and b.
Step 4: Compare all computed values. The largest is the absolute maximum; the smallest is the absolute minimum.

⚠

Why Endpoints Matter

Unlike local extrema, which occur only at interior critical numbers, absolute extrema may occur at the boundary of the interval. Imagine a profit function that is strictly increasing over an entire production range — the absolute maximum occurs at the right endpoint, even though f′ is never zero. Omitting endpoints is the most common error students make when applying this method.

SECTION 5

Business Applications & Classification

In business calculus, the closed interval typically represents a feasibility constraint: a company can produce between 0 and 500 units per day, or a marketing budget ranges from $10,000 to $100,000. The function being optimized — profit, revenue, cost, or average cost — is derived from the underlying economic model. The Closed Interval Method translates the business question into a precise mathematical procedure: find critical numbers within the feasibility range, evaluate at those points and at the boundaries, and compare.

The profit function P(x) = −0.02x² + 8x − 200 on [0, 300]. The absolute maximum profit of $600 occurs at x = 200 units (the critical number where P′ = 0). Both endpoints yield P = −$200, which is the absolute minimum on this interval.

Business Scenario	Function Type	Typical Interval	Goal
Maximize profit	P(x) = R(x) − C(x)	[0, max production capacity]	Find absolute maximum of P
Minimize average cost	C̄(x) = C(x) / x	[1, max capacity]	Find absolute minimum of C̄
Maximize revenue	R(x) = x · p(x)	[0, market saturation]	Find absolute maximum of R
Optimize advertising ROI	S(a) = f(a) − a	[min budget, max budget]	Find absolute maximum of S

Common business optimization scenarios and their calculus formulations

SECTION 6

Worked Example

A small electronics company models its daily profit (in dollars) from producing x units of a wireless charger as P(x) = −x³ + 12x² − 36x + 10, where x is measured in hundreds of units and production is constrained to the interval [1, 8]. Find the absolute maximum and absolute minimum profit on this interval.

Finding Absolute Extrema of a Profit Function

1
Step 1 — Verify Continuity

P(x) = −x³ + 12x² − 36x + 10 is a polynomial, and polynomials are continuous everywhere. In particular, P is continuous on the closed interval [1, 8]. Therefore the Extreme Value Theorem guarantees that absolute extrema exist on this interval.
2
Step 2 — Find the Derivative and Critical Numbers

Differentiate P(x): P′(x) = −3x² + 24x − 36. Factor: P′(x) = −3(x² − 8x + 12) = −3(x − 2)(x − 6). Setting P′(x) = 0 yields x = 2 and x = 6. Both values lie in the open interval (1, 8), so both are critical numbers. Since P′(x) is a polynomial and is defined everywhere, there are no additional critical numbers where the derivative fails to exist.

Critical numbers: x = 2 and x = 6
3
Step 3 — Evaluate P at Critical Numbers and Endpoints

Compute P at x = 1, 2, 6, and 8. P(1) = −(1) + 12(1) − 36(1) + 10 = −1 + 12 − 36 + 10 = −15. P(2) = −(8) + 12(4) − 36(2) + 10 = −8 + 48 − 72 + 10 = −22. P(6) = −(216) + 12(36) − 36(6) + 10 = −216 + 432 − 216 + 10 = 10. P(8) = −(512) + 12(64) − 36(8) + 10 = −512 + 768 − 288 + 10 = −22.

P(1) = −15, P(2) = −22, P(6) = 10, P(8) = −22
4
Step 4 — Compare and Identify Absolute Extrema

Comparing all candidate values: {−15, −22, 10, −22}. The largest value is 10, which occurs at x = 6. The smallest value is −22, which occurs at both x = 2 and x = 8.

Absolute maximum: P(6) = $10 (hundreds) at x = 6 hundred units. Absolute minimum: P(2) = P(8) = −$22 (hundreds) at x = 2 and x = 8 hundred units.
5
Step 5 — Interpret the Business Result

The company maximizes daily profit at $1,000 by producing 600 units. Producing 200 units or 800 units would result in the greatest loss of $2,200. Management should target production near 600 units; producing significantly above or below that level erodes profitability within this feasible range.

SECTION 7

Strengths, Limitations & Common Pitfalls

The Closed Interval Method is elegant in its simplicity: it reduces an optimization problem to a finite number of function evaluations. However, like all mathematical tools, it operates under specific assumptions, and misapplying it can lead to incorrect conclusions. Understanding both its power and its boundaries is critical for effective decision-making in business contexts.

Strengths	Limitations
Guaranteed to find the absolute max and min when hypotheses are met (continuity + closed interval).	Requires continuity on the entire closed interval; discontinuous cost or revenue functions need special treatment.
Reduces an infinite search to a finite comparison — computationally efficient.	Does not apply to open intervals (a, b) or unbounded domains like [0, ∞); the EVT does not guarantee extrema exist in such cases.
No second-derivative test needed; direct comparison of values is conclusive.	Finding critical numbers may require solving difficult equations (e.g., transcendental equations) that lack closed-form solutions.
Works for any continuous function — polynomial, rational (if continuous on interval), exponential, logarithmic.	Only addresses single-variable optimization; multivariable problems require Lagrange multipliers or linear programming.

Strengths and limitations of the Closed Interval Method

⚠️

AVOIDING COMMON PITFALLS

Three errors dominate student work in this area. First, forgetting to evaluate at endpoints — critical numbers alone are insufficient because absolute extrema may occur at the boundary. Second, including critical numbers outside the interval — if a critical number falls outside [a, b], it is irrelevant to the optimization on that interval. Third, applying the method to open or infinite intervals — without a closed, bounded domain, the Extreme Value Theorem does not apply and additional analysis (limits at infinity, one-sided limits) is required.

SECTION 8

Connection to Advanced Optimization Theory

The Closed Interval Method is the simplest instance of a broader family of optimization techniques. As business problems grow in complexity — multiple decision variables, inequality constraints, integer requirements — the underlying mathematical framework expands accordingly. The table below maps the progression from the foundational method covered in this lesson to more advanced tools you will encounter in operations research, econometrics, and managerial decision science.

Feature	Closed Interval Method	Advanced Methods
Number of variables	One (single input x)	Two or more (Lagrange multipliers, multivariable calculus)
Type of constraint	Simple interval: a ≤ x ≤ b	Equality constraints (Lagrange), inequality constraints (KKT conditions, linear programming)
Existence guarantee	Extreme Value Theorem (continuity + closed interval)	Weierstrass theorem on compact sets; feasibility conditions in LP
Computational approach	Analytic: solve f′(x) = 0, compare finite list	Often numerical: simplex method, gradient descent, interior point methods
Typical business course	Business Calculus	Operations Research, Managerial Economics, Machine Learning

From the Closed Interval Method to advanced optimization

Despite its simplicity, the Closed Interval Method instills a crucial optimization mindset: identify candidates, evaluate systematically, and compare. This logic persists in every optimization algorithm, from the simplex method in linear programming to gradient-based routines in machine learning. Mastering the single-variable case builds the conceptual vocabulary — critical points, boundary analysis, feasibility — that underpins all subsequent work in quantitative decision-making.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Explain why the Extreme Value Theorem requires both continuity and a closed interval. Give a specific example of a function on an open interval (0, 1) that has no absolute maximum, and explain what goes wrong.

Show answer

The Extreme Value Theorem guarantees that a continuous function on a closed, bounded interval [a, b] attains both an absolute maximum and an absolute minimum. If either hypothesis fails, the conclusion may not hold. Consider f(x) = 1/x on the open interval (0, 1). As x → 0⁺, f(x) → ∞, so f has no finite upper bound and therefore no absolute maximum. The interval (0, 1) is open, meaning the boundary point x = 0 is excluded from the domain; the function values can increase without bound near x = 0 without actually reaching a maximum. A closed interval would include both endpoints, bounding the function values and ensuring the max and min exist.

Question 2: BASIC CALCULATION

Find the absolute maximum and absolute minimum of f(x) = x² − 4x + 5 on the interval [0, 5].

Show answer

First, compute f′(x) = 2x − 4. Setting f′(x) = 0 gives x = 2, which lies in (0, 5), so it is a valid critical number. Next, evaluate f at the critical number and both endpoints: f(0) = 0 − 0 + 5 = 5, f(2) = 4 − 8 + 5 = 1, f(5) = 25 − 20 + 5 = 10. Comparing these values, the absolute maximum is f(5) = 10 (occurring at the right endpoint) and the absolute minimum is f(2) = 1 (occurring at the interior critical number). This problem illustrates that the absolute maximum can occur at an endpoint even when a critical number exists in the interior.

Question 3: INTERMEDIATE

A company's revenue function is R(x) = 120x − 0.5x² (in thousands of dollars), where x represents units sold in thousands and the company can sell between 20 and 200 units (x ∈ [20, 200]). Determine the production level that maximizes revenue and the production level that minimizes revenue on this interval.

Show answer

Differentiate: R′(x) = 120 − x. Setting R′(x) = 0 gives x = 120, which is in (20, 200). Evaluate R at the critical number and endpoints: R(20) = 120(20) − 0.5(400) = 2400 − 200 = 2200, R(120) = 120(120) − 0.5(14400) = 14400 − 7200 = 7200, R(200) = 120(200) − 0.5(40000) = 24000 − 20000 = 4000. The absolute maximum revenue is $7,200 thousand at x = 120 thousand units. The absolute minimum revenue on this interval is $2,200 thousand at x = 20 thousand units. Although producing 200 units generates more revenue than 20 units, neither endpoint surpasses the critical number, confirming that the parabola's vertex at x = 120 dominates.

Question 4: APPLIED

A pharmaceutical startup models its average cost per unit as C̄(x) = 800/x + 0.4x + 20 (in dollars), where x is the number of units produced per batch and batches range from 10 to 100 units. Find the batch size that minimizes average cost and state the minimum average cost.

Show answer

Differentiate: C̄′(x) = −800/x² + 0.4. Setting C̄′(x) = 0 yields 800/x² = 0.4, so x² = 2000, giving x = √2000 ≈ 44.72. Since 44.72 lies in (10, 100), it is a valid critical number. Evaluate: C̄(10) = 800/10 + 0.4(10) + 20 = 80 + 4 + 20 = $104.00, C̄(44.72) = 800/44.72 + 0.4(44.72) + 20 ≈ 17.89 + 17.89 + 20 = $55.78, C̄(100) = 800/100 + 0.4(100) + 20 = 8 + 40 + 20 = $68.00. The absolute minimum average cost is approximately $55.78 per unit at a batch size of about 44.72 units (practically, the company should test batch sizes of 44 and 45 and choose the one yielding the lower cost). The absolute maximum average cost on this interval is $104.00 at x = 10 units.

Question 5: CRITICAL THINKING

Suppose a profit function P(x) is continuous on [0, 500] and has exactly three critical numbers in (0, 500): at x = 100, x = 250, and x = 400. You are told that P(0) = 50, P(100) = 320, P(250) = 310, P(400) = 340, and P(500) = 200. (a) Identify the absolute maximum and minimum. (b) A manager claims that since P(250) is a local minimum between the two local maxima at x = 100 and x = 400, it must be the absolute minimum. Is this claim correct? Explain why the Closed Interval Method protects against this kind of reasoning error.

Show answer

(a) The candidate values are {50, 320, 310, 340, 200}. The absolute maximum is P(400) = 340 and the absolute minimum is P(0) = 50. (b) The manager's claim is incorrect. While P(250) = 310 may be a local minimum between the two local maxima, it is not the absolute minimum because P(0) = 50 < 310. The Closed Interval Method systematically prevents this error by requiring evaluation at the endpoints. Without checking endpoints, one might mistakenly assume the global minimum must occur at an interior critical number. In business contexts this is especially dangerous: the lowest profit might occur at a boundary of the feasible production range — for instance, at zero production where fixed costs dominate. The method's strength lies in its exhaustive comparison of all candidates, leaving no possibility for oversight.

SUMMARY

Lesson Summary

Summary

The Extreme Value Theorem guarantees that any continuous function on a closed interval [a, b] attains both an absolute maximum and an absolute minimum. The Closed Interval Method operationalizes this theorem: compute the derivative, find all critical numbers in (a, b) where f′(x) = 0 or f′(x) does not exist, evaluate f at those critical numbers and at both endpoints, and then compare all values to identify the global extremes.

In business applications, the interval typically represents a feasibility constraint on production, budget, or labor. Common objectives include maximizing profit and revenue, or minimizing cost and average cost. The most frequent errors — omitting endpoint evaluations, including critical numbers outside the interval, or applying the method to open domains — are all preventable by rigorously following the four-step algorithm. This foundational technique paves the way for multivariable optimization and constrained optimization encountered in operations research and advanced economics.