Dynamic programming to solve Single-item UDLSP

Version 1.0.0 (3.09 KB) by Warut Boonphakdee
This code is to find an optimal solution for the single-item uncapacitated dynamic lot-sizing problem with time-varying costs (UDLSP)
0.0
(0)
7 Downloads
Updated 7 May 2023

View License

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 .

MATLAB Release Compatibility
Created with R2023a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags
Version Published Release Notes
1.0.0