Lecture 10: Complete Guide to Optimization Problems – Finding Maximum and Minimum Values Using First and Second Derivative Tests

Learning Objectives:

By the end of this lecture, students will be able to:

1. Apply the Extreme Value Theorem to guarantee the existence of maximum and minimum values on closed intervals and understand continuity requirements for optimization
2. Identify and analyze critical points systematically by finding where f'(x) = 0 or f'(x) is undefined, and classify their significance in optimization problems
3. Master the First Derivative Test to determine local maxima and minima through sign change analysis of derivatives and increasing/decreasing function behavior
4. Utilize the Second Derivative Test effectively to classify critical points using concavity analysis and identify inflection points for complete function characterization
5. Distinguish between absolute and relative extrema to find global maximum and minimum values versus local extrema in optimization contexts
6. Implement comprehensive optimization strategies including function identification, domain determination, critical point analysis, candidate evaluation, and endpoint verification
7. Solve geometric optimization problems involving area maximization, perimeter minimization, volume optimization, and surface area applications in real-world scenarios
8. Apply optimization to economic and business problems including cost minimization strategies, profit maximization techniques, and revenue optimization for practical decision-making

Lecture 10 Outline:

1. Extreme Value Theorem and Fundamental Optimization Principles
   • Mathematical foundation guaranteeing the existence of maximum and minimum values
   • Closed interval requirements and continuity conditions for optimization
   • Understanding when optimal solutions are guaranteed to exist
   • Practical implications for real-world optimization problems
2. Critical Points: Identification and Mathematical Significance
   • Comprehensive definition of critical points in the optimization context
   • Systematic methods for finding where f'(x) = 0 or f'(x) is undefined
   • Relationship between critical points and potential extrema locations
   • Common types of critical points and their geometric interpretations
3. First Derivative Test for Extrema Classification
   • Sign change analysis technique for classifying critical points
   • Increasing and decreasing function behavior around critical points
   • Step-by-step methodology for applying the first derivative test
   • Practical examples demonstrating local maxima and minima identification
4. Second Derivative Test and Concavity Analysis
   • Concavity concepts and relationship to optimization problems
   • Using f”(x) to classify critical points as maxima, minima, or inflection points
   • Limitations and advantages of the second derivative test approach
   • Integration of concavity analysis with optimization strategies
5. Absolute versus Relative Extrema in Optimization
   • Global maximum and minimum value determination techniques
   • Local extrema identification and significance in optimization
   • Comparison methods for evaluating multiple extrema candidates
   • Boundary behavior and endpoint analysis for complete optimization
6. Comprehensive Optimization Strategy and Methodology
   • Systematic approach to identifying functions requiring optimization
   • Domain determination and constraint analysis for realistic problems
   • Critical point finding and candidate evaluation procedures
   • Endpoint checking and boundary condition considerations
   • Verification techniques for optimal solution validation
7. Geometric Optimization Applications and Problem-Solving
   • Area maximization and minimization problems with practical constraints
   • Perimeter optimization in geometric design applications
   • Volume optimization for three-dimensional geometric problems
   • Surface area minimization in engineering and manufacturing contexts
   • Real-world geometric optimization case studies and solutions
8. Economic and Business Optimization Applications
   • Cost minimization strategies using differential calculus techniques
   • Profit maximization models and revenue optimization approaches
   • Production optimization and resource allocation problems
   • Market analysis applications and economic decision-making tools
   • Business case studies demonstrating practical optimization implementation

Introduction

Welcome to Lecture 10 of our Differential Calculus series, where we tackle one of calculus’s most practical applications: optimization. After mastering linear approximation techniques in our previous lecture on Linear Approximation and Differentials, you’re now ready to solve real-world problems that ask the fundamental question: “What’s the best possible outcome?“

Optimization problems appear everywhere in engineering. Whether you’re designing the strongest beam with minimal material, finding the most efficient production rate, or determining the optimal trajectory for a satellite, differential calculus provides the mathematical tools to find these optimal solutions.

This comprehensive guide covers the fundamental techniques for finding maximum and minimum values using derivative tests. You’ll learn systematic approaches that work across engineering disciplines, from mechanical design to electrical circuit analysis.

Why Optimization Matters

Every day, engineers design structures using minimal materials while maximizing strength. Business owners seek the perfect balance between production costs and profit margins. Manufacturers determine optimal packaging dimensions to reduce shipping expenses. These scenarios share a common thread—they all require finding maximum or minimum values using calculus.

Optimization problems appear everywhere:

• Engineering: Designing bridges with maximum load capacity using minimum steel
• Economics: Finding production levels that maximize profit or minimize cost
• Medicine: Determining drug dosages that maximize effectiveness while minimizing side effects
• Technology: Optimizing algorithms for faster processing with lower energy consumption

Building on Previous Knowledge

In Lecture 9, we explored how derivatives help us approximate function values near specific points. Now we’ll use those same derivative concepts to locate where functions reach their highest and lowest values. The critical point analysis you’ll learn here connects directly to Newton’s method iterations from our previous session, where both techniques rely on understanding where derivatives equal zero or become undefined.

What You’ll Master Today

This lecture transforms theoretical calculus into practical problem-solving tools. You’ll learn systematic approaches to:

• Find Critical Points: Locate where functions might reach maximum or minimum values by analyzing first derivatives
• Classify Extrema: Use both first and second derivative tests to determine whether critical points represent peaks, valleys, or neither
• Solve Real Problems: Apply optimization strategies to geometric shapes, business scenarios, and engineering challenges
• Guarantee Solutions: Understand when the Extreme Value Theorem ensures optimal solutions exist

The Optimization Mindset

Unlike previous lectures that focused on understanding function behavior, optimization requires strategic thinking. You’ll develop a methodical approach: identify what needs optimizing, establish constraints, find candidates for optimal values, and verify your solutions make practical sense.

The mathematical tools remain familiar—derivatives, critical points, and function analysis—but their application becomes more purposeful. Instead of simply finding where slopes equal zero, you’ll determine whether those points represent the best possible outcomes for real-world problems.

Ready to Optimize?

By the end of this session, you’ll confidently tackle optimization challenges that initially seem overwhelming. Whether calculating the dimensions for maximum-volume containers or finding production levels for minimum costs, you’ll have a systematic toolkit for finding optimal solutions.

Let’s begin by establishing the mathematical foundation that guarantees optimal solutions exist, then build toward solving complex, multi-step optimization problems that mirror challenges you’ll encounter in professional settings.

1. Extreme Value Theorem and Fundamental Optimization Principles

1.1 Understanding the Mathematical Foundation

The Extreme Value Theorem guarantees that continuous functions on closed intervals always have maximum and minimum values. This theorem provides the mathematical certainty that optimal solutions exist for properly formulated problems.

Extreme Value Theorem Statement:

If f(x) is continuous on the closed interval [a, b], then f(x) has both an absolute maximum and an absolute minimum on that interval.

1.2 Key Requirements for Optimization

Three essential conditions ensure the theorem applies:

1. Continuity: The function must be continuous (no breaks, jumps, or holes)
2. Closed Interval: The domain must include its endpoints [a, b], not (a, b)
3. Bounded Domain: The interval must have finite endpoints

1.3 Practical Engineering Applications

Consider designing a cylindrical pressure vessel. The strength-to-weight ratio function is continuous over reasonable dimensional ranges, guaranteeing an optimal design exists within manufacturing constraints.

2. Critical Points: Identification and Mathematical Significance

2.1 Definition and Importance

Critical points are x-values where the derivative equals zero or doesn’t exist. These points are candidates for local extrema because the function’s rate of change transitions at these locations.

Mathematical Definition:

A critical point occurs at x = c if:

• f'(c) = 0, or
• f'(c) is undefined (but f(c) exists)

2.2 Systematic Method for Finding Critical Points

Step-by-Step Process:

1. Find the first derivative f'(x)
2. Set f'(x) = 0 and solve for x
3. Find values where f'(x) is undefined
4. Verify that f(x) exists at these points
5. List all critical points for further analysis

2.3 Types of Critical Points

Smooth Critical Points: Where f'(x) = 0

• Function has a horizontal tangent line
• Common in polynomial and trigonometric functions

Sharp Critical Points: Where f'(x) is undefined

• Function has corners or cusps
• Often involve absolute value or fractional power functions

3. First Derivative Test for Extrema Classification

3.1 The Sign Change Method

The first derivative test examines how f'(x) changes sign around critical points. This reveals whether the function increases or decreases, indicating the nature of each critical point.

3.2 Step-by-Step First Derivative Test

Procedure:

1. Find all critical points
2. Create a sign chart for f'(x)
3. Test f'(x) values slightly left and right of each critical point
4. Classify based on sign changes:
   • Local Maximum: f'(x) changes from positive to negative
   • Local Minimum: f'(x) changes from negative to positive
   • Neither: f'(x) doesn’t change sign

3.3 Practical Application Strategy

Create intervals between critical points and test points. Use simple test values to determine signs without complex calculations.

4. Second Derivative Test and Concavity Analysis

4.1Understanding Concavity

Concavity describes how a function curves. Upward concavity (f”(x) > 0) indicates the function curves like a smile, while downward concavity (f”(x) < 0) curves like a frown.

4.2 Second Derivative Test Procedure

For critical point x = c:

1. Calculate f”(c)
2. Apply the test:
   • f”(c) > 0: Local minimum (concave up)
   • f”(c) < 0: Local maximum (concave down)
   • f”(c) = 0: Test is inconclusive

4.3 Advantages and Limitations

Advantages:

• Quick classification when applicable
• Provides geometric insight through concavity
• Efficient for polynomial functions

Limitations:

• Fails when f”(c) = 0
• Requires computing second derivatives
• May be complex for complicated functions

5. Absolute versus Relative Extrema in Optimization

5.1 Global vs Local Optimization

• Absolute (Global) Extrema: The highest or lowest values over the entire domain
• Relative (Local) Extrema: The highest or lowest values in a neighborhood around a point

5.2 Finding Absolute Extrema on Closed Intervals

Complete Process:

1. Find all critical points in the interior
2. Evaluate f(x) at each critical point
3. Evaluate f(x) at both endpoints
4. Compare all values to determine the absolute maximum and minimum

5.3 Boundary Analysis Importance

Endpoints often contain absolute extrema, especially in constrained engineering problems. Always check boundary conditions in real-world applications.

6. Comprehensive Optimization Strategy and Methodology

6.1 Universal Optimization Approach

Phase 1: Problem Setup

1. Define the objective function clearly
2. Identify the domain and any constraints
3. Verify continuity requirements

Phase 2: Critical Point Analysis

1. Compute the first derivative
2. Find all critical points
3. Classify using first or second derivative tests

Phase 3: Boundary and Comparison

1. Evaluate function at endpoints (if applicable)
2. Compare all candidate values
3. Identify absolute extrema

Phase 4: Verification

1. Check that solutions satisfy original constraints
2. Verify mathematical accuracy
3. Interpret results in practical context

6.2 Domain Considerations

Engineering problems often have natural domains based on physical constraints. A beam length must be positive, efficiency percentages must stay between 0 and 100, and material properties must have realistic ranges.

7. Geometric Optimization Applications and Problem-Solving

7.1 Area Optimization Problems

Geometric optimization frequently involves maximizing or minimizing areas under various constraints. These problems teach fundamental optimization techniques while connecting to practical design situations.

7.2 Common Area Optimization Types:

• Rectangular enclosures with fixed perimeter
• Triangular areas with constraint relationships
• Circular sectors with angle or radius limitations
• Composite shapes with multiple constraints

7.3 Volume Optimization Applications

Three-dimensional optimization problems appear in container design, architectural planning, and manufacturing processes.

Typical Volume Problems:

• Cylindrical containers with surface area constraints
• Rectangular boxes with material limitations
• Spherical vessels with pressure considerations
• Complex shapes with manufacturing constraints

Surface Area Minimization

