Papers
Topics
Authors
Recent
Search
2000 character limit reached

A computational study of cutting-plane methods for multi-stage stochastic integer programs

Published 4 May 2024 in math.OC and math.CO | (2405.02533v1)

Abstract: We report a computational study of cutting plane algorithms for multi-stage stochastic mixed-integer programming models with the following cuts: (i) Benders', (ii) Integer L-shaped, and (iii) Lagrangian cuts. We first show that Integer L-shaped cuts correspond to one of the optimal solutions of the Lagrangian dual problem, and, therefore, belong to the class of Lagrangian cuts. To efficiently generate these cuts, we present an enhancement strategy to reduce time-consuming exact evaluations of integer subproblems by alternating between cuts derived from the relaxed and exact computation. Exact evaluations are only employed when Benders' cut from the relaxation fails to cut off the incumbent solution. Our preliminary computational results show the merit of this approach on multiple classes of real-world problems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Improving the integer L-shaped method. INFORMS Journal on Computing, 28(3):483–499, 2016.
  2. JF Benders. Partitioning procedures for solving mixed-variable programming problems, Numerische Matkematic 4. SS8, 1962.
  3. John R Birge. Decomposition and partitioning methods for multistage stochastic linear programs. Operations research, 33(5):989–1007, 1985.
  4. The value function of an integer program. Mathematical programming, 23(1):237–273, 1982.
  5. Dual decomposition in stochastic integer programming. Operations Research Letters, 24(1-2):37–45, 1999.
  6. On generating Lagrangian cuts for two-stage stochastic integer programs. INFORMS Journal on Computing, 34(4):2332–2349, 2022.
  7. Sddp. jl: a Julia package for stochastic dual dynamic programming. INFORMS Journal on Computing, 33(1):27–33, 2021.
  8. Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Mathematical Programming, 144(1):39–64, 2014.
  9. An algorithm for stochastic medium-term hydrothermal scheduling under spot price uncertainty. In Proceedings of 13th Power Systems Computation Conference, 1999.
  10. Sampling strategies and stopping criteria for stochastic dual dynamic programming: a case study in long-term hydrothermal scheduling. Energy Systems, 2(1):1–31, 2011.
  11. Modeling and solving a large-scale generation expansion planning problem under uncertainty. Energy Systems, 2:209–242, 2011.
  12. An introduction to two-stage stochastic mixed-integer programming. In Rajan Batta and Jiming Peng, editors, TutORials in Operations Research: Leading Developments from INFORMS Communities, chapter 1, pages 1–27. INFORMS, 2017.
  13. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3):133–142, 1993.
  14. Numerical optimization. Springer, 1999.
  15. Lewis Ntaimo. Fenchel decomposition for stochastic mixed-integer programming. Journal of Global Optimization, 55:141–163, 2013.
  16. The million-variable “march” for stochastic combinatorial optimization. Journal of Global Optimization, 32:385–400, 2005.
  17. Multi-stage stochastic optimization applied to energy planning. Mathematical programming, 52:359–375, 1991.
  18. Midas: A mixed integer dynamic approximation scheme. Mathematical Programming, 181(1):19–50, 2020.
  19. The ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Mathematical Programming, 161:193–235, 2017.
  20. The Benders dual decomposition method. Operations Research, 68(3):878–895, 2020.
  21. The C3superscript𝐶3C^{3}italic_C start_POSTSUPERSCRIPT 3 end_POSTSUPERSCRIPT theorem and a D2superscript𝐷2D^{2}italic_D start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT algorithm for large scale stochastic mixed-integer programming: Set convexification. Mathematical Programming, 104:1–20, 2005.
  22. Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming, 106:203–223, 2006.
  23. Strategic bidding for multiple price-maker hydroelectric producers. IIE Transactions, 47(9):1013–1031, 2015.
  24. Non-convexities representation on hydrothermal operation planning using SDDP. URL: www. psr-inc. com, submitted, 2013.
  25. Niels van der Laan and Ward Romeijnders. A converging Benders’ decomposition algorithm for two-stage mixed-integer recourse models. University of Groningen, SOM Research School, 2020.
  26. Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM Journal on Optimization, 24(4):1933–1951, 2014.
  27. Stochastic dual dynamic integer programming. Mathematical Programming, 175(1):461–502, 2019.
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 4 likes about this paper.