Wagner-Whitin Algorithm
Also known as: Wagner-Whitin lot-sizing, dynamic lot-sizing algorithm
The Wagner-Whitin Algorithm, introduced by Harvey M. Wagner and Thomson M. Whitin in 1958, is a dynamic programming solution to the capacitated lot-sizing problem. It determines optimal production quantities over multiple periods to minimize the total cost of production setup and inventory holding while meeting deterministic demand.
Key highlights
- Optimal solution guaranteed for the capacitated lot-sizing problem
- Efficiently solves problems with moderate time horizons using dynamic programming
- Handles time-varying demand and costs naturally
- Provides exact results for comparison with heuristic approaches
- Polynomial time complexity makes it practical for real-world problems
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Apply the Wagner-Whitin algorithm when solving dynamic lot-sizing problems with deterministic demand, fixed setup costs, and linear holding costs over a finite planning horizon. It is ideal for manufacturing and supply chain planning when production decisions must account for both current and future demand. Use it when demand is not stationary and batch sizes are not predetermined. For very large time horizons, consider heuristics or approximations.
Strengths & limitations
- Optimal solution guaranteed for the capacitated lot-sizing problem
- Efficiently solves problems with moderate time horizons using dynamic programming
- Handles time-varying demand and costs naturally
- Provides exact results for comparison with heuristic approaches
- Polynomial time complexity makes it practical for real-world problems
- Computational complexity increases with time horizon length and number of items
- Assumes deterministic demand; cannot directly handle demand uncertainty
- Less efficient for problems with capacity constraints on production or storage
- Not suitable for problems with multiple items with shared resources (requires branch and bound or approximations)
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
What is the zero-inventory property and why is it important?
The zero-inventory property states that in an optimal solution, production occurs only at the start of periods where accumulated demand justifies the setup cost. This eliminates unnecessary intermediate inventory and reduces total cost.
How does the algorithm handle multiple products competing for production resources?
The basic Wagner-Whitin algorithm solves single-item problems. For multi-item problems, use branch-and-bound methods, Lagrangian relaxation, or heuristics like the Silver-Meal rule.
Can the algorithm handle demand uncertainty?
No, the algorithm requires deterministic demand. For stochastic demand, use dynamic programming with probability distributions or employ safety stock policies and robust planning methods.
What is the time complexity of the Wagner-Whitin algorithm?
The worst-case time complexity is O(T²) where T is the number of time periods, making it practical for planning horizons of hundreds of periods.
Sources
- 1.Wagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89-96.
- 2.Pochet, Y., & Wolsey, L. A. (2006). Production Planning by Mixed Integer Programming. Springer.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 3). Wagner-Whitin Algorithm. ScholarGate. https://scholargate.app/operations-research/wagner-whitin-algorithm