Minimizing surface area while maintaining volume is crucial in engineering design for cost reduction and efficiency improvement.

8. Economic and Business Optimization Applications

8.1 Cost Minimization Strategies

Engineering economics relies heavily on optimization to minimize costs while meeting performance requirements.

8.2 Cost Function Components:

• Fixed costs (independent of production level)
• Variable costs (proportional to production)
• Setup costs (one-time expenses)
• Maintenance costs (time-dependent)

8.3 Profit Maximization Models

Profit functions combine revenue and cost functions, creating optimization problems that determine optimal production levels.

Standard Profit Model:

P(x) = R(x) – C(x)

Where:

• P(x) = profit function
• R(x) = revenue function
• C(x) = cost function

8.4 Resource Allocation Problems

Limited resources require optimization to achieve maximum benefit. These problems appear in project management, material distribution, and time allocation.

50 Problem-Solving Examples with Detailed Solutions

Basic Critical Point Problems

Example 1: Finding Critical Points of Polynomial Functions

Find all critical points of f(x) = x³ – 6x² + 9x + 2

Technique Used: Basic differentiation and equation solving

Step-by-Step Solution:

1. Find the first derivative: f'(x) = 3x² – 12x + 9
2. Set f'(x) = 0: 3x² – 12x + 9 = 0
3. Factor out common term: 3(x² – 4x + 3) = 0
4. Factor quadratic: 3(x – 1)(x – 3) = 0
5. Solve for x: x = 1 or x = 3
6. Verify f(x) exists at both points: f(1) = 6, f(3) = 2

Answer: Critical points at x = 1 and x = 3

Example 2: Critical Points with Undefined Derivatives

Find all critical points of f(x) = x^(2/3) – 4x^(1/3)

Technique Used: Power rule with fractional exponents

Step-by-Step Solution:

1. Find the first derivative: f'(x) = (2/3)x^(-1/3) – (4/3)x^(-2/3)
2. Simplify: f'(x) = (2/3)x^(-1/3) – (4/3)x^(-2/3) = (2/3)x^(-2/3)(x^(1/3) – 2)
3. Set f'(x) = 0: (2/3)x^(-2/3)(x^(1/3) – 2) = 0
4. Solve x^(1/3) – 2 = 0: x^(1/3) = 2, so x = 8
5. Find where f'(x) is undefined: x^(-2/3) is undefined when x = 0
6. Verify f(x) exists: f(0) = 0, f(8) = 4 – 8 = -4

Answer: Critical points at x = 0 and x = 8

Example 3: Trigonometric Critical Points

Find all critical points of f(x) = sin(x) + cos(x) on [0, 2π]

Technique Used: Trigonometric differentiation

Step-by-Step Solution:

1. Find the first derivative: f'(x) = cos(x) – sin(x)
2. Set f'(x) = 0: cos(x) – sin(x) = 0
3. Rearrange: cos(x) = sin(x)
4. Divide by cos(x): 1 = tan(x)
5. Solve: x = π/4 or x = 5π/4 (in [0, 2π])
6. Verify: f(π/4) = √2, f(5π/4) = -√2

Answer: Critical points at x = π/4 and x = 5π/4

First Derivative Test Applications

Example 4: Classifying Critical Points with Sign Charts

Classify all critical points of f(x) = x³ – 3x² – 9x + 5

Technique Used: First derivative test with sign analysis

Step-by-Step Solution:

1. Find f'(x): f'(x) = 3x² – 6x – 9 = 3(x² – 2x – 3) = 3(x – 3)(x + 1)
2. Critical points: x = -1 and x = 3
3. Create intervals: (-∞, -1), (-1, 3), (3, ∞)
4. Test signs:
   • x = -2: f'(-2) = 3(-5)(1) = -15 < 0
   • x = 0: f'(0) = 3(-3)(-1) = 9 > 0
   • x = 4: f'(4) = 3(1)(5) = 15 > 0
5. Sign chart: f'(x): – + +
   • At x = -1: negative to positive → local minimum
   • At x = 3: positive to positive → neither (error in analysis)

Let me recalculate step 4:

• x = -2: f'(-2) = 3(-2-3)(-2+1) = 3(-5)(-1) = 15 > 0
• x = 0: f'(0) = 3(0-3)(0+1) = 3(-3)(1) = -9 < 0
• x = 4: f'(4) = 3(4-3)(4+1) = 3(1)(5) = 15 > 0

Corrected sign chart: f'(x): + – +

• At x = -1: positive to negative → local maximum
• At x = 3: negative to positive → local minimum

Answer: Local maximum at x = -1, local minimum at x = 3

Example 5: Rational Function Critical Point Classification

Find and classify critical points of f(x) = x/(x² + 1)

Technique Used: Quotient rule and first derivative test

Step-by-Step Solution:

1. Find f'(x) using quotient rule:
2. f'(x) = [(x² + 1)(1) – x(2x)]/(x² + 1)²
3. Simplify: f'(x) = (x² + 1 – 2x²)/(x² + 1)² = (1 – x²)/(x² + 1)²
4. Set f'(x) = 0: 1 – x² = 0, so x = ±1
5. Test intervals: (-∞, -1), (-1, 1), (1, ∞)
6. Sign analysis:
   • x = -2: f'(-2) = (1 – 4)/25 = -3/25 < 0
   • x = 0: f'(0) = (1 – 0)/1 = 1 > 0
   • x = 2: f'(2) = (1 – 4)/25 = -3/25 < 0
7. Classification:
   • At x = -1: negative to positive → local minimum
   • At x = 1: positive to negative → local maximum

Answer: Local minimum at x = -1, local maximum at x = 1

Second Derivative Test Applications

Example 6: Second Derivative Test on Polynomial

Use the second derivative test to classify critical points of f(x) = 2x³ – 15x² + 24x + 7

Technique Used: Second derivative test

Step-by-Step Solution:

1. Find f'(x): f'(x) = 6x² – 30x + 24 = 6(x² – 5x + 4) = 6(x – 1)(x – 4)
2. Critical points: x = 1 and x = 4
3. Find f”(x): f”(x) = 12x – 30
4. Apply the second derivative test:
   • f”(1) = 12(1) – 30 = -18 < 0 → local maximum
   • f”(4) = 12(4) – 30 = 18 > 0 → local minimum
5. Find function values: f(1) = 18, f(4) = -25

Answer: Local maximum at (1, 18), local minimum at (4, -25)

Example 7: Inconclusive Second Derivative Test

Analyze f(x) = x⁴ – 4x³ using both derivative tests

Technique Used: Second derivative test with first derivative backup

Step-by-Step Solution:

1. Find f'(x): f'(x) = 4x³ – 12x² = 4x²(x – 3)
2. Critical points: x = 0 and x = 3
3. Find f”(x): f”(x) = 12x² – 24x = 12x(x – 2)
4. Second derivative test:
   • f”(0) = 0 → inconclusive
   • f”(3) = 12(3)(1) = 36 > 0 → local minimum
5. First derivative test for x = 0:
   • Test x = -1: f'(-1) = 4(-1)² (-1-3) = -16 < 0
   • Test x = 1: f'(1) = 4(1)²(1-3) = -8 < 0
   • No sign change → neither maximum nor minimum

Answer: x = 0 is neither; local minimum at x = 3

Absolute Extrema Problems

Example 8: Absolute Extrema on Closed Interval

Find absolute maximum and minimum of f(x) = x³ – 6x² + 9x on [0, 5]

Technique Used: Complete extrema analysis on a closed interval

Step-by-Step Solution:

1. Find critical points: f'(x) = 3x² – 12x + 9 = 3(x – 1)(x – 3)
2. Critical points in [0, 5]: x = 1 and x = 3
3. Evaluate function at critical points and endpoints:
   • f(0) = 0
   • f(1) = 1 – 6 + 9 = 4
   • f(3) = 27 – 54 + 27 = 0
   • f(5) = 125 – 150 + 45 = 20
4. Compare values: 0, 4, 0, 20
5. Identify extrema: maximum = 20 at x = 5, minimum = 0 at x = 0 and x = 3

Answer: Absolute maximum: 20 at x = 5; Absolute minimum: 0 at x = 0 and x = 3

Example 9: Absolute Extrema with Endpoint Analysis

Find absolute extrema of f(x) = x²e^(-x) on [0, 3]

Technique Used: Product rule differentiation with endpoint evaluation

Step-by-Step Solution:

1. Find f'(x) using product rule: f'(x) = 2xe^(-x) + x²(-e^(-x)) = xe^(-x)(2 – x)
2. Set f'(x) = 0: xe^(-x)(2 – x) = 0
3. Solutions: x = 0 or x = 2 (e^(-x) never equals 0)
4. Critical points in [0, 3]: x = 0 and x = 2
5. Evaluate at critical points and endpoints:
   • f(0) = 0
   • f(2) = 4e^(-2) ≈ 0.541
   • f(3) = 9e^(-3) ≈ 0.448
6. Compare values to find extrema

Answer: Absolute maximum: 4e^(-2) at x = 2; Absolute minimum: 0 at x = 0

Area Optimization Problems

Example 10: Rectangular Enclosure with Fixed Perimeter

Find the dimensions of a rectangle with a perimeter of 100 m that maximizes the area

Technique Used: Constraint substitution and single-variable optimization

Step-by-Step Solution:

1. Define variables: length = x, width = y
2. Constraint: 2x + 2y = 100, so y = 50 – x
3. Objective function: A(x) = xy = x(50 – x) = 50x – x²
4. Domain: 0 < x < 50 (physical constraints)
5. Find A'(x): A'(x) = 50 – 2x
6. Set A'(x) = 0: 50 – 2x = 0, so x = 25
7. Check second derivative: A”(x) = -2 < 0 → maximum
8. Find y: y = 50 – 25 = 25
9. Maximum area: A(25) = 25 × 25 = 625 m²

Answer: Square with sides 25 m each, maximum area = 625 m²

Example 11: Triangle Area Optimization

A triangle has a base on the x-axis from (0,0) to (4,0) and a third vertex at (t, h). If the perimeter is 12, find t that maximizes area.

Technique Used: Geometric constraint optimization

Step-by-Step Solution:

1. Triangle vertices: (0,0), (4,0), (t,h)
2. Side lengths: base = 4, side1 = √(t² + h²), side2 = √((t-4)² + h²)
3. Perimeter constraint: 4 + √(t² + h²) + √((t-4)² + h²) = 12
4. Simplify: √(t² + h²) + √((t-4)² + h²) = 8
5. Area function: A = (1/2) × base × height = (1/2) × 4 × h = 2h
6. From the constraint, express h in terms of t (complex algebra)
7. This requires advanced techniques beyond basic optimization

Note: This problem requires more advanced methods and will be simplified for instructional purposes.

Simplified Answer: Maximum area occurs when the triangle is isosceles with t = 2

Example 12: Cylinder Volume with Surface Area Constraint

Find the dimensions of a cylindrical can with a surface area of 100π that maximizes volume

Technique Used: Lagrange method converted to substitution

Step-by-Step Solution:

1. Variables: radius = r, height = h
2. Surface area constraint: 2πr² + 2πrh = 100π
3. Simplify constraint: 2r² + 2rh = 100, so h = (50 – r²)/r
4. Volume function: V(r) = πr²h = πr² × (50 – r²)/r = π(50r – r³)
5. Domain: 0 < r < √50 (h must be positive)
6. Find V'(r): V'(r) = π(50 – 3r²)
7. Set V'(r) = 0: 50 – 3r² = 0, so r² = 50/3, r = √(50/3)
8. Find h: h = (50 – 50/3)/(√(50/3)) = (100/3)/(√(50/3)) = (100√3)/(3√50) = (20√6)/9
9. Check second derivative: V”(r) = -6πr < 0 → maximum

Answer: r = √(50/3), h = (20√6)/9

Volume Optimization Problems

Example 13: Box Volume from a Square Sheet

A square sheet of cardboard with a side length of 12 inches has squares cut from each corner. Find the side length of the cut squares that maximizes the volume of the resulting box.

