On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910691914416128 |
|---|---|
| author | Deng, Haoyun Xie, Weijun |
| author_facet | Deng, Haoyun Xie, Weijun |
| contents | We study stochastic mixed integer programs with both first-stage and recourse decisions involving mixed integer variables. A new family of Lagrangian cuts, termed ``ReLU Lagrangian cuts," is introduced by reformulating the nonanticipativity constraints using ReLU functions. These cuts can be integrated into scenario decomposition methods. We show that including ReLU Lagrangian cuts is sufficient to achieve optimality in the original stochastic mixed integer programs. Without solving the Lagrangian dual problems, we derive closed-form expressions for these cuts. Furthermore, to speed up the cut-generating procedures, we introduce linear programming-based methods to enhance the cut coefficients. Numerical studies demonstrate the effectiveness of the proposed cuts compared to existing cut families. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01229 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming Deng, Haoyun Xie, Weijun Optimization and Control We study stochastic mixed integer programs with both first-stage and recourse decisions involving mixed integer variables. A new family of Lagrangian cuts, termed ``ReLU Lagrangian cuts," is introduced by reformulating the nonanticipativity constraints using ReLU functions. These cuts can be integrated into scenario decomposition methods. We show that including ReLU Lagrangian cuts is sufficient to achieve optimality in the original stochastic mixed integer programs. Without solving the Lagrangian dual problems, we derive closed-form expressions for these cuts. Furthermore, to speed up the cut-generating procedures, we introduce linear programming-based methods to enhance the cut coefficients. Numerical studies demonstrate the effectiveness of the proposed cuts compared to existing cut families. |
| title | On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2411.01229 |