Study guide
2.2 Calculus: Differential, Integral, and Series Approximations
FE Industrial and Systems Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation
1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators
2 Chapter 2: Mathematics for Industrial Engineers
2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors
3 Chapter 3: Engineering Sciences Core
3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems
4 Chapter 4: Ethics and Professional Practice
4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest
5 Chapter 5: Engineering Economics
5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation
6 Chapter 6: Probability Foundations & Distributions
6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions
7 Chapter 7: Statistical Inference, Regression & Design of Experiments
7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)
8 Chapter 8: Data, Logic, Modeling & Linear Programming
8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics
9 Chapter 9: Stochastic Models & Simulation
9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling
10 Chapter 10: Engineering Management, Project Planning & Performance Measurement
10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard
11 Chapter 11: Manufacturing & Production Systems
11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment
12 Chapter 12: Production Planning, Inventory Control & Sequencing
12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling
13 Chapter 13: Lean Systems & Theory of Constraints
13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope
14 Chapter 14: Facilities Planning & Material Handling
14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS
15 Chapter 15: Supply Chain Design & Logistics
15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination
16 Chapter 16: Human Factors & Cognitive Ergonomics
16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress
17 Chapter 17: Physical Ergonomics & Workplace Safety
17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy
18 Chapter 18: Work Design & Measurement
18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves
19 Chapter 19: Quality Management, Six Sigma & Analytical Tools
19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function
20 Chapter 20: Statistical Process Control
20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)
21 Chapter 21: Process Capability & Acceptance Sampling
21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans
22 Chapter 22: Systems Engineering & Life-Cycle Management
22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability
23 Chapter 23: Reliability Engineering & Risk Analysis
23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis
2.2 Calculus: Differential, Integral, and Series Approximations
Key Takeaways Explain This Topic AI
Critical points occur where f'(x) = 0 or f'(x) is undefined; the second derivative test establishes a local minimum if f''(x*) > 0 and a local maximum if f''(x*) < 0.
In multivariate unconstrained optimization, a stationary point is classified using the Hessian determinant D = f_xx * f_yy - (f_xy)^2: D > 0 with f_xx > 0 indicates a local minimum, D > 0 with f_xx < 0 indicates a local maximum, and D < 0 indicates a saddle point.
Integration by parts follows the formula integral(u dv) = u*v - integral(v du), serving as the foundational tool for evaluating expected value integrals and Mean Time To Failure (MTTF) in component reliability models.
Taylor series expansions approximate nonlinear functions about an operating point x = a via f(x) = sum_{n=0}^infinity [f^(n)(a) / n!] * (x - a)^n, with Maclaurin series representing the special case where a = 0.
The classical Economic Order Quantity (EOQ) formula Q* = sqrt(2DS/H) is derived directly by setting the first derivative of the annual inventory cost equation to zero and confirming convexity with a positive second derivative.
Last updated: September 2026
Calculus is the mathematical foundation of continuous modeling in industrial and systems engineering. From determining the optimal production lot size that minimizes inventory carrying and setup costs, to computing the mean time between failures (MTBF) of automated machinery, mastery of differential, integral, and series calculus is critical for passing the NCEES FE Industrial examination.
- 1. Differential Calculus: Operational Rules and Partial Derivatives
- Fundamental Derivative Rules
The derivative represents the instantaneous rate of change of a physical or economic function, defined formally as: f ′ ( x ) = lim Δ x → 0 f ( x + Δ x ) − f ( x ) Δ x f'(x) = \lim_{\Delta x \to 0} \frac{f(x + \Delta x) - f(x)}{\Delta x} f ′ ( x ) = Δ x → 0 lim Δ x f ( x + Δ x ) − f ( x )
On the FE exam, efficiency requires instant recall and application of operational rules:
Product Rule : d d x [ u ⋅ v ] = u ′ v + u v ′ \frac{d}{dx}[u \cdot v] = u' v + u v' d x d [ u ⋅ v ] = u ′ v + u v ′
Quotient Rule : d d x [ u v ] = u ′ v − u v ′ v 2 \frac{d}{dx}\left[\frac{u}{v}\right] = \frac{u' v - u v'}{v^2} d x d [ v u ] = v 2 u ′ v − u v ′ (mnemonic: "low d-high minus high d-low over the square of what's below")
Chain Rule : d d x [ f ( g ( x ) ) ] = f ′ ( g ( x ) ) ⋅ g ′ ( x ) \frac{d}{dx}[f(g(x))] = f'(g(x)) \cdot g'(x) d x d [ f ( g ( x ))] = f ′ ( g ( x )) ⋅ g ′ ( x )
Exponential Rules : d d x [ e k x ] = k e k x , d d x [ a u ] = a u ( ln a ) d u d x \frac{d}{dx}[e^{kx}] = k e^{kx}, \quad \frac{d}{dx}[a^u] = a^u (\ln a) \frac{du}{dx} d x d [ e k x ] = k e k x , d x d [ a u ] = a u ( ln a ) d x d u
Logarithmic Rules : d d x [ ln ( x ) ] = 1 x , d d x [ ln ( u ) ] = u ′ u , d d x [ log a ( u ) ] = u ′ u ln a \frac{d}{dx}[\ln(x)] = \frac{1}{x}, \quad \frac{d}{dx}[\ln(u)] = \frac{u'}{u}, \quad \frac{d}{dx}[\log_a(u)] = \frac{u'}{u \ln a} d x d [ ln ( x )] = x 1 , d x d [ ln ( u )] = u u ′ , d x d [ lo g a ( u )] = u ln a u ′
Partial Derivatives and the Gradient Vector
Industrial systems generally involve multivariable functions, such as production throughput as a function of labor and capital, or total distribution cost as a function of multiple warehouse coordinates. When evaluating the partial derivative ∂ f ∂ x \frac{\partial f}{\partial x} ∂ x ∂ f , all other variables ( y , z , … y, z, \dots y , z , … ) are treated strictly as constants.
Clairaut's Theorem (Mixed Partials) : If f ( x , y ) f(x, y) f ( x , y ) and its partial derivatives are continuous on an open region, the mixed second partial derivatives are identical: ∂ 2 f ∂ x ∂ y = ∂ 2 f ∂ y ∂ x ( f x y = f y x ) \frac{\partial^2 f}{\partial x \partial y} = \frac{\partial^2 f}{\partial y \partial x} \quad (f_{xy} = f_{yx}) ∂ x ∂ y ∂ 2 f = ∂ y ∂ x ∂ 2 f ( f x y = f y x )
Gradient Vector ( ∇ f \nabla f ∇ f ) : The vector of first-order partial derivatives: ∇ f ( x , y ) = [ ∂ f ∂ x ∂ f ∂ y ] \nabla f(x, y) = \begin{bmatrix} \frac{\partial f}{\partial x} \\ \frac{\partial f}{\partial y} \end{bmatrix} ∇ f ( x , y ) = [ ∂ x ∂ f ∂ y ∂ f ]
The gradient vector points in the direction of greatest instantaneous increase of f f f , and its Euclidean magnitude ∥ ∇ f ∥ \|\nabla f\| ∥∇ f ∥ represents the maximum directional derivative.
2. Univariate and Multivariate Optimization in Engineering Systems
Optimization is central to industrial engineering. We seek input conditions that minimize undesirable outcomes (cost, defect rates, transit delays) or maximize desirable outcomes (profit, throughput, system reliability).
Univariate Optimization
To optimize a single-variable differentiable function f ( x ) f(x) f ( x ) over an open interval:
Find Critical Points : Solve f ′ ( x ) = 0 f'(x) = 0 f ′ ( x ) = 0 or identify points where f ′ ( x ) f'(x) f ′ ( x ) fails to exist.
Second Derivative Test :
If f ′ ′ ( x ∗ ) > 0 f''(x^*) > 0 f ′′ ( x ∗ ) > 0 : The function is concave upward (convex); x ∗ x^* x ∗ is a local minimum .
If f ′ ′ ( x ∗ ) < 0 f''(x^*) < 0 f ′′ ( x ∗ ) < 0 : The function is concave downward (concave); x ∗ x^* x ∗ is a local maximum .
If f ′ ′ ( x ∗ ) = 0 f''(x^*) = 0 f ′′ ( x ∗ ) = 0 : The test is inconclusive (the point may be an inflection point, local max, or local min; analyze sign changes in f ′ ( x ) f'(x) f ′ ( x ) ).
Global Extrema on a Closed Interval [ a , b ] [a, b] [ a , b ] : Evaluate f ( x ) f(x) f ( x ) at all interior critical points and compare them directly against boundary values f ( a ) f(a) f ( a ) and f ( b ) f(b) f ( b ) .
Multivariate Unconstrained Optimization and the Hessian Matrix
For a two-variable function f ( x , y ) f(x, y) f ( x , y ) :
Stationary Points : Solve the simultaneous system of first partial derivatives: ∇ f ( x , y ) = 0 ⟹ f x ( x , y ) = 0 and f y ( x , y ) = 0 \nabla f(x, y) = \mathbf{0} \quad \implies \quad f_x(x, y) = 0 \quad \text{and} \quad f_y(x, y) = 0 ∇ f ( x , y ) = 0 ⟹ f x ( x , y ) = 0 and f y ( x , y ) = 0
Construct the Hessian Matrix ( H H H ) : H = [ f x x f x y f y x f y y ] H = \begin{bmatrix} f_{xx} & f_{xy} \\ f_{yx} & f_{yy} \end{bmatrix} H = [ f xx f y x f x y f yy ]
Compute the Hessian Determinant ( D D D ) : D = det ( H ) = f x x f y y − ( f x y ) 2 D = \det(H) = f_{xx} f_{yy} - (f_{xy})^2 D = det ( H ) = f xx f yy − ( f x y ) 2
Second Partial Derivative Test Classification :
Condition on D D D Condition on f x x f_{xx} f xx Geometric Classification of Stationary Point ( x ∗ , y ∗ ) (x^*, y^*) ( x ∗ , y ∗ )
D > 0 D > 0 D > 0 f x x > 0 f_{xx} > 0 f xx > 0 (or f y y > 0 f_{yy} > 0 f yy > 0 ) Local Minimum (cup-shaped, concave upward)
D > 0 D > 0 D > 0 f x x < 0 f_{xx} < 0 f xx < 0 (or f y y < 0 f_{yy} < 0 f yy < 0 ) Local Maximum (dome-shaped, concave downward)
D < 0 D < 0 D < 0 Any value Saddle Point (concave up in one direction, down in another)
D = 0 D = 0 D = 0 Any value Test Inconclusive (requires higher-order analysis) Hessian Determinant: D = f_xx * f_yy - (f_xy)^2
- ├── D > 0
- │ ├── f_xx > 0 ──> Local Minimum (e.g., minimum cost surface)
- │ └── f_xx < 0 ──> Local Maximum (e.g., maximum profit surface)
- ├── D < 0 ──────────> Saddle Point (neither min nor max)
- └── D = 0 ──────────> Inconclusive
- 3. Integral Calculus: Analytical Methods and Physical Applications
- Fundamental Theorem of Calculus
If f ( x ) f(x) f ( x ) is continuous on [ a , b ] [a, b] [ a , b ] and F ′ ( x ) = f ( x ) F'(x) = f(x) F ′ ( x ) = f ( x ) , then: ∫ a b f ( x ) d x = F ( b ) − F ( a ) \int_a^b f(x) \, dx = F(b) - F(a) ∫ a b f ( x ) d x = F ( b ) − F ( a )
Integration by Substitution ( u u u -Substitution)
Reverses the chain rule by mapping an integrand into a simpler variable form: ∫ f ( g ( x ) ) g ′ ( x ) d x = ∫ f ( u ) d u , where u = g ( x ) , d u = g ′ ( x ) d x \int f(g(x)) g'(x) \, dx = \int f(u) \, du, \quad \text{where } u = g(x), \, du = g'(x) dx ∫ f ( g ( x )) g ′ ( x ) d x = ∫ f ( u ) d u , where u = g ( x ) , d u = g ′ ( x ) d x
Integration by Parts
Reverses the product rule, essential when the integrand contains products of algebraic, exponential, or logarithmic terms: ∫ u d v = u v − ∫ v d u \int u \, dv = u v - \int v \, du ∫ u d v = uv − ∫ v d u
Selection Strategy (LIATE Rule) : Choose u u u in order of priority: L ogarithmic, I nverse trigonometric, A lgebraic, T rigonometric, E xponential. The remaining factor becomes d v dv d v .
Mean Value Theorem for Integrals
The average value of a continuous engineering process variable f ( x ) f(x) f ( x ) over an operational interval [ a , b ] [a, b] [ a , b ] is: f avg = 1 b − a ∫ a b f ( x ) d x f_{\text{avg}} = \frac{1}{b - a} \int_a^b f(x) \, dx f avg = b − a 1 ∫ a b f ( x ) d x
Applications : Calculating the average power load on a transformer bank over an 8-hour shift, or the time-weighted average work-in-process (WIP) level in an inventory staging buffer.
Continuous Probability and System Reliability
Industrial engineers frequently evaluate continuous random variables governed by a probability density function (PDF) f ( t ) f(t) f ( t ) for t ≥ 0 t \ge 0 t ≥ 0 :
Total Probability Condition : ∫ − ∞ ∞ f ( t ) d t = 1 \int_{-\infty}^{\infty} f(t) \, dt = 1 ∫ − ∞ ∞ f ( t ) d t = 1
Cumulative Distribution Function (CDF) : F ( t ) = P ( T ≤ t ) = ∫ − ∞ t f ( τ ) d τ F(t) = P(T \le t) = \int_{-\infty}^t f(\tau) \, d\tau F ( t ) = P ( T ≤ t ) = ∫ − ∞ t f ( τ ) d τ
Reliability Function : R ( t ) = P ( T > t ) = 1 − F ( t ) = ∫ t ∞ f ( τ ) d τ R(t) = P(T > t) = 1 - F(t) = \int_t^{\infty} f(\tau) \, d\tau R ( t ) = P ( T > t ) = 1 − F ( t ) = ∫ t ∞ f ( τ ) d τ
Expected Lifetime (Mean Time To Failure - MTTF) : MTTF = E [ T ] = ∫ 0 ∞ t f ( t ) d t = ∫ 0 ∞ R ( t ) d t \text{MTTF} = E[T] = \int_0^{\infty} t f(t) \, dt = \int_0^{\infty} R(t) \, dt MTTF = E [ T ] = ∫ 0 ∞ t f ( t ) d t = ∫ 0 ∞ R ( t ) d t
- 4. Infinite Series, Taylor Expansions, and Convergence
- Taylor and Maclaurin Series
A Taylor series represents an infinitely differentiable function f ( x ) f(x) f ( x ) near a base point x = a x = a x = a : f ( x ) = ∑ n = 0 ∞ f ( n ) ( a ) n ! ( x − a ) n = f ( a ) + f ′ ( a ) ( x − a ) + f ′ ′ ( a ) 2 ! ( x − a ) 2 + f ′ ′ ′ ( a ) 3 ! ( x − a ) 3 + … f(x) = \sum_{n=0}^{\infty} \frac{f^{(n)}(a)}{n!} (x - a)^n = f(a) + f'(a)(x - a) + \frac{f''(a)}{2!}(x - a)^2 + \frac{f'''(a)}{3!}(x - a)^3 + \dots f ( x ) = n = 0 ∑ ∞ n ! f ( n ) ( a ) ( x − a ) n = f ( a ) + f ′ ( a ) ( x − a ) + 2 ! f ′′ ( a ) ( x − a ) 2 + 3 ! f ′′′ ( a ) ( x − a ) 3 + …
When a = 0 a = 0 a = 0 , the expansion is known specifically as a Maclaurin Series : f ( x ) = ∑ n = 0 ∞ f ( n ) ( 0 ) n ! x n = f ( 0 ) + f ′ ( 0 ) x + f ′ ′ ( 0 ) 2 ! x 2 + … f(x) = \sum_{n=0}^{\infty} \frac{f^{(n)}(0)}{n!} x^n = f(0) + f'(0)x + \frac{f''(0)}{2!}x^2 + \dots f ( x ) = n = 0 ∑ ∞ n ! f ( n ) ( 0 ) x n = f ( 0 ) + f ′ ( 0 ) x + 2 ! f ′′ ( 0 ) x 2 + …
Standard Maclaurin Expansions in Engineering
Function Maclaurin Series Expansion Interval of Convergence
e x e^x e x 1 + x + x 2 2 ! + x 3 3 ! + ⋯ = ∑ n = 0 ∞ x n n ! 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \dots = \sum_{n=0}^\infty \frac{x^n}{n!} 1 + x + 2 ! x 2 + 3 ! x 3 + ⋯ = ∑ n = 0 ∞ n ! x n − ∞ < x < ∞ -\infty < x < \infty − ∞ < x < ∞
cos ( x ) \cos(x) cos ( x ) 1 − x 2 2 ! + x 4 4 ! − x 6 6 ! + ⋯ = ∑ n = 0 ∞ ( − 1 ) n x 2 n ( 2 n ) ! 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \frac{x^6}{6!} + \dots = \sum_{n=0}^\infty \frac{(-1)^n x^{2n}}{(2n)!} 1 − 2 ! x 2 + 4 ! x 4 − 6 ! x 6 + ⋯ = ∑ n = 0 ∞ ( 2 n )! ( − 1 ) n x 2 n − ∞ < x < ∞ -\infty < x < \infty − ∞ < x < ∞
sin ( x ) \sin(x) sin ( x ) x − x 3 3 ! + x 5 5 ! − x 7 7 ! + ⋯ = ∑ n = 0 ∞ ( − 1 ) n x 2 n + 1 ( 2 n + 1 ) ! x - \frac{x^3}{3!} + \frac{x^5}{5!} - \frac{x^7}{7!} + \dots = \sum_{n=0}^\infty \frac{(-1)^n x^{2n+1}}{(2n+1)!} x − 3 ! x 3 + 5 ! x 5 − 7 ! x 7 + ⋯ = ∑ n = 0 ∞ ( 2 n + 1 )! ( − 1 ) n x 2 n + 1 − ∞ < x < ∞ -\infty < x < \infty − ∞ < x < ∞
1 1 − x \frac{1}{1 - x} 1 − x 1 1 + x + x 2 + x 3 + ⋯ = ∑ n = 0 ∞ x n 1 + x + x^2 + x^3 + \dots = \sum_{n=0}^\infty x^n 1 + x + x 2 + x 3 + ⋯ = ∑ n = 0 ∞ x n ∣ x ∣ < 1 \vert x\vert< 1 ∣ x ∣ < 1 (Geometric Series)
ln ( 1 + x ) \ln(1 + x) ln ( 1 + x ) x − x 2 2 + x 3 3 − x 4 4 + ⋯ = ∑ n = 1 ∞ ( − 1 ) n − 1 x n n x - \frac{x^2}{2} + \frac{x^3}{3} - \frac{x^4}{4} + \dots = \sum_{n=1}^\infty \frac{(-1)^{n-1} x^n}{n} x − 2 x 2 + 3 x 3 − 4 x 4 + ⋯ = ∑ n = 1 ∞ n ( − 1 ) n − 1 x n − 1 < x ≤ 1 -1 < x \le 1 − 1 < x ≤ 1
Convergence Tests
To determine whether an infinite series ∑ a n \sum a_n ∑ a n converges:
Ratio Test : Compute L = lim n → ∞ ∣ a n + 1 a n ∣ L = \lim_{n \to \infty} \left| \frac{a_{n+1}}{a_n} \right| L = lim n → ∞ a n a n + 1 .
If L < 1 L < 1 L < 1 : Series converges absolutely.
If L > 1 L > 1 L > 1 : Series diverges.
If L = 1 L = 1 L = 1 : Test is inconclusive.
Geometric Series Test : The series ∑ n = 0 ∞ a r n \sum_{n=0}^{\infty} a r^n ∑ n = 0 ∞ a r n converges to S = a 1 − r S = \frac{a}{1 - r} S = 1 − r a if and only if ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 . If ∣ r ∣ ≥ 1 |r| \ge 1 ∣ r ∣ ≥ 1 , the series diverges.
- 5. Step-by-Step Worked Engineering Examples
- Worked Example 2.2.1: Mathematical Derivation of the EOQ Lot Size
Problem : In production inventory theory, an industrial facility faces constant annual demand D = 10,000 units/year D = 10{,}000\text{ units/year} D = 10 , 000 units/year , order/setup cost S = $ 7.20 per order S = \text{\textdollar}7.20\text{ per order} S = $ 7.20 per order , and annual unit holding cost H = $ 10 per unit/year H = \text{\textdollar}10\text{ per unit/year} H = $ 10 per unit/year . Total annual cost as a function of order lot size Q Q Q is modeled by: T C ( Q ) = 250,000 + D S Q + H Q 2 = 250,000 + 72,000 Q + 5 Q TC(Q) = 250{,}000 + \frac{D S}{Q} + \frac{H Q}{2} = 250{,}000 + \frac{72{,}000}{Q} + 5Q TC ( Q ) = 250 , 000 + Q D S + 2 H Q = 250 , 000 + Q 72 , 000 + 5 Q
Using calculus, determine the lot size Q ∗ Q^* Q ∗ that minimizes total annual cost, verify that the second derivative confirms a local minimum, and compute the minimum variable cost.
Solution :
Confirm the coefficients: D S = ( 10,000 ) ( 7.20 ) = 72,000 DS = (10{,}000)(7.20) = 72{,}000 D S = ( 10 , 000 ) ( 7.20 ) = 72 , 000 and H / 2 = 10 / 2 = 5 H/2 = 10/2 = 5 H /2 = 10/2 = 5 , matching the stated cost function.
Differentiate T C ( Q ) TC(Q) TC ( Q ) with respect to Q Q Q and set the derivative to zero: d T C d Q = − D S Q 2 + H 2 = − 72,000 Q 2 + 5 = 0 ⟹ 5 = 72,000 Q 2 \frac{dTC}{dQ} = -\frac{D S}{Q^2} + \frac{H}{2} = -\frac{72{,}000}{Q^2} + 5 = 0 \quad \implies \quad 5 = \frac{72{,}000}{Q^2} d Q d TC = − Q 2 D S + 2 H = − Q 2 72 , 000 + 5 = 0 ⟹ 5 = Q 2 72 , 000 Q 2 = 72,000 5 = 14,400 ⟹ Q ∗ = 14,400 = 120 units Q^2 = \frac{72{,}000}{5} = 14{,}400 \quad \implies \quad Q^* = \sqrt{14{,}400} = 120\text{ units} Q 2 = 5 72 , 000 = 14 , 400 ⟹ Q ∗ = 14 , 400 = 120 units (Cross-check against the closed-form EOQ formula: Q ∗ = 2 D S / H = 2 ( 10,000 ) ( 7.20 ) / 10 = 14,400 = 120 Q^* = \sqrt{2DS/H} = \sqrt{2(10{,}000)(7.20)/10} = \sqrt{14{,}400} = 120 Q ∗ = 2 D S / H = 2 ( 10 , 000 ) ( 7.20 ) /10 = 14 , 400 = 120 units.)
Execute the Second Derivative Test: d 2 T C d Q 2 = d d Q [ − 72,000 Q − 2 + 5 ] = 2 ( 72,000 ) Q − 3 = 144,000 Q 3 \frac{d^2TC}{dQ^2} = \frac{d}{dQ}\left[ -72{,}000 Q^{-2} + 5 \right] = 2(72{,}000) Q^{-3} = \frac{144{,}000}{Q^3} d Q 2 d 2 TC = d Q d [ − 72 , 000 Q − 2 + 5 ] = 2 ( 72 , 000 ) Q − 3 = Q 3 144 , 000
Evaluate at Q ∗ = 120 Q^* = 120 Q ∗ = 120 : d 2 T C d Q 2 ∣ Q = 120 = 144,000 ( 120 ) 3 = 144,000 1,728,000 = + 0.0833 > 0 \frac{d^2TC}{dQ^2}\bigg|_{Q=120} = \frac{144{,}000}{(120)^3} = \frac{144{,}000}{1{,}728{,}000} = +0.0833 > 0 d Q 2 d 2 TC Q = 120 = ( 120 ) 3 144 , 000 = 1 , 728 , 000 144 , 000 = + 0.0833 > 0
Conclusion : Because the second derivative is strictly positive, the cost curve is convex (concave upward), proving that Q ∗ = 120 units Q^* = 120\text{ units} Q ∗ = 120 units represents a strict local and global minimum.
Worked Example 2.2.2: Component MTTF via Integration by Parts
Problem : An industrial robotic arm actuator has a failure probability density function f ( t ) = 0.04 t e − 0.2 t f(t) = 0.04 t e^{-0.2 t} f ( t ) = 0.04 t e − 0.2 t for t ≥ 0 t \ge 0 t ≥ 0 (operating hours in thousands). Compute the mean time to failure MTTF = ∫ 0 ∞ t f ( t ) d t \text{MTTF} = \int_0^\infty t f(t) dt MTTF = ∫ 0 ∞ t f ( t ) d t .
Solution :
Set up the expected value integral: MTTF = ∫ 0 ∞ t ( 0.04 t e − 0.2 t ) d t = 0.04 ∫ 0 ∞ t 2 e − 0.2 t d t \text{MTTF} = \int_0^\infty t (0.04 t e^{-0.2 t}) \, dt = 0.04 \int_0^\infty t^2 e^{-0.2 t} \, dt MTTF = ∫ 0 ∞ t ( 0.04 t e − 0.2 t ) d t = 0.04 ∫ 0 ∞ t 2 e − 0.2 t d t
Recall the general gamma-type integral ∫ 0 ∞ t n e − k t d t = n ! k n + 1 \int_0^\infty t^n e^{-k t} dt = \frac{n!}{k^{n+1}} ∫ 0 ∞ t n e − k t d t = k n + 1 n ! for k > 0 k > 0 k > 0 :
Here n = 2 n = 2 n = 2 and k = 0.2 = 1 / 5 k = 0.2 = 1/5 k = 0.2 = 1/5 : ∫ 0 ∞ t 2 e − 0.2 t d t = 2 ! ( 0.2 ) 2 + 1 = 2 ( 0.2 ) 3 = 2 0.008 = 250 \int_0^\infty t^2 e^{-0.2 t} \, dt = \frac{2!}{(0.2)^{2+1}} = \frac{2}{(0.2)^3} = \frac{2}{0.008} = 250 ∫ 0 ∞ t 2 e − 0.2 t d t = ( 0.2 ) 2 + 1 2 ! = ( 0.2 ) 3 2 = 0.008 2 = 250
Multiply by the constant scalar 0.04 0.04 0.04 : MTTF = 0.04 × 250 = 10 (thousand hours) = 10,000 operating hours \text{MTTF} = 0.04 \times 250 = 10\text{ (thousand hours)} = 10{,}000\text{ operating hours} MTTF = 0.04 × 250 = 10 (thousand hours) = 10 , 000 operating hours
6. NCEES Reference Handbook Tips & Realistic Exam Traps
Quotient Rule Sign Error : The most common differentiation mistake on the FE exam is inverting the numerator of the quotient rule: u v ′ − u ′ v v 2 \frac{u v' - u' v}{v^2} v 2 u v ′ − u ′ v instead of the correct u ′ v − u v ′ v 2 \frac{u' v - u v'}{v^2} v 2 u ′ v − u v ′ . This flips the sign of the derivative, which falsely converts a calculated minimum into a maximum.
Saddle Points vs. Inconclusive Tests : If D = f x x f y y − ( f x y ) 2 < 0 D = f_{xx} f_{yy} - (f_{xy})^2 < 0 D = f xx f yy − ( f x y ) 2 < 0 , the stationary point is definitively a saddle point . Do NOT confuse this with D = 0 D = 0 D = 0 (which is the only condition where the test is inconclusive). A saddle point means the function increases along one path and decreases along another.
Boundary Points in Optimization : If an exam problem specifies operational constraints—such as machine capacity 0 ≤ x ≤ 50 0 \le x \le 50 0 ≤ x ≤ 50 —always verify whether the global optimum lies on the boundary rather than an unconstrained interior critical point.
Integration by Parts Signs : In ∫ u d v = u v − ∫ v d u \int u \, dv = u v - \int v \, du ∫ u d v = uv − ∫ v d u , when v v v contains a negative sign (such as v = − 1 k e − k t v = -\frac{1}{k} e^{-kt} v = − k 1 e − k t ), subtracting a negative creates an addition: u v − ∫ ( − term ) d u = u v + ∫ term d u u v - \int (-\text{term}) du = u v + \int \text{term} \, du uv − ∫ ( − term ) d u = uv + ∫ term d u . Missing this double negative is an intentional distractor trap on FE exam questions.