Dynamic Programming for solving lot sizing with varying cost

Version 2.1.0 (3.5 KB) by Warut Boonphakdee
Varying cost - holding cost, ordering cost, raw material price
0.0
(0)
83 Downloads
Updated 9 Apr 2020

View License

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 .

MATLAB Release Compatibility
Created with R2019b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Version Published Release Notes
2.1.0

Add how to put data in this code and explain the solution mation
2.0.0

When demand to be zeros , this algorithm can be effectively solved

1.0.0