Technique Used: Geometric constraint with volume maximization

Step-by-Step Solution:

1. Let x = side length of cut squares
2. Box dimensions after folding:
   • Length = 12 – 2x
   • Width = 12 – 2x
   • Height = x
3. Volume function: V(x) = x(12 – 2x)² = x(144 – 48x + 4x²) = 144x – 48x² + 4x³
4. Domain: 0 < x < 6 (physical constraints)
5. Find V'(x): V'(x) = 144 – 96x + 12x²
6. Set V'(x) = 0: 12x² – 96x + 144 = 0
7. Simplify: x² – 8x + 12 = 0
8. Factor: (x – 2)(x – 6) = 0
9. Solutions: x = 2 or x = 6
10. Since domain is 0 < x < 6, only x = 2 is valid
11. Check second derivative: V”(x) = -96 + 24x; V”(2) = -48 < 0 → maximum

Answer: Cut squares with a side length of 2 inches for a maximum volume of 128 cubic inches

Example 14: Cylindrical Container Cost Minimization

Design a cylindrical container with a volume of 1000 cubic inches where the bottom costs twice as much per square inch as the sides. Find dimensions that minimize cost.

Technique Used: Cost function optimization with constraint

Step-by-Step Solution:

1. Variables: radius = r, height = h
2. Volume constraint: πr²h = 1000, so h = 1000/(πr²)
3. Cost function: C = (cost per unit)(area)
   • Bottom area: πr² at cost 2k per square inch = 2kπr²
   • Side area: 2πrh at cost k per square inch = 2kπrh
   • Total: C(r) = 2kπr² + 2kπrh
4. Substitute h: C(r) = 2kπr² + 2kπr × 1000/(πr²) = 2kπr² + 2000k/r
5. Find C'(r): C'(r) = 4kπr – 2000k/r²
6. Set C'(r) = 0: 4kπr – 2000k/r² = 0
7. Solve: 4πr = 2000/r², so r³ = 500/π, r = ∛(500/π)
8. Find h: h = 1000/(π × (500/π)^(2/3)) = 1000π^(-1/3)/500^(2/3) = 2∛(500/π)

Answer: r = ∛(500/π) inches, h = 2∛(500/π) inches

Economic Optimization Problems

Example 15: Profit Maximization

A company’s profit function is P(x) = -x³ + 12x² + 60x – 100, where x is thousands of units produced. Find the production level that maximizes profit.

Technique Used: Business optimization with cubic profit function

Step-by-Step Solution:

1. Profit function: P(x) = -x³ + 12x² + 60x – 100
2. Find P'(x): P'(x) = -3x² + 24x + 60
3. Set P'(x) = 0: -3x² + 24x + 60 = 0
4. Divide by -3: x² – 8x – 20 = 0
5. Factor: (x – 10)(x + 2) = 0
6. Solutions: x = 10 or x = -2
7. Since x represents production, x ≥ 0, so x = 10
8. Check second derivative: P”(x) = -6x + 24; P”(10) = -36 < 0 → maximum
9. Maximum profit: P(10) = -1000 + 1200 + 600 – 100 = 700

Answer: Produce 10,000 units for a maximum profit of $700,000

Example 16: Cost Minimization with Production Constraints

A manufacturer has a cost function C(x) = x³ – 6x² + 15x + 80. Find the production level that minimizes the average cost per unit.

Technique Used: Average cost optimization

Step-by-Step Solution:

1. Cost function: C(x) = x³ – 6x² + 15x + 80
2. Average cost function: A(x) = C(x)/x = x² – 6x + 15 + 80/x
3. Find A'(x): A'(x) = 2x – 6 – 80/x²
4. Set A'(x) = 0: 2x – 6 – 80/x² = 0
5. Multiply by x²: 2x³ – 6x² – 80 = 0
6. Simplify: x³ – 3x² – 40 = 0
7. Try x = 4: 64 – 48 – 40 = -24 ≠ 0
8. Try x = 5: 125 – 75 – 40 = 10 ≠ 0
9. Use numerical methods or graphing: x ≈ 4.36
10. Verify the minimum with the second derivative test

Answer: Approximately 4.36 units minimizes the average cost

Advanced Critical Point Problems

Example 17: Exponential Function Optimization

Find extrema of f(x) = xe^(-x²) on the interval [-2, 2]

Technique Used: Product rule with exponential function

Step-by-Step Solution:

1. Find f'(x) using product rule: f'(x) = e^(-x²) + x(-2x)e^(-x²) = e^(-x²)(1 – 2x²)
2. Set f'(x) = 0: e^(-x²)(1 – 2x²) = 0
3. Since e^(-x²) > 0 always: 1 – 2x² = 0
4. Solve: x² = 1/2, so x = ±1/√2 = ±√2/2
5. Both critical points are in [-2, 2]
6. Evaluate at critical points and endpoints:
   • f(-2) = -2e^(-4) ≈ -0.037
   • f(-√2/2) = -√2/2 × e^(-1/2) ≈ -0.429
   • f(√2/2) = √2/2 × e^(-1/2) ≈ 0.429
   • f(2) = 2e^(-4) ≈ 0.037

Answer:

• Absolute maximum: √2/(2e^(1/2)) at x = √2/2;
• Absolute minimum: -√2/(2e^(1/2)) at x = -√2/2

Example 18: Logarithmic Function Optimization

Find the maximum value of f(x) = x – ln(x) for x > 0

Technique Used: Logarithmic differentiation

Step-by-Step Solution:

1. Domain: x > 0 (required for ln(x))
2. Find f'(x): f'(x) = 1 – 1/x = (x – 1)/x
3. Set f'(x) = 0: (x – 1)/x = 0, so x – 1 = 0, x = 1
4. Check sign of f'(x):
   • For 0 < x < 1: f'(x) < 0 (decreasing)
   • For x > 1: f'(x) > 0 (increasing)
5. x = 1 gives local minimum, not maximum
6. Analyze end behavior:
   • As x → 0⁺: f(x) → +∞
   • As x → +∞: f(x) → +∞
7. Function has no maximum value; minimum at x = 1

Answer: No maximum exists; minimum value f(1) = 1 at x = 1

Surface Area Optimization

Example 19: Minimum Surface Area for Fixed Volume

Find the dimensions of a cylindrical can with a volume of 500 cm³ that minimizes the surface area

Technique Used: Surface area minimization with volume constraint

Step-by-Step Solution:

1. Volume constraint: πr²h = 500, so h = 500/(πr²)
2. Surface area function: S = 2πr² + 2πrh (top, bottom, and sides)
3. Substitute h: S(r) = 2πr² + 2πr × 500/(πr²) = 2πr² + 1000/r
4. Find S'(r): S'(r) = 4πr – 1000/r²
5. Set S'(r) = 0: 4πr – 1000/r² = 0
6. Solve: 4πr = 1000/r², so r³ = 1000/(4π) = 250/π
7. Therefore: r = ∛(250/π)
8. Find h: h = 500/(π × (250/π)^(2/3)) = 500 × π^(-1/3)/(π × 250^(2/3)) = 2∛(250/π)
9. Check: h = 2r (optimal cylinder has h = 2r)

Answer: r = ∛(250/π) cm, h = 2∛(250/π) cm

Example 20: Box with Open Top

Find dimensions of rectangular box with open top, volume 32 cubic feet, that uses minimum material

Technique Used: Surface area minimization with volume constraint

Step-by-Step Solution:

1. Variables: length = x, width = y, height = z
2. Volume constraint: xyz = 32, so z = 32/(xy)
3. Surface area (no top): S = xy + 2xz + 2yz (bottom and four sides)
4. Substitute z: S(x,y) = xy + 2x(32/(xy)) + 2y(32/(xy)) = xy + 64/y + 64/x
5. For symmetric solution, try x = y: S(x) = x² + 64/x + 64/x = x² + 128/x
6. Find S'(x): S'(x) = 2x – 128/x²
7. Set S'(x) = 0: 2x – 128/x² = 0, so 2x³ = 128, x³ = 64, x = 4
8. Since x = y = 4: z = 32/(4×4) = 2
9. Verify minimum: S”(x) = 2 + 256/x³; S”(4) = 2 + 4 = 6 > 0 ✓

Answer: 4 ft × 4 ft × 2 ft box uses minimum material

Complex Optimization Problems

Example 21: Pipeline Cost Optimization

A pipeline must connect a refinery at point A(0,0) to a distribution center at B(6,4). The cost is $3000 per mile over land and $5000 per mile underwater. The shoreline is the x-axis. Find the optimal route.

Technique Used: Geometric optimization with cost analysis

Step-by-Step Solution:

1. Let pipeline go from A(0,0) to point P(x,0) on shore, then to B(6,4)
2. Distance over land: AP = x
3. Distance underwater: PB = √[(6-x)² + 4²] = √[(6-x)² + 16]
4. Total cost: C(x) = 3000x + 5000√[(6-x)² + 16]
5. Find C'(x): C'(x) = 3000 + 5000 × (6-x)(-1)/√[(6-x)² + 16]
6. Simplify: C'(x) = 3000 – 5000(6-x)/√[(6-x)² + 16]
7. Set C'(x) = 0: 3000 = 5000(6-x)/√[(6-x)² + 16]
8. Cross multiply: 3√[(6-x)² + 16] = 5(6-x)
9. Square both sides: 9[(6-x)² + 16] = 25(6-x)²
10. Expand: 9(6-x)² + 144 = 25(6-x)²
11. Simplify: 144 = 16(6-x)², so (6-x)² = 9, 6-x = 3, x = 3

Answer: Optimal point is P(3,0), total minimum cost = $24,000

Example 22: Ladder Around Corner Problem

Find the length of the longest ladder that can be carried horizontally around a corner where a 3-foot wide hallway meets a 4-foot wide hallway.

Technique Used: Geometric constraint optimization

Step-by-Step Solution:

1. Set up coordinate system with corner at origin
2. Ladder touches both outer walls at points (3, y) and (x, 4)
3. Ladder equation: line through (3, y) and (x, 4)
4. Slope: m = (4-y)/(x-3)
5. Line must pass through corner region, touching both walls
6. Length function: L = √[(x-3)² + (4-y)²]
7. Constraint from geometry: the line y-4 = m(x-3) must pass through (0,0)
8. Substituting: -4 = m(-3), so m = 4/3
9. Therefore: (4-y)/(x-3) = 4/3
10. Also, line through (0,0) and (3,y): slope = y/3
11. And through (0,0) and (x,4): slope = 4/x
12. For tangency: y/3 = 4/x, so y = 12/x
13. Substitute into constraint: (4-12/x)/(x-3) = 4/3
14. Solve: 3(4-12/x) = 4(x-3)
15. 12 – 36/x = 4x – 12
16. 24 = 4x + 36/x
17. 6x = x² + 9, so x² – 6x + 9 = 0, (x-3)² = 0, x = 3

This approach needs revision. Let me use a parametric approach:

Alternative solution using angle parameter θ:

1. Ladder makes an angle θ with the horizontal
2. Length L = 3/sin(θ) + 4/cos(θ)
3. Find dL/dθ = -3cos(θ)/sin²(θ) + 4sin(θ)/cos²(θ)
4. Set dL/dθ = 0: 3cos³(θ) = 4sin³(θ)
5. Solve: tan³(θ) = 3/4, so tan(θ) = ∛(3/4)
6. Calculate the minimum length using this angle

Answer: L = (3^(2/3) + 4^(2/3))^(3/2) ≈ 9.87 feet

Revenue and Demand Optimization

Example 23: Price-Demand Optimization

A company finds that when price is p dollars, demand is q = 1000 – 2p² units. Find the price that maximizes revenue.

Technique Used: Revenue maximization with demand function

Step-by-Step Solution:

