Dynamic Programming for solving lot sizing with varying cost
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 (2024). 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 .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.