IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v321y2025i1p192-207.html
   My bibliography  Save this article

Partially adaptive multistage stochastic programming

Author

Listed:
  • Kayacık, Sezen Ece
  • Basciftci, Beste
  • Schrotenboer, Albert H.
  • Ursavas, Evrim

Abstract

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.

Suggested Citation

  • Kayacık, Sezen Ece & Basciftci, Beste & Schrotenboer, Albert H. & Ursavas, Evrim, 2025. "Partially adaptive multistage stochastic programming," European Journal of Operational Research, Elsevier, vol. 321(1), pages 192-207.
    • Handle: RePEc:eee:ejores:v:321:y:2025:i:1:p:192-207
    DOI: 10.1016/j.ejor.2024.09.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724007379
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.09.034?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Carlos Herrera & Sana Belmokhtar-Berraf & André Thomas & Víctor Parada, 2016. "A reactive decision-making approach to reduce instability in a master production schedule," International Journal of Production Research, Taylor & Francis Journals, vol. 54(8), pages 2394-2404, April.
    2. Jonathan Chemama & Maxime C. Cohen & Ruben Lobel & Georgia Perakis, 2019. "Consumer Subsidies with a Strategic Supplier: Commitment vs. Flexibility," Management Science, INFORMS, vol. 65(2), pages 681-713, February.
    3. Dimitris Bertsimas & Shimrit Shtern & Bradley Sturt, 2023. "A Data-Driven Approach to Multistage Stochastic Linear Optimization," Management Science, INFORMS, vol. 69(1), pages 51-74, January.
    4. Cavagnini, Rossana & Bertazzi, Luca & Maggioni, Francesca, 2022. "A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment," European Journal of Operational Research, Elsevier, vol. 301(3), pages 912-922.
    5. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    6. Kavinesh J. Singh & Andy B. Philpott & R. Kevin Wood, 2009. "Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems," Operations Research, INFORMS, vol. 57(5), pages 1271-1286, October.
    7. Serhat Gul & Brian T. Denton & John W. Fowler, 2015. "A Progressive Hedging Approach for Surgery Planning Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 755-772, November.
    8. Yongpei Guan & Andrew J. Miller, 2008. "Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 56(5), pages 1172-1183, October.
    9. Rudloff, Birgit & Street, Alexandre & Valladão, Davi M., 2014. "Time consistency and risk averse dynamic decision models: Definition, interpretation and practical consequences," European Journal of Operational Research, Elsevier, vol. 234(3), pages 743-750.
    10. Kai Pan & Yongpei Guan, 2016. "Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment," Operations Research, INFORMS, vol. 64(6), pages 1482-1498, December.
    11. Colvin, Matthew & Maravelias, Christos T., 2010. "Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming," European Journal of Operational Research, Elsevier, vol. 203(1), pages 205-215, May.
    12. Gustavo Angulo & Shabbir Ahmed & Santanu S. Dey, 2016. "Improving the Integer L-Shaped Method," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 483-499, August.
    13. Matteo Fischetti & Ivana Ljubić & Markus Sinnl, 2017. "Redesigning Benders Decomposition for Large-Scale Facility Location," Management Science, INFORMS, vol. 63(7), pages 2146-2162, July.
    14. Joseph M. Milner & Panos Kouvelis, 2005. "Order Quantity and Timing Flexibility in Supply Chains: The Role of Demand Characteristics," Management Science, INFORMS, vol. 51(6), pages 970-985, June.
    15. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    16. Kai Huang & Shabbir Ahmed, 2009. "The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty," Operations Research, INFORMS, vol. 57(4), pages 893-904, August.
    17. Ragheb Rahmaniani & Shabbir Ahmed & Teodor Gabriel Crainic & Michel Gendreau & Walter Rei, 2020. "The Benders Dual Decomposition Method," Operations Research, INFORMS, vol. 68(3), pages 878-895, May.
    18. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    19. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    20. Jikai Zou & Shabbir Ahmed & Xu Andy Sun, 2018. "Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 388-401, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhouchun Huang & Qipeng P. Zheng & Andrew L. Liu, 2022. "A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1919-1939, July.
    2. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    3. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    4. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    5. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.
    6. Liu, Bingqian & Bissuel, Côme & Courtot, François & Gicquel, Céline & Quadri, Dominique, 2024. "A generalized Benders decomposition approach for the optimal design of a local multi-energy system," European Journal of Operational Research, Elsevier, vol. 318(1), pages 43-54.
    7. Kim, Dowon & Ryu, Heelang & Lee, Jiwoong & Kim, Kyoung-Kuk, 2022. "Balancing risk: Generation expansion planning under climate mitigation scenarios," European Journal of Operational Research, Elsevier, vol. 297(2), pages 665-679.
    8. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    9. Zhili Zhou & Yongpei Guan, 2013. "Two-stage stochastic lot-sizing problem under cost uncertainty," Annals of Operations Research, Springer, vol. 209(1), pages 207-230, October.
    10. Aliakbari Sani, Sajad & Bahn, Olivier & Delage, Erick, 2022. "Affine decision rule approximation to address demand response uncertainty in smart Grids’ capacity planning," European Journal of Operational Research, Elsevier, vol. 303(1), pages 438-455.
    11. Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
    12. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2021. "On single-source capacitated facility location with cost and fairness objectives," European Journal of Operational Research, Elsevier, vol. 289(3), pages 959-974.
    13. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    14. Rist, Yannik & Tilk, Christian & Forbes, Michael, 2024. "Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 836-850.
    15. Kenjiro Yagi & Ramteen Sioshansi, 2024. "Nested Benders’s decomposition of capacity-planning problems for electricity systems with hydroelectric and renewable generation," Computational Management Science, Springer, vol. 21(1), pages 1-31, June.
    16. Andre Luiz Diniz & Maria Elvira P. Maceira & Cesar Luis V. Vasconcellos & Debora Dias J. Penna, 2020. "A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning," Annals of Operations Research, Springer, vol. 292(2), pages 649-681, September.
    17. Pavlo Glushko & Csaba I. Fábián & Achim Koberstein, 2022. "An L-shaped method with strengthened lift-and-project cuts," Computational Management Science, Springer, vol. 19(4), pages 539-565, October.
    18. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    19. Lin, Yun Hui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2022. "Omnichannel facility location and fulfillment optimization," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 187-209.
    20. Martin Šmíd & Václav Kozmík, 2024. "Approximation of multistage stochastic programming problems by smoothed quantization," Review of Managerial Science, Springer, vol. 18(7), pages 2079-2114, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:321:y:2025:i:1:p:192-207. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.