Dynamic Programming for solving lot sizing with varying cost
Varying cost - holding cost, ordering cost, raw material price
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Solving lot sizing problem with dynamic programming based on the shortest path of network flow. Holding cost, ordering cost and raw material cost are variable. The special characteristic of this algorithm run on problem with zero demand, while Wagner-Whitin algorithm does not certainly compute.
Cite As
Warut Boonphakdee (2026). Dynamic Programming for solving lot sizing with varying cost (https://www.mathworks.com/matlabcentral/fileexchange/74528-dynamic-programming-for-solving-lot-sizing-with-varying-cost), MATLAB Central File Exchange. Retrieved .
General Information
- Version 2.1.0 (3.5 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