1. Demand function: q = 1000 – 2p²
2. Revenue function: R(p) = p × q = p(1000 – 2p²) = 1000p – 2p³
3. Domain: p ≥ 0 and q ≥ 0, so 1000 – 2p² ≥ 0, p² ≤ 500, p ≤ √500 = 10√5
4. Find R'(p): R'(p) = 1000 – 6p²
5. Set R'(p) = 0: 1000 – 6p² = 0, p² = 1000/6 = 500/3
6. Solve: p = √(500/3) = 10√(5/3) = 10√15/3
7. Check second derivative: R”(p) = -12p; R”(p*) < 0 → maximum
8. Maximum revenue: R(10√15/3) = 1000(10√15/3) – 2(10√15/3)³

Answer: Optimal price p = 10√15/3 ≈ $12.91

Example 24: Production Cost Analysis

A factory has daily fixed costs of $400 and variable costs of C(x) = 0.05x² + 2x dollars for x units. If the selling price is $12 per unit, find the production level that maximizes profit.

Technique Used: Profit optimization with quadratic costs

Step-by-Step Solution:

1. Total cost: TC(x) = 400 + 0.05x² + 2x
2. Revenue: R(x) = 12x
3. Profit: P(x) = R(x) – TC(x) = 12x – (400 + 0.05x² + 2x) = 10x – 0.05x² – 400
4. Find P'(x): P'(x) = 10 – 0.1x
5. Set P'(x) = 0: 10 – 0.1x = 0, x = 100
6. Check second derivative: P”(x) = -0.1 < 0 → maximum
7. Maximum profit: P(100) = 10(100) – 0.05(100)² – 400 = 1000 – 500 – 400 = 100
8. Verify this is profitable: break-even when P(x) = 0
   1. 10x – 0.05x² – 400 = 0
   2. 0.05x² – 10x + 400 = 0
   3. x² – 200x + 8000 = 0
9. Using quadratic formula: x = (200 ± √(40000 – 32000))/2 = (200 ± √8000)/2 x = (200 ± 89.44)/2, so x ≈ 55.3 or x ≈ 144.7
10. Profit is positive between these values, confirming that x = 100 is profitable.

Answer: Produce 100 units for a maximum profit of $100

Geometric Rate Problems

Example 25: Related Rates in Optimization

A balloon is being inflated so its radius increases at 2 cm/sec. At what rate is the surface area increasing when the radius is 10 cm?

Technique Used: Related rates with surface area optimization

Step-by-Step Solution:

1. Given: dr/dt = 2 cm/sec
2. Surface area of sphere: S = 4πr²
3. Find dS/dt using chain rule: dS/dt = dS/dr × dr/dt
4. Calculate dS/dr: dS/dr = 8πr
5. Substitute: dS/dt = 8πr × 2 = 16πr
6. When r = 10: dS/dt = 16π(10) = 160π cm²/sec

Answer: Surface area increases at 160π ≈ 502.7 cm²/sec when r = 10 cm

Example 26: Minimizing Distance

Find the point on the curve y = x² closest to the point (2, 1).

Technique Used: Distance minimization using calculus

Step-by-Step Solution:

1. Point on curve: (x, x²)
2. Distance to (2, 1): d = √[(x-2)² + (x²-1)²]
3. To minimize d, minimize d² = (x-2)² + (x²-1)²
4. Let f(x) = (x-2)² + (x²-1)² = (x-2)² + (x²-1)²
5. Expand: f(x) = x² – 4x + 4 + x⁴ – 2x² + 1 = x⁴ – x² – 4x + 5
6. Find f'(x): f'(x) = 4x³ – 2x – 4
7. Set f'(x) = 0: 4x³ – 2x – 4 = 0, or 2x³ – x – 2 = 0
8. This cubic equation requires numerical methods
9. By inspection or numerical methods: x ≈ 1.175
10. Verify with the second derivative test

Answer: Closest point is approximately (1.175, 1.38)

Advanced Economic Applications

Example 27: Inventory Cost Optimization

A store sells 1000 units per year, ordering costs $50 per order, holding costs $2 per unit per year. Find optimal order quantity.

Technique Used: Economic Order Quantity (EOQ) model

Step-by-Step Solution:

1. Annual demand: D = 1000 units
2. Ordering cost: S = $50 per order
3. Holding cost: H = $2 per unit per year
4. Let Q = order quantity
5. Number of orders per year: D/Q = 1000/Q
6. Annual ordering cost: (D/Q) × S = 50000/Q
7. Average inventory: Q/2
8. Annual holding cost: (Q/2) × H = Q
9. Total cost: TC(Q) = 50000/Q + Q
10. Find TC'(Q): TC'(Q) = -50000/Q² + 1
11. Set TC'(Q) = 0: -50000/Q² + 1 = 0, Q² = 50000, Q = √50000 = 100√5
12. Q = 100√5 ≈ 223.6 units

Answer: Optimal order quantity is approximately 224 units

Example 28: Worker Productivity Optimization

Output per worker follows P(t) = 20t – t², where t is hours worked per day. Find optimal hours to maximize total daily output with 8 workers.

Technique Used: Productivity function optimization

Step-by-Step Solution:

1. Output per worker: P(t) = 20t – t²
2. Total output with 8 workers: T(t) = 8P(t) = 8(20t – t²) = 160t – 8t²
3. Find T'(t): T'(t) = 160 – 16t
4. Set T'(t) = 0: 160 – 16t = 0, t = 10
5. Check second derivative: T”(t) = -16 < 0 → maximum
6. Maximum total output: T(10) = 160(10) – 8(100) = 1600 – 800 = 800

Answer: Optimal working time is 10 hours per day for maximum output of 800 units

Calculus-Based Physics Problems

Example 29: Projectile Range Optimization

A projectile is launched with initial speed v₀ at angle θ. Find the angle that maximizes range.

Technique Used: Range function optimization

Step-by-Step Solution:

1. Range formula: R = (v₀²sin(2θ))/g
2. To maximize R, maximize sin(2θ)
3. Find dR/dθ: dR/dθ = (v₀²/g) × 2cos(2θ)
4. Set dR/dθ = 0: 2cos(2θ) = 0, cos(2θ) = 0
5. Solve: 2θ = π/2, so θ = π/4 = 45°
6. Check second derivative: d²R/dθ² = -(v₀²/g) × 4sin(2θ)
7. At θ = π/4: d²R/dθ² = -4v₀²/g < 0 → maximum

Answer: Maximum range occurs at 45° launch angle

Example 30: Electrical Power Optimization

In a circuit with voltage V and total resistance R = r + R_L (internal + load), find the load resistance that maximizes power delivered to the load.

Technique Used: Power transfer theorem optimization

Step-by-Step Solution:

1. Current: I = V/(r + R_L)
2. Power to load: P = I²R_L = V²R_L/(r + R_L)²
3. Find dP/dR_L using quotient rule: dP/dR_L = V²[(r + R_L)² – R_L × 2(r + R_L)]/(r + R_L)⁴
4. Simplify: dP/dR_L = V²[(r + R_L) – 2R_L]/(r + R_L)³ = V²(r – R_L)/(r + R_L)³
5. Set dP/dR_L = 0: r – R_L = 0, so R_L = r
6. Check the second derivative to confirm the maximum

Answer: Maximum power transfer when load resistance equals internal resistance

Optimization with Absolute Values

Example 31: Absolute Value Function Optimization

Find extrema of f(x) = |x² – 4| on [-3, 3]

Technique Used: Piecewise analysis of the absolute value function

Step-by-Step Solution:

1. Find where x² – 4 = 0: x = ±2
2. Analyze sign of x² – 4:
   • For x ∈ [-3, -2]: x² – 4 > 0, so f(x) = x² – 4
   • For x ∈ [-2, 2]: x² – 4 < 0, so f(x) = -(x² – 4) = 4 – x²
   • For x ∈ [2, 3]: x² – 4 > 0, so f(x) = x² – 4
3. Find derivatives on each interval:
   • On (-3, -2): f'(x) = 2x
   • On (-2, 2): f'(x) = -2x
   • On (2, 3): f'(x) = 2x
4. Critical points within intervals:
   • On (-3, -2): 2x = 0 gives x = 0, but 0 ∉ (-3, -2)
   • On (-2, 2): -2x = 0 gives x = 0
   • On (2, 3): 2x = 0 gives x = 0, but 0 ∉ (2, 3)
5. Check points where derivative doesn’t exist: x = -2, 2
6. Evaluate at critical points and endpoints:
   • f(-3) = |9 – 4| = 5
   • f(-2) = |4 – 4| = 0
   • f(0) = |0 – 4| = 4
   • f(2) = |4 – 4| = 0
   • f(3) = |9 – 4| = 5

Answer: Absolute maximum: 5 at x = ±3; Absolute minimum: 0 at x = ±2

Optimization with Constraints

Example 32: Lagrange Multiplier Introduction

Find extrema of f(x,y) = x² + y² subject to constraint x + y = 4 (simplified approach)

Technique Used: Substitution method for constrained optimization

Step-by-Step Solution:

1. Constraint: x + y = 4, so y = 4 – x
2. Substitute into objective: f(x) = x² + (4-x)² = x² + 16 – 8x + x² = 2x² – 8x + 16
3. Find f'(x): f'(x) = 4x – 8
4. Set f'(x) = 0: 4x – 8 = 0, x = 2
5. Find y: y = 4 – 2 = 2
6. Check second derivative: f”(x) = 4 > 0 → minimum
7. Minimum value: f(2,2) = 4 + 4 = 8

Answer: Minimum value 8 at point (2, 2)

Rate of Change Applications

Example 33: Marginal Analysis

Cost function C(x) = 0.01x³ – 0.6x² + 13x + 1000. Find the production level where marginal cost equals average cost.

Technique Used: Marginal and average cost analysis

Step-by-Step Solution:

1. Cost function: C(x) = 0.01x³ – 0.6x² + 13x + 1000
2. Marginal cost: MC(x) = C'(x) = 0.03x² – 1.2x + 13
3. Average cost: AC(x) = C(x)/x = 0.01x² – 0.6x + 13 + 1000/x
4. Set MC(x) = AC(x): 0.03x² – 1.2x + 13 = 0.01x² – 0.6x + 13 + 1000/x
5. Simplify: 0.02x² – 0.6x = 1000/x
6. Multiply by x: 0.02x³ – 0.6x² = 1000
7. Rearrange: 0.02x³ – 0.6x² – 1000 = 0
8. Simplify: x³ – 30x² – 50000 = 0
9. This requires numerical methods: x ≈ 50

Answer: Marginal cost equals average cost at approximately x = 50 units

Implicit Differentiation in Optimization

Example 34: Optimization with Implicit Functions

Find the maximum value of xy subject to x² + y² = 25

Technique Used: Substitution with circular constraint

Step-by-Step Solution:

1. Constraint: x² + y² = 25 (circle of radius 5)
2. From constraint: y = ±√(25 – x²)
3. Objective: f(x) = x(±√(25 – x²)) = ±x√(25 – x²)
4. For maximum, take positive: f(x) = x√(25 – x²)
5. Domain: -5 ≤ x ≤ 5
6. Find f'(x) using product rule:
   • f'(x) = √(25 – x²) + x × (-x)/√(25 – x²) = √(25 – x²) – x²/√(25 – x²)
7. Simplify: f'(x) = (25 – x² – x²)/√(25 – x²) = (25 – 2x²)/√(25 – x²)
8. Set f'(x) = 0: 25 – 2x² = 0, x² = 25/2, x = ±5/√2
9. For x = 5/√2: y = √(25 – 25/2) = 5/√2
10. Maximum value: xy = (5/√2)(5/√2) = 25/2

Answer: Maximum value is 25/2 at points (5/√2, 5/√2) and (-5/√2, -5/√2)

Optimization in Engineering Design

Example 35: Beam Strength Optimization

A rectangular beam is cut from a circular log with a diameter of 20 inches. Find dimensions of the rectangular cross-section that maximizes the moment of inertia I = (1/12)bh³, where b is the width and h is the height.

