Partially adaptive multistage stochastic programming

doi:10.1016/j.ejor.2024.09.034

Return

Partially adaptive multistage stochastic programming

2025-02-01

PRE

Sezen Ece Kayacık

Beste Basciftci *

Albert H. Schrotenboer

Evrim Ursavas

DOI：10.1016/j.ejor.2024.09.034

Original

Original request for help

Save

Abstract

En 中文

Multistage stochastic programming is a powerful tool allowing decision-makers to revise their decisions at each stage based on the realized uncertainty. However, organizations are not able to be fully flexible, as decisions cannot be revised too frequently in practice. Consequently, decision commitment becomes crucial to ensure that initially made decisions remain unchanged for a certain period of time. This paper introduces partially adaptive multistage stochastic programming, a new optimization paradigm that strikes an optimal balance between decision flexibility and commitment by determining the best stages to revise decisions depending on the allowed level of flexibility. We introduce a novel mathematical formulation and theoretical properties eliminating certain constraint sets. Furthermore, we develop a decomposition method that effectively handles mixed-integer partially adaptive multistage programs by adapting the integer L-shaped method and Benders decomposition. Computational experiments on stochastic lot-sizing and generation expansion planning problems show substantial advantages attained through optimal selections of revision times when flexibility is limited, while demonstrating computational efficiency attained by employing the proposed properties and solution methodology. By adhering to these optimal revision times, organizations can achieve performance levels comparable to fully flexible settings.

Keywords:

Stochastic programming

Multistage stochastic optimization

Mixed-integer programming

Lot-sizing

Generation expansion planning