Stochastic dual dynamic programming approach for cash-flow inventory problems with overdraft

We examine a multi-product cash-flow inventory problem that accounts for lead times and uncertain demand. Our analysis includes a specific type of financing—overdrafts—where retailers facing cash constraints can leverage overdrafts to manage unexpected cash shortfalls. To address this issue, we propose a stochastic programming model and solve it using stochastic dual dynamic programming (SDDP). Additional auxiliary variables are introduced in the sub-problems to facilitate the construction of cuts in the presence of lead times. To enhance computational efficiency, we provide two techniques: removing the duplicate added constraints in the model and exploiting dual value similarities of the constraints across sub-problems. Numerical experiments demonstrate that SDDP can solve the problem with small optimality gaps compared to the values obtained from stochastic dynamic programming, and the proposed acceleration strategies significantly reduce computation time with minor impact on solution quality.

Authors

Publication Details

Journal
European Journal of Operational Research
Published
2026-04-01
DOI
https://doi.org/10.1016/j.ejor.2026.04.003
Primary Topic
Supply Chain and Inventory Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stochastic dual dynamic programming approach for cash-flow inventory problems with overdraft

Zhen Chen, Thomas W. Archibald
European Journal of Operational Research
Supply Chain and Inventory Management
article

Stochastic dual dynamic programming approach for cash-flow inventory problems with overdraft

Zhen Chen, Thomas W. Archibald
article en

Abstract

We examine a multi-product cash-flow inventory problem that accounts for lead times and uncertain demand. Our analysis includes a specific type of financing—overdrafts—where retailers facing cash constraints can leverage overdrafts to manage unexpected cash shortfalls. To address this issue, we propose a stochastic programming model and solve it using stochastic dual dynamic programming (SDDP). Additional auxiliary variables are introduced in the sub-problems to facilitate the construction of cuts in the presence of lead times. To enhance computational efficiency, we provide two techniques: removing the duplicate added constraints in the model and exploiting dual value similarities of the constraints across sub-problems. Numerical experiments demonstrate that SDDP can solve the problem with small optimality gaps compared to the values obtained from stochastic dynamic programming, and the proposed acceleration strategies significantly reduce computation time with minor impact on solution quality.

European Journal of Operational Research
National Natural Science Foundation of China, Brunel University London
Decent work and economic growth
Openalex Percentile: Top 17%
Supply Chain and Inventory Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Stochastic dual dynamic programming approach for cash-flow inventory problems with overdraft — Zhen Chen, Thomas W. Archibald · European Journal of Operational Research (2026) | TGRS Research Map | TGRS