Technique Used: Engineering optimization with circular constraint

Step-by-Step Solution:

1. Constraint from circular log: b² + h² = 20² = 400 (inscribed rectangle in circle)
2. From constraint: b = √(400 – h²)
3. Moment of inertia: I(h) = (1/12)√(400 – h²) × h³ = (h³√(400 – h²))/12
4. Domain: 0 < h < 20 (h must be positive and less than the diameter)
5. Find I'(h) using product rule: I'(h) = (1/12)[3h²√(400 – h²) + h³ × (-h)/√(400 – h²)]
6. Simplify: I'(h) = (h²/12)[3√(400 – h²) – h²/√(400 – h²)]
7. Factor: I'(h) = (h²/12) × [3(400 – h²) – h²]/√(400 – h²)
8. Simplify numerator: 3(400 – h²) – h² = 1200 – 3h² – h² = 1200 – 4h²
9. Set I'(h) = 0: 1200 – 4h² = 0 (since h² > 0)
10. Solve: h² = 300, h = √300 = 10√3 ≈ 17.32 inches
11. Find b: b = √(400 – 300) = √100 = 10 inches
12. Check the second derivative or use engineering knowledge: this gives maximum
13. Maximum moment of inertia: I = (1/12)(10)(10√3)³ = (10 × 3000√3)/12 = 2500√3 in⁴

Answer: Optimal dimensions are b = 10 inches, h = 10√3 ≈ 17.32 inches for maximum I = 2500√3 in⁴

Complex Variable Problems

Example 36: Optimization with Trigonometric Functions

Find extrema of f(x) = 2sin(x) + cos(2x) on [0, 2π]

Technique Used: Trigonometric optimization

Step-by-Step Solution:

1. Find f'(x): f'(x) = 2cos(x) – 2sin(2x) = 2cos(x) – 4sin(x)cos(x) = 2cos(x)(1 – 2sin(x))
2. Set f'(x) = 0: 2cos(x)(1 – 2sin(x)) = 0
3. Solutions: cos(x) = 0 or 1 – 2sin(x) = 0
4. From cos(x) = 0: x = π/2, 3π/2
5. From 1 – 2sin(x) = 0: sin(x) = 1/2, so x = π/6, 5π/6
6. Evaluate at critical points and endpoints:
   • f(0) = 2sin(0) + cos(0) = 0 + 1 = 1
   • f(π/6) = 2sin(π/6) + cos(π/3) = 2(1/2) + 1/2 = 3/2
   • f(π/2) = 2sin(π/2) + cos(π) = 2(1) + (-1) = 1
   • f(5π/6) = 2sin(5π/6) + cos(5π/3) = 2(1/2) + 1/2 = 3/2
   • f(3π/2) = 2sin(3π/2) + cos(3π) = 2(-1) + (-1) = -3
   • f(2π) = 2sin(2π) + cos(4π) = 0 + 1 = 1

Answer: Maximum: 3/2 at x = π/6, 5π/6; Minimum: -3 at x = 3π/2

Word Problem Applications

Example 37: Fence Optimization Problem

A farmer has 200 feet of fencing to enclose a rectangular area and divide it into two equal parts with a fence parallel to one side. Find dimensions that maximize the enclosed area.

Technique Used: Area maximization with constraint

Step-by-Step Solution:

1. Let x = width, y = length
2. Fencing used: 2x + 3y = 200 (two widths plus three lengths)
3. From constraint: x = (200 – 3y)/2
4. Area: A(y) = xy = y(200 – 3y)/2 = (200y – 3y²)/2
5. Domain: 0 < y < 200/3 (physical constraints)
6. Find A'(y): A'(y) = (200 – 6y)/2 = 100 – 3y
7. Set A'(y) = 0: 100 – 3y = 0, y = 100/3
8. Find x: x = (200 – 3(100/3))/2 = (200 – 100)/2 = 50
9. Check second derivative: A”(y) = -3 < 0 → maximum
10. Maximum area: A = 50 × 100/3 = 5000/3 square feet

Answer: Dimensions 50 ft × 33⅓ ft for maximum area of 1666⅔ square feet

Example 38: Travel Time Optimization

A person at point A(0,1) wants to reach point B(4,0) by first traveling to some point P(x,0) on the x-axis at speed v₁ = 3, then from P to B at speed v₂ = 5. Find x that minimizes total travel time.

Technique Used: Travel time minimization (Snell’s law application)

Step-by-Step Solution:

1. Distance AP = √(x² + 1)
2. Distance PB = √((4-x)² + 0²) = |4-x| = 4-x (for 0 ≤ x ≤ 4)
3. Time AP = √(x² + 1)/3
4. Time PB = (4-x)/5
5. Total time: T(x) = √(x² + 1)/3 + (4-x)/5
6. Find T'(x): T'(x) = x/(3√(x² + 1)) – 1/5
7. Set T'(x) = 0: x/(3√(x² + 1)) = 1/5
8. Cross multiply: 5x = 3√(x² + 1)
9. Square both sides: 25x² = 9(x² + 1) = 9x² + 9
10. Simplify: 16x² = 9, x² = 9/16, x = 3/4

Answer: Optimal point P(3/4, 0) minimizes travel time

Advanced Applications

Example 39: Chemical Reaction Optimization

The concentration of a drug in the bloodstream follows C(t) = 5te^(-t/2) mg/L. Find when the concentration is maximum.

Technique Used: Product rule with exponential decay

Step-by-Step Solution:

1. Concentration: C(t) = 5te^(-t/2)
2. Find C'(t) using product rule: C'(t) = 5e^(-t/2) + 5t(-1/2)e^(-t/2)
3. Factor: C'(t) = 5e^(-t/2)(1 – t/2)
4. Set C'(t) = 0: 5e^(-t/2)(1 – t/2) = 0
5. Since e^(-t/2) > 0: 1 – t/2 = 0, t = 2
6. Check second derivative: C”(t) = 5(-1/2)e^(-t/2)(1 – t/2) + 5e^(-t/2)(-1/2)
7. At t = 2: C”(2) = 5(-1/2)e^(-1)(0) + 5e^(-1)(-1/2) = -5/(2e) < 0 → maximum
8. Maximum concentration: C(2) = 5(2)e^(-1) = 10/e ≈ 3.68 mg/L

Answer: Maximum concentration of 10/e mg/L occurs at t = 2 hours

Example 40: Satellite Trajectory Optimization

A satellite’s height above Earth follows h(t) = 400 + 50sin(t) – 10cos(2t) km. Find times when the satellite is at maximum height in the first orbit (0 ≤ t ≤ 2π).

Technique Used: Trigonometric function optimization

Step-by-Step Solution:

1. Height function: h(t) = 400 + 50sin(t) – 10cos(2t)
2. Find h'(t): h'(t) = 50cos(t) – 10(-sin(2t))(2) = 50cos(t) + 20sin(2t)
3. Since sin(2t) = 2sin(t)cos(t): h'(t) = 50cos(t) + 40sin(t)cos(t) = cos(t)(50 + 40sin(t))
4. Set h'(t) = 0: cos(t)(50 + 40sin(t)) = 0
5. Solutions: cos(t) = 0 or 50 + 40sin(t) = 0
6. From cos(t) = 0: t = π/2, 3π/2
7. From 50 + 40sin(t) = 0: sin(t) = -5/4 (impossible since |sin(t)| ≤ 1)
8. Evaluate at critical points and endpoints:
   • h(0) = 400 + 0 – 10 = 390
   • h(π/2) = 400 + 50 – 10(-1) = 460
   • h(3π/2) = 400 – 50 – 10(-1) = 360
   • h(2π) = 400 + 0 – 10 = 390

Answer: Maximum height of 460 km occurs at t = π/2

Example 41: Population Growth Optimization

A population follows P(t) = 1000/(1 + 9e^(-0.5t)). Find when the population growth rate is maximum.

Technique Used: Logistic growth rate optimization

Step-by-Step Solution:

1. Population: P(t) = 1000/(1 + 9e^(-0.5t))
2. Growth rate: P'(t) = dP/dt
3. Using quotient rule: P'(t) = 1000 × (-1)(1 + 9e^(-0.5t))^(-2) × 9e^(-0.5t) × (-0.5)
4. Simplify: P'(t) = 4500e^(-0.5t)/(1 + 9e^(-0.5t))^2
5. To find the maximum growth rate, find P”(t) and set it equal to zero
6. Let u = e^(-0.5t), then P'(t) = 4500u/(1 + 9u)^2
7. Maximum occurs when the denominator derivative equals zero or by calculus:
8. Maximum growth rate occurs when P(t) = 500 (half carrying capacity)
9. Solve: 500 = 1000/(1 + 9e^(-0.5t))
10. 1 + 9e^(-0.5t) = 2, so 9e^(-0.5t) = 1, e^(-0.5t) = 1/9
11. -0.5t = ln(1/9) = -ln(9), t = 2ln(9) ≈ 4.39

Answer: Maximum growth rate occurs at t = 2ln(9) ≈ 4.39 time units

Example 42: Electrical Circuit Optimization

In an RLC circuit, the impedance is Z = √(R² + (ωL – 1/(ωC))²). Find frequency ω that minimizes impedance when R = 10Ω, L = 0.1H, C = 0.001F.

Technique Used: Electrical impedance minimization

Step-by-Step Solution:

1. Impedance: Z(ω) = √(100 + (0.1ω – 1000/ω)²)
2. To minimize Z, minimize Z²: f(ω) = 100 + (0.1ω – 1000/ω)²
3. Let g(ω) = 0.1ω – 1000/ω, then f(ω) = 100 + g(ω)²
4. Find g'(ω): g'(ω) = 0.1 + 1000/ω²
5. For minimum f(ω), need g(ω) = 0: 0.1ω – 1000/ω = 0
6. Multiply by ω: 0.1ω² – 1000 = 0
7. ω² = 10000, ω = 100 rad/s (taking positive value)
8. Check: Z(100) = √(100 + 0) = 10Ω (minimum impedance = R)

Answer: Resonant frequency ω = 100 rad/s minimizes impedance to 10 Ω

Example 43: Material Science Optimization

The strength of a material follows S(T) = 500 – 0.2T² + 0.001T³, where T is the temperature in °C. Find the temperature that maximizes strength for 0 ≤ T ≤ 200.

Technique Used: Cubic function optimization

Step-by-Step Solution:

1. Strength function: S(T) = 500 – 0.2T² + 0.001T³
2. Find S'(T): S'(T) = -0.4T + 0.003T²
3. Set S'(T) = 0: -0.4T + 0.003T² = 0
4. Factor: T(-0.4 + 0.003T) = 0
5. Solutions: T = 0 or 0.003T = 0.4, T = 400/3 ≈ 133.33
6. Check domain: both T = 0 and T = 133.33 are in [0, 200]
7. Evaluate at critical points and endpoints:
   • S(0) = 500
   • S(133.33) = 500 – 0.2(133.33)² + 0.001(133.33)³ ≈ 500 – 3555.6 + 2370.4 ≈ -685.2
8. This gives negative strength, indicating an error. Let me recalculate:
   • S(133.33) = 500 – 0.2(17777.8) + 0.001(2370370) ≈ 500 – 3555.6 + 2370.4 ≈ -685.2

Let me verify the calculation:

• T = 400/3, T² = 160000/9, T³ = 64000000/27
• S(400/3) = 500 – 0.2(160000/9) + 0.001(64000000/27)
• = 500 – 32000/9 + 64000/27 = 500 – 3555.6 + 2370.4 ≈ -685.2

The calculation seems correct but gives a counterintuitive result. Let me check S(200):

• S(200) = 500 – 0.2(40000) + 0.001(8000000) = 500 – 8000 + 8000 = 500

Answer: Maximum strength of 500 occurs at T = 0°C and T = 200°C

Example 44: Fluid Dynamics Optimization

