A novel L-shaped refinement chain cuts method for two-stage stochastic programs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916075287871488 |
|---|---|
| author | Hewitt, Mike Maggioni, Francesca Spinelli, Andrea |
| author_facet | Hewitt, Mike Maggioni, Francesca Spinelli, Andrea |
| contents | This paper introduces the L-shaped refinement chain cuts method, a novel approach for solving two-stage stochastic programs. The proposed method integrates the refinement chain of scenarios within the classical L-shaped decomposition framework. In the proposed approach, the full scenario set is partitioned into subgroups at each level of the refinement chain, and one subproblem is solved for each subgroup rather than for each individual scenario as in the classical L-shaped method. The proposed framework generalizes both the classical multi-cut and single-cut L-shaped formulations. Theoretical convergence properties to the optimal solution of the original two-stage stochastic program are established for every refinement level. In addition, the relationships between consecutive refinement levels are characterized in terms of Benders cuts, leading to the development of an iterative refinement-based solution algorithm across consecutive levels of the refinement chain. The effectiveness of the proposed method is evaluated on a two-stage stochastic fixed-charge multicommodity network design problem under a mean-risk formulation. Computational experiments on benchmark instances demonstrate the promising performance of the proposed framework and highlight its applicability to large-scale risk-averse stochastic optimization problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_02469 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A novel L-shaped refinement chain cuts method for two-stage stochastic programs Hewitt, Mike Maggioni, Francesca Spinelli, Andrea Optimization and Control This paper introduces the L-shaped refinement chain cuts method, a novel approach for solving two-stage stochastic programs. The proposed method integrates the refinement chain of scenarios within the classical L-shaped decomposition framework. In the proposed approach, the full scenario set is partitioned into subgroups at each level of the refinement chain, and one subproblem is solved for each subgroup rather than for each individual scenario as in the classical L-shaped method. The proposed framework generalizes both the classical multi-cut and single-cut L-shaped formulations. Theoretical convergence properties to the optimal solution of the original two-stage stochastic program are established for every refinement level. In addition, the relationships between consecutive refinement levels are characterized in terms of Benders cuts, leading to the development of an iterative refinement-based solution algorithm across consecutive levels of the refinement chain. The effectiveness of the proposed method is evaluated on a two-stage stochastic fixed-charge multicommodity network design problem under a mean-risk formulation. Computational experiments on benchmark instances demonstrate the promising performance of the proposed framework and highlight its applicability to large-scale risk-averse stochastic optimization problems. |
| title | A novel L-shaped refinement chain cuts method for two-stage stochastic programs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2606.02469 |