Dynamic programming to solve Single-item UDLSP
This code is to find an optimal solution for the single-item uncapacitated dynamic lot-sizing problem with time-varying costs (UDLSP)
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Dynamic programming based on network flow approach is applied to find an optimal solution for the single-item uncapacitated dynamic lot-sizing problem. This code is used for calculating in article , W.Boonphakdee and P. Charnsethikul "Column generation approach for solving uncapacitated dynamic lot-sizing problems with time-varying costs" International Journal of Mathematics in Operational Research vol.23 no.1 pp.55-75. 2022.
Cite As
Warut Boonphakdee (2026). Dynamic programming to solve Single-item UDLSP (https://www.mathworks.com/matlabcentral/fileexchange/129089-dynamic-programming-to-solve-single-item-udlsp), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0 (3.09 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