Water flows through a pipe with velocity v(r) = 4(1 – r²/R²) where r is the distance from the center and R is the pipe radius. Find the radius where shear stress τ = μ(dv/dr) is maximum for R = 2.

Technique Used: Fluid mechanics optimization

Step-by-Step Solution:

1. Velocity profile: v(r) = 4(1 – r²/4) = 4 – r²
2. Find velocity gradient: dv/dr = -2r
3. Shear stress: τ(r) = μ(-2r) = -2μr
4. Since we want maximum magnitude: |τ(r)| = 2μ|r|
5. Maximum |τ| occurs at maximum |r| within the pipe
6. For 0 ≤ r ≤ 2: maximum occurs at r = 2
7. Maximum shear stress: τ_max = 2μ(2) = 4μ

Answer: Maximum shear stress occurs at the pipe wall (r = R = 2) with magnitude 4μ

Example 45: Heat Transfer Optimization

Heat loss from a cylindrical pipe follows Q = 2πkL(T₁ – T₂)/ln(r₂/r₁) where r₁ is the inner radius, r₂ is the outer radius, L is the length, k is the thermal conductivity. For a fixed outer radius r₂ = 5 and a total wall thickness constraint, find r₁ that minimizes heat loss.

Technique Used: Heat transfer optimization

Step-by-Step Solution:

1. Heat loss: Q = 2πkL(T₁ – T₂)/ln(5/r₁)
2. To minimize Q, maximize ln(5/r₁) = ln(5) – ln(r₁)
3. This is maximized when ln(r₁) is minimized
4. Since r₁ > 0 and r₁ < 5, minimum ln(r₁) occurs at smallest possible r₁
5. However, we need additional constraints for a meaningful optimization problem
6. If we add a constraint that the wall thickness (5 – r₁) must equal some value t: r₁ = 5 – t, which gives a unique solution

Answer: Without additional constraints, minimum heat loss occurs as r₁ approaches 0

Example 46: Structural Engineering Optimization

A cantilever beam of length L = 10 ft supports a uniform load w = 100 lb/ft. The beam has a rectangular cross-section with fixed cross-sectional area A = bh = 20 in². If the maximum allowable deflection is 0.5 inches, find dimensions that minimize material cost. Given: E = 30×10⁶ psi. Deflection formula: δ = (5wL⁴)/(384EI).

Technique Used: Structural optimization with deflection constraint

Step-by-Step Solution:

1. Given data: L = 120 in, w = 100/12 = 8.33 lb/in, E = 30×10⁶ psi
2. Moment of inertia for rectangle: I = bh³/12
3. Area constraint: bh = 20, so b = 20/h
4. Substitute: I = (20/h)(h³)/12 = 20h²/12 = 5h²/3
5. Deflection: δ = (5wL⁴)/(384EI) = (5 × 8.33 × 120⁴)/(384 × 30×10⁶ × 5h²/3)
6. Simplify: δ = (5 × 8.33 × 207,360,000)/(384 × 30×10⁶ × 5h²/3)
7. δ = (8,640,000,000)/(1,920×10⁶ × h²) = 4.5/h²
8. Deflection constraint: δ ≤ 0.5, so 4.5/h² ≤ 0.5
9. Solve: h² ≥ 9, h ≥ 3 inches
10. For minimum material cost (assuming cost ∝ perimeter): minimize P = 2(b + h)
11. With b = 20/h: P(h) = 2(20/h + h) = 40/h + 2h
12. Find P'(h): P'(h) = -40/h² + 2
13. Set P'(h) = 0: -40/h² + 2 = 0, h² = 20, h = 2√5 ≈ 4.47 inches
14. Check constraint: h = 4.47 > 3 ✓ (satisfies deflection limit)
15. Find b: b = 20/4.47 ≈ 4.47 inches
16. Check second derivative: P”(h) = 80/h³ > 0 → minimum

Answer: Optimal dimensions are b = h = 2√5 ≈ 4.47 inches (square cross-section minimizes perimeter)

Example 47: Chemical Engineering Optimization

Reaction rate follows r = kC₁^a × C₂^b where concentrations satisfy C₁ + C₂ = 1. Find C₁ that maximizes rate when k = 1, a = 2, b = 1.

Technique Used: Chemical reaction optimization

Step-by-Step Solution:

1. Rate function: r = C₁² × C₂ with C₁ + C₂ = 1
2. Substitute C₂ = 1 – C₁: r(C₁) = C₁²(1 – C₁) = C₁² – C₁³
3. Domain: 0 ≤ C₁ ≤ 1
4. Find r'(C₁): r'(C₁) = 2C₁ – 3C₁²
5. Set r'(C₁) = 0: 2C₁ – 3C₁² = 0
6. Factor: C₁(2 – 3C₁) = 0
7. Solutions: C₁ = 0 or C₁ = 2/3
8. Check second derivative: r”(C₁) = 2 – 6C₁
   • r”(0) = 2 > 0 → local minimum
   • r”(2/3) = 2 – 4 = -2 < 0 → local maximum
9. Maximum rate: r(2/3) = (2/3)²(1/3) = 4/27

Answer: C₁ = 2/3, C₂ = 1/3 gives maximum reaction rate of 4/27

Example 48: Environmental Engineering

Pollutant concentration follows C(x) = 100e^(-x/2) + 50e^(-x) where x is the distance from the source. Find the location where the concentration decreases most rapidly.

Technique Used: Environmental optimization

Step-by-Step Solution:

1. Concentration: C(x) = 100e^(-x/2) + 50e^(-x)
2. Rate of decrease: -C'(x) = -(−50e^(-x/2) − 50e^(-x)) = 50e^(-x/2) + 50e^(-x)
3. To find the maximum rate of decrease, find the maximum of C'(x) magnitude
4. Find C'(x): C'(x) = 100(-1/2)e^(-x/2) + 50(-1)e^(-x) = -50e^(-x/2) – 50e^(-x)
5. Find C”(x): C”(x) = -50(-1/2)e^(-x/2) – 50(-1)e^(-x) = 25e^(-x/2) + 50e^(-x)
6. Set C”(x) = 0: 25e^(-x/2) + 50e^(-x) = 0
7. Factor: 25e^(-x/2)(1 + 2e^(-x/2)) = 0
8. Since exponentials are positive: 1 + 2e^(-x/2) ≠ 0
9. No critical points for C”(x), so check behavior of |C'(x)|
10. |C'(x)| = 50e^(-x/2) + 50e^(-x) decreases as x increases
11. Maximum rate of decrease occurs at x = 0

Answer: Most rapid concentration decrease occurs at source location (x = 0)

Example 49: Biomedical Engineering

Drug elimination follows concentration C(t) = C₀e^(-kt) where C₀ = 100 mg/L and k = 0.2 hr⁻¹. A second dose gives total C(t) = 100e^(-0.2t) + D·e^(-0.2(t-T)) for t ≥ T. Find dose D and time T that maintains concentration above 50 mg/L for maximum duration.

Technique Used: Pharmacokinetics optimization

Step-by-Step Solution:

1. After first dose: C₁(t) = 100e^(-0.2t)
2. C₁(T) = 100e^(-0.2T) when second dose given
3. After second dose: C₂(t) = 100e^(-0.2t) + De^(-0.2(t-T)) for t ≥ T
4. At t = T: C₂(T) = 100e^(-0.2T) + D
5. For continuous therapy, we want C(t) ≥ 50 for maximum time
6. First dose drops to 50 when: 100e^(-0.2t) = 50, so e^(-0.2t) = 0.5
7. -0.2t = ln(0.5) = -ln(2), t = 5ln(2) ≈ 3.47 hours
8. If second dose at t = 3.47: C₁(3.47) = 50
9. Choose D = 50 to restore concentration to 100
10. Total concentration becomes C(t) = 50e^(-0.2t) + 50e^(-0.2(t-3.47))

Answer: Give second dose D = 50 mg/L at T = 5ln(2) ≈ 3.47 hours

Example 50: Control Systems Optimization

A control system has a transfer function H(s) = K/(s² + 2s + K). Find K that maximizes stability margin while maintaining steady-state error below 10%.

Technique Used: Control system optimization

Step-by-Step Solution:

1. Transfer function: H(s) = K/(s² + 2s + K)
2. Characteristic equation: s² + 2s + K = 0
3. For stability: discriminant < 0 and coefficients > 0
4. Discriminant: 4 – 4K < 0, so K > 1
5. Steady-state error for unit step: e_ss = 1/(1 + K)
6. Constraint: e_ss ≤ 0.1, so 1/(1 + K) ≤ 0.1
7. Solve: 1 + K ≥ 10, K ≥ 9
8. Stability margin related to damping ratio ζ = 1/√K
9. For critically damped response: ζ = 1, so K = 1
10. But K ≥ 9 from the error constraint
11. Minimum K = 9 satisfies both stability and error requirements

Answer: K = 9 provides an optimal balance of stability and steady-state error

Key Techniques Summary

Lecture 10: Complete Guide to Optimization – Finding Maximum and Minimum Values Using First and Second Derivative Tests

Fundamental Optimization Concepts

Basic Optimization Principles

• Understanding critical points as candidates for maximum and minimum values
• Recognizing that optimization requires finding where the rate of change equals zero
• Applying the fundamental relationship between derivatives and function behavior
• Using geometric interpretation: horizontal tangent lines indicate potential extrema
• Distinguishing between local (relative) and global (absolute) extrema

Standard Optimization Procedure

• Step 1: Find the domain of the function and identify any boundary points
• Step 2: Calculate the first derivative f'(x) and solve f'(x) = 0 for critical points
• Step 3: Identify points where f'(x) is undefined (also critical points)
• Step 4: Apply the first or second derivative test to classify each critical point
• Step 5: Evaluate the function at critical points and boundary points to find global extrema
• Step 6: Verify results using graphical analysis or alternative methods

Recognition of Optimization Applications

• Identifying real-world problems that require finding maximum or minimum values
• Recognizing constrained versus unconstrained optimization scenarios
• Understanding when functions have guaranteed global extrema (continuous functions on closed intervals)
• Working with optimization problems in business, physics, and engineering contexts

Advanced Optimization Techniques

First Derivative Test Applications

• Sign Analysis: Understanding how f'(x) changes sign around critical points
• Increasing/Decreasing Behavior: Using f'(x) > 0 and f'(x) < 0 to determine function monotonicity
• Critical Point Classification: Local maximum when f'(x) changes from positive to negative
• Local Minimum Identification: f'(x) changes from negative to positive
• Inflection Point Recognition: Points where concavity changes but no extremum occurs

Second Derivative Test Applications

• Concavity Analysis: Using f”(x) > 0 for concave up and f”(x) < 0 for concave down
• Local Maximum Confirmation: f'(c) = 0 and f”(c) < 0 indicates local maximum at x = c
• Local Minimum Confirmation: f'(c) = 0 and f”(c) > 0 indicates local minimum at x = c
• Inconclusive Cases: When f”(c) = 0, requiring first derivative test or higher-order analysis
• Point of Inflection: f”(x) = 0 and f”(x) changes sign indicates inflection point

Multi-Variable Optimization Foundations

• Partial Derivative Applications: ∂f/∂x = 0 and ∂f/∂y = 0 for critical points in two variables
• Hessian Matrix Introduction: Second-order partial derivatives for classification
• Constrained Optimization Preview: Lagrange multipliers for optimization with constraints
• Gradient Vector Interpretation: Direction of steepest increase in multi-variable functions

Complex Optimization Analysis

Applied Optimization Problem Solving

• Word Problem Translation: Converting real-world scenarios into mathematical optimization problems
• Constraint Identification: Recognizing and incorporating problem limitations
• Variable Definition: Choosing appropriate variables and establishing relationships
• Objective Function Construction: Building functions to maximize or minimize
• Domain Restriction: Applying realistic constraints to variable ranges

Advanced Critical Point Analysis

• Multiple Critical Points: Analyzing functions with several local extrema
• Cusp and Corner Analysis: Handling points where derivatives don’t exist
• Asymptotic Behavior: Understanding optimization near vertical asymptotes
• Periodic Function Optimization: Finding extrema in trigonometric and cyclical functions
• Rational Function Extrema: Optimization involving quotients of polynomials

Boundary Value Analysis

• Closed Interval Methods: Systematic evaluation of endpoints and critical points
• Open Interval Behavior: Understanding extrema when boundaries aren’t included
• Semi-Infinite Intervals: Optimization on domains like [a, ∞) or (-∞, b]
• Discontinuous Functions: Finding extrema when functions have jump discontinuities
• Piecewise Function Optimization: Handling functions defined in multiple pieces

Engineering and Scientific Applications

Physics Applications

• Projectile Motion: Optimizing range, height, and trajectory parameters
• Energy Minimization: Finding equilibrium positions in mechanical systems
• Optics Problems: Snell’s law and Fermat’s principle optimization
• Wave Optimization: Amplitude and frequency optimization in oscillatory systems
• Thermodynamics: Efficiency maximization in heat engines and cooling systems

Engineering Design Problems

• Structural Optimization: Minimizing material usage while maintaining strength requirements
• Manufacturing Efficiency: Optimizing production rates and cost minimization
• Signal Processing: Optimizing filter parameters for noise reduction
• Control Systems: Tuning controllers for optimal system response
• Network Optimization: Minimizing path lengths and maximizing flow efficiency

Economic and Business Applications

• Profit Maximization: Finding optimal production levels for maximum profit
• Cost Minimization: Determining the most efficient resource allocation
• Revenue Optimization: Pricing strategies for maximum revenue generation
• Inventory Management: Optimizing stock levels to minimize carrying costs
• Market Analysis: Finding optimal market positioning and competitive strategies

Advanced Computational Techniques

Error Analysis in Optimization

• Numerical Precision: Understanding how computational errors affect optimization results
• Convergence Criteria: Establishing stopping conditions for iterative optimization methods
• Sensitivity Analysis: Measuring how small changes in parameters affect optimal solutions
• Robustness Testing: Ensuring optimization solutions remain valid under uncertainty
• Validation Methods: Confirming optimization results through multiple approaches

Optimization Algorithm Foundations

• Gradient Descent Introduction: Iterative methods for finding local minima
• Newton’s Method for Optimization: Second-order methods for faster convergence
• Golden Section Search: Optimization methods when derivatives are unavailable
• Bracketing Methods: Systematic approaches to isolate extrema
• Numerical Differentiation: Computing derivatives when analytical forms are complex

Graphical Analysis Techniques

• Function Sketching: Using derivative information to graph functions accurately
• Extrema Visualization: Identifying maximum and minimum points graphically
• Concavity Mapping: Understanding function shape through second derivative analysis
• Critical Point Plotting: Systematic graphical identification of optimization candidates
• Comparative Analysis: Using graphs to verify analytical optimization results

Verification and Problem-Solving Strategies

Solution Verification Techniques

• Analytical Confirmation: Using calculus to verify optimization results
• Graphical Validation: Plotting functions to confirm extrema locations
• Numerical Checking: Using computational tools to verify analytical solutions
• Physical Interpretation: Ensuring mathematical results make practical sense
• Limit Case Analysis: Testing optimization solutions at boundary conditions

Common Error Prevention

• Sign Error Avoidance: Careful attention to positive and negative derivative values
• Domain Restriction Errors: Ensuring all constraints are properly applied
• Critical Point Omission: Systematic checking for all potential extrema
• Test Misapplication: Correct use of first and second derivative tests
• Units and Scaling: Maintaining consistent units throughout optimization problems

Strategic Problem Approach

• Problem Classification: Identifying the type of optimization problem before solving
• Method Selection: Choosing appropriate techniques based on function characteristics
• Systematic Analysis: Following consistent procedures for reliable results
• Quality Assessment: Developing criteria for acceptable optimization solutions
• Alternative Method Verification: Using multiple approaches to confirm results

Specialized Problem Categories

Geometric Optimization Problems

• Area Maximization: Optimizing geometric shapes subject to perimeter constraints
• Volume Optimization: Finding maximum volumes with surface area limitations
• Distance Minimization: Shortest path problems and related geometric optimization
• Shape Optimization: Finding optimal proportions for geometric efficiency
• Packing Problems: Maximizing space utilization in geometric arrangements

Rate and Related Rate Optimization

• Time-Dependent Optimization: Finding optimal timing for dynamic processes
• Rate Optimization: Maximizing or minimizing rates of change
• Resource Allocation: Optimal distribution of limited resources over time
• Dynamic Efficiency: Optimization in systems with changing parameters
• Temporal Constraint Handling: Optimization with time-based limitations

Economic Optimization Models

• Supply and Demand: Finding equilibrium points and optimal pricing
• Production Optimization: Balancing output with resource constraints
• Investment Analysis: Maximizing returns while minimizing risk
• Market Efficiency: Optimization in competitive market scenarios
• Policy Optimization: Finding optimal regulatory and policy parameters

Integration with Other Calculus Concepts

Derivative Applications Integration

• Chain Rule in Optimization: Handling composite functions in optimization problems
• Implicit Differentiation: Optimization with implicitly defined relationships
• Related Rates: Connecting optimization to dynamic rate problems
• L’Hôpital’s Rule: Resolving indeterminate forms in optimization contexts
• Parametric Optimization: Finding extrema in parametrically defined functions

Integral Connections

• Area Under Curves: Optimization problems involving definite integrals
• Average Value Problems: Optimizing functions defined by integral expressions
• Arc Length Optimization: Finding shortest curves with specified properties
• Volume of Revolution: Optimization in three-dimensional geometric problems
• Work and Energy: Optimization in Physics Problems Involving Integrals

Limit and Continuity Applications

• Asymptotic Optimization: Finding extrema as functions approach limits
• Continuity Requirements: Understanding when optimization methods apply
• Jump Discontinuity Handling: Optimization with piecewise continuous functions
• Infinite Limit Behavior: Optimization involving unbounded functions
• Convergence Analysis: Understanding optimization in limit processes

Real-World Applications and Case Studies

Medical and Biological Applications

• Drug Dosage Optimization: Finding optimal medication levels for patient treatment
• Medical Imaging: Optimizing scan parameters for image quality
• Biomechanics: Optimizing movement patterns for efficiency and injury prevention
• Epidemiology: Optimizing public health interventions for disease control
• Surgical Planning: Minimizing risk while maximizing treatment effectiveness

Environmental Science Applications

• Resource Conservation: Optimizing usage patterns for sustainable resource management
• Pollution Control: Minimizing environmental impact while maintaining productivity
• Energy Efficiency: Optimizing energy systems for maximum output with minimum waste
• Ecosystem Management: Balancing competing interests in environmental planning
• Climate Optimization: Finding optimal strategies for climate change mitigation

Technology and Computing Applications

• Algorithm Optimization: Minimizing computational time and memory usage
• Network Design: Optimizing data flow and communication efficiency
• Machine Learning: Parameter optimization in training algorithms
• Signal Processing: Optimizing filter design for noise reduction and signal clarity
• Database Optimization: Minimizing query time and storage requirements

Financial and Investment Applications

• Portfolio Optimization: Balancing risk and return in investment strategies
• Trading Strategies: Optimizing buy and sell decisions for maximum profit
• Risk Management: Minimizing exposure while maintaining growth potential
• Insurance Optimization: Setting premiums to balance coverage and profitability
• Economic Policy: Optimizing fiscal and monetary policies for economic stability

Summary

Optimization using first and second derivative tests represents the cornerstone methodology for systematically finding maximum and minimum values in single-variable functions, providing the mathematical framework for solving real-world problems involving efficiency maximization, cost minimization, and resource allocation, making it indispensable for engineering design, business decision-making, economic analysis, and scientific research where optimal solutions directly impact performance, profitability, and resource utilization.

Key takeaways from this lecture:

Critical Point Foundation: The systematic identification of critical points through solving f'(x) = 0 and locating points where f'(x) is undefined establishes the fundamental approach for finding all candidates for local extrema, while understanding the geometric interpretation of horizontal tangent lines and undefined slopes provides the conceptual framework for optimization analysis that underlies advanced numerical optimization algorithms, engineering design processes, and economic decision-making models requiring precise identification of optimal operating conditions.

First Derivative Test Mastery: Analyzing sign changes in f'(x) around critical points to classify local maxima (positive to negative transition), local minima (negative to positive transition), and non-extrema points enables definitive categorization of critical points while building understanding of function monotonicity, increasing and decreasing intervals, and the relationship between derivative behavior and function optimization that forms the foundation for advanced optimization techniques in multi-variable calculus, constrained optimization, and numerical methods.

Second Derivative Test Implementation: Utilizing concavity analysis through f”(c) evaluation at critical points where f'(c) = 0 provides efficient classification with f”(c) < 0 indicating local maxima, f”(c) > 0 indicating local minima, and f”(c) = 0 requiring alternative analysis methods, while understanding concave up and concave down behavior enables rapid optimization analysis essential for time-sensitive engineering calculations, business optimization decisions, and scientific modeling applications.

Applied Optimization Problem Solving: Transforming real-world scenarios into mathematical optimization problems through systematic variable identification, constraint recognition, objective function construction, and domain restriction develops critical problem-solving skills for engineering design optimization, business profit maximization, cost minimization analysis, and scientific parameter optimization, while mastering the translation between practical constraints and mathematical expressions ensures reliable solution of complex optimization challenges in professional practice.

Boundary Value Analysis: Implementing comprehensive evaluation procedures that examine critical points alongside boundary points for closed intervals, understanding behavior at domain endpoints, and handling semi-infinite and infinite domains enables complete optimization analysis for realistic engineering problems with physical constraints, business problems with operational limitations, and scientific models with natural parameter bounds that define feasible solution spaces in practical applications.

Global Extrema Determination: Systematically comparing function values at all critical points and boundary points to identify absolute maximum and minimum values develops expertise in complete optimization analysis essential for engineering safety margins, business profitability analysis, economic efficiency optimization, and scientific parameter selection, where global optimal solutions rather than local extrema determine system performance and decision outcomes.

Verification and Error Prevention: Developing systematic verification procedures using graphical analysis, alternative analytical methods, and practical interpretation of results builds reliability in optimization solutions while understanding common error sources including sign mistakes, domain restriction oversights, critical point omissions, and inappropriate test applications ensures accurate optimization analysis critical for safety-critical engineering systems, high-stakes business decisions, and precise scientific research.

Engineering Applications: Optimization mastery enables structural design for minimum weight with strength constraints, manufacturing process optimization for cost reduction and efficiency improvement, control system parameter tuning for optimal performance, signal processing filter design for noise minimization, thermal system design for energy efficiency, fluid system optimization for pressure loss minimization, economic production level determination for profit maximization, inventory management for cost optimization, project scheduling for time and resource efficiency, quality control parameter optimization, environmental system design for pollution minimization, and any engineering or business application requiring systematic identification of optimal operating conditions, design parameters, or decision variables, making it fundamental for modern engineering practice, business management, economic analysis, and scientific research where optimization directly impacts competitiveness, sustainability, safety, and performance in technology-driven industries and data-driven decision-making environments.

Topic FAQ

Q1: How do I know when to use the first derivative test versus the second derivative test?

A: Use the second derivative test when f'(c) = 0 and f”(c) ≠ 0 for quick classification – it’s faster when applicable. Use the first derivative test when f”(c) = 0 or is undefined, when you need to analyze sign changes, or when finding intervals of increase/decrease. The first derivative test always works but requires more analysis.

Q2: What’s the most reliable way to find all critical points?

A: Follow the systematic approach: find f'(x), solve f'(x) = 0 algebraically, identify where f'(x) is undefined, check your algebra carefully, and verify each critical point by substituting back into f'(x). Don’t forget points where the derivative doesn’t exist, like cusps or vertical tangents.

Q3: How do I avoid missing critical points or making algebra errors?

A: Factor f'(x) completely before solving f'(x) = 0, check your factoring by expanding back, solve each factor separately, and always verify solutions by substitution. For rational functions, check where denominators equal zero. Use graphing technology to verify you haven’t missed any critical points.

Q4: What’s the biggest mistake students make with optimization?

A: Forgetting to check boundary points when finding global extrema on closed intervals, misapplying derivative tests, making sign errors when analyzing f'(x), and not verifying that critical points are actually in the domain. Also, setting up applied problems incorrectly by missing constraints or misidentifying the objective function.

Q5: How do I handle optimization problems where the second derivative test is inconclusive?

A: When f”(c) = 0, use the first derivative test by checking the sign of f'(x) just before and after the critical point c. If f'(x) changes from positive to negative, it’s a local maximum; negative to positive indicates a local minimum; no sign change means it’s not a local extremum.

Q6: What’s the difference between local and global extrema?

A: Local (relative) extrema are the highest or lowest points in a small neighborhood around the point. Global (absolute) extrema are the highest or lowest points over the entire domain. A function can have multiple local extrema but only one global maximum and one global minimum on a given domain.

Q7: How do I find global extrema systematically?

A: Find all critical points in the interior of the domain, evaluate f(x) at each critical point, evaluate f(x) at all boundary points (endpoints for closed intervals), compare all these function values, and identify the largest (global max) and smallest (global min) values. Don’t forget to check that boundary points are in the domain.

Q8: When can I be sure a function has global extrema?

A: By the Extreme Value Theorem, continuous functions on closed, bounded intervals [a,b] are guaranteed to have both a global maximum and a minimum. For open intervals or unbounded domains, global extrema may not exist – check behavior at boundaries and as x approaches ±∞.

Q9: How do I set up applied optimization problems systematically?

A: Read the problem carefully to identify what needs to be optimized, define variables clearly, establish relationships between variables using given information, express constraints mathematically, write the objective function in terms of one variable, find the domain based on physical constraints, then apply standard optimization techniques.

Q10: What makes applied optimization problems difficult to set up?

A: Problems become challenging when multiple constraints exist, when geometric relationships are complex, when the objective involves multiple variables that need to be reduced to one, or when physical constraints create unusual domains. Always draw diagrams for geometric problems and clearly identify all given information.

Q11: How do I handle optimization with unusual domains?

A: Identify the domain carefully from physical or mathematical constraints, check for boundary points that need evaluation, be aware that some domains may be open intervals or unions of intervals, and remember that critical points outside the domain don’t matter for the optimization problem.

Q12: How do I verify my optimization results make sense?

A: Check that your answer satisfies all constraints, verify units are correct, confirm the result is reasonable in the problem context, use graphical analysis when possible, and test nearby values to ensure you found an extremum rather than just a critical point.

Q13: What’s the connection between derivatives and function behavior?

A: f'(x) > 0 means f is increasing, f'(x) < 0 means f is decreasing, f'(x) = 0 at local extrema (usually), f”(x) > 0 means f is concave up, f”(x) < 0 means f is concave down, and f”(x) = 0 at inflection points where concavity changes.

Q14: How do I work with optimization involving trigonometric functions?

A: Remember that sin x and cos x have derivatives that are easy to work with, trig functions are periodic so check for multiple critical points, use trig identities to simplify when necessary, and be careful about domains – angles might be restricted to specific intervals in applied problems.

Q15: Can I use calculus for optimization when derivatives are complicated?

A: Yes, but factor derivatives completely, use the quotient and product rules carefully, don’t simplify too early (keep factored form for easier analysis), and consider using technology to verify your derivative calculations. Sometimes, numerical methods are more practical for very complex functions.

Q16: How do I handle optimization problems with square roots or fractional powers?

A: Remember that d/dx[x^n] = nx^{n-1} works for all real n, be careful about domains (square roots require non-negative inputs), consider whether to work with the original function or its square (for distance problems), and watch for points where derivatives don’t exist.

Q17: What’s the relationship between optimization and graphing?

A: Optimization analysis gives you the tools to sketch accurate graphs: critical points show local extrema, the first derivative tells you increasing/decreasing intervals, the second derivative shows concavity, and inflection points occur where concavity changes. Conversely, good graphs help verify optimization results.

Q18: How do I use optimization for business and economics problems?

A: Identify whether you’re maximizing profit, revenue, or efficiency, or minimizing cost, time, or waste. Set up cost, revenue, and profit functions carefully, remember that profit = revenue – cost, consider practical constraints like non-negative production levels, and interpret results in a business context.

Q19: How does optimization apply to geometry and measurement problems?

A: Common applications include maximizing area with fixed perimeter, minimizing perimeter with fixed area, optimizing volumes with surface area constraints, and finding the shortest distances. Always draw clear diagrams, use geometric relationships to eliminate variables, and check that your solution satisfies geometric constraints.

Q20: What’s the best strategy for complex optimization problems?

A: Break the problem into steps: understand what you’re optimizing, identify all constraints, set up the mathematical model carefully, reduce to a single-variable problem, find and classify all critical points, check boundary conditions, and verify your answer makes practical sense. Don’t rush the setup phase – most errors occur there rather than in the calculus.

Conclusion

Mastering optimization through first and second derivative tests completes your critical analysis toolkit, providing the essential technique for systematically finding maximum and minimum values in engineering systems where optimal performance, cost effectiveness, and resource allocation drive successful design decisions. This technique extends your problem-solving capabilities to tackle sophisticated real-world scenarios where manufacturing processes require efficiency optimization, structural systems need weight minimization with strength constraints, economic models demand profit maximization with resource limitations, and control systems require parameter tuning that achieves desired performance while maintaining stability and robustness.

The comprehensive examples throughout this lecture demonstrate the systematic approach required for successful application of optimization analysis. By understanding the fundamental principles of critical point identification, derivative test implementation, and boundary value evaluation, engineering students develop the analytical confidence necessary for advanced calculus applications in complex systems where finding optimal operating conditions is essential for design excellence, performance prediction, and competitive advantage in technology-driven industries.

The techniques covered in this lecture handle problems where finding extrema is crucial – maximizing efficiency in manufacturing processes, minimizing material usage in structural design, optimizing controller parameters for system performance, analyzing profit and cost relationships in business decisions, and design scenarios where systematic identification of optimal values provides measurable improvements in system performance. However, engineering applications often involve even more sophisticated situations where these optimization techniques must be applied to complex real-world problems with multiple constraints, practical limitations, and competing objectives that require advanced problem-solving strategies.

Building Toward Advanced Applications

While single-variable optimization analysis is exceptionally powerful for finding extrema and analyzing function behavior, it has natural extensions when dealing with practical engineering applications that require sophisticated problem-solving approaches. Consider these challenging scenarios that require additional mathematical strategies:

• Multi-Constraint Design Problems: Engineering design processes where geometric constraints, material limitations, manufacturing restrictions, and performance requirements must be satisfied simultaneously while optimizing primary objectives like cost, weight, or efficiency
• Economic Optimization Systems: Business and industrial applications where resource allocation, production scheduling, inventory management, and pricing strategies require optimization analysis with practical constraints and market limitations
• Environmental Engineering: Sustainability systems where pollution minimization, energy efficiency, resource conservation, and economic viability must be balanced through systematic optimization of multiple competing factors
• Advanced Manufacturing: Production systems where quality optimization, throughput maximization, cost minimization, and equipment utilization require sophisticated optimization analysis that handles complex relationships between process parameters and performance metrics

These situations involve relationships where optimization requires translating complex real-world scenarios into mathematical models, handling multiple constraints simultaneously, and interpreting mathematical results in practical engineering contexts. Such problems cannot be solved using only basic optimization techniques alone – they require systematic approaches that bridge theoretical mathematics with practical engineering problem-solving.

🚀Looking Ahead: Lecture 11 Preview

Our next lecture, “Applied Optimization Problems – Real-World Engineering and Business Applications,” will provide the critical advanced technique for handling situations where optimization analysis must be applied to complex practical scenarios with multiple constraints and competing objectives. You’ll learn:

Applied Problem Translation:

• Converting real-world scenarios into mathematical optimization problems
• Identifying objective functions and constraints from engineering specifications
• Developing systematic approaches for variable definition and relationship establishment
• Recognizing when optimization models provide practical solutions versus theoretical analysis

Multi-Constraint Optimization Analysis:

• Handling optimization problems with geometric, physical, and economic constraints
• Combining derivative analysis with practical engineering limitations
• Solving design problems with competing objectives and resource restrictions
• Managing optimization complexity in realistic engineering applications

Engineering Applications:

• Manufacturing optimization with quality constraints and cost limitations
• Structural design problems with strength, weight, and material constraints
• Economic modeling with profit optimization and market restrictions
• Environmental systems with efficiency and sustainability requirements

Business and Economic Applications:

• Inventory management with storage costs and demand fluctuations
• Production scheduling with capacity constraints and delivery requirements
• Investment analysis with risk limitations and return objectives
• Pricing strategies with market competition and cost considerations

Preparation for Success

To maximize your learning in Lecture 11, ensure you can:

• Apply first and second derivative tests confidently to classify critical points and find extrema
• Set up optimization problems systematically from mathematical function descriptions
• Handle boundary value analysis for closed intervals and constrained domains
• Combine critical point analysis with practical interpretation of optimization results

The mastery you’ve developed with optimization techniques will make applied problem-solving much more accessible. Applied optimization relies heavily on the systematic approaches and analytical skills you’ve learned, simply extending their application to situations where real-world constraints and practical limitations must be incorporated into mathematical analysis.

Final Thoughts

Remember that calculus remains the fundamental analytical tool for understanding optimization techniques and problem-solving methods across all engineering disciplines. Whether designing manufacturing systems where production optimization must balance quality requirements with cost constraints, analyzing business systems where profit maximization must consider market limitations and resource availability, optimizing structural systems where weight minimization must satisfy strength and safety requirements, or modeling environmental systems where efficiency optimization must balance performance with sustainability constraints, these advanced techniques provide the mathematical foundation for professional engineering analysis.

The optimization mastery you’ve achieved handles the mathematical analysis required for finding extrema in any engineering system you’ll encounter in professional practice. Combined with the applied problem-solving techniques in our next lecture, you’ll possess the complete toolkit for analyzing any real-world scenario where optimization provides practical solutions for design improvement, cost reduction, and performance enhancement, whether in mechanical, electrical, civil, environmental, or economic applications.

Continue practicing systematically, understand the reasoning behind each optimization technique, and always verify your results through mathematical analysis and practical interpretation to build lasting expertise in applied calculus. The analytical confidence you develop now will serve as the foundation for your success in advanced engineering coursework and professional practice, where understanding how to solve complex optimization problems systematically and reliably is essential for design, analysis, and innovation in competitive engineering environments where optimal solutions provide measurable advantages in performance, cost, and efficiency.

📌 SAVE this lecture for your next calculus study session!

💬 COMMENT below:

• Which optimization technique from today’s examples gave you the most trouble – first derivative test, second derivative test, or applied problems?
• What real-world application of finding maximum and minimum values fascinated you the most?
• Which type of optimization problem do you want to see more practice examples for?

🔔 FOLLOW for more: Essential calculus tutorials designed specifically for engineering students

📚 SHARE with: Your study group, classmates, or anyone mastering optimization and extrema analysis

🎓 Study Tip of the Day:

“Master the optimization strategy! Always find your critical points by solving f'(x) = 0 and locating where f'(x) is undefined, classify each critical point using derivative tests, evaluate the function at critical points and boundary points, then compare values to identify global extrema. Work systematically: find critical points → apply tests → check boundaries → compare values → verify!”

Remember: Every calculus expert once confused local and global extrema. Every engineering professional has once struggled with setting up applied optimization problems. Build your optimization intuition strong, practice the systematic approach, and those complex maximum and minimum problems will become second nature!

See you guys in Lecture 11: Applied Optimization Problems 📈