Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.06700 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913982629019648 |
|---|---|
| author | Li, Zhe Agyeman, Bernard T. Mitrai, Ilias Daoutidis, Prodromos |
| author_facet | Li, Zhe Agyeman, Bernard T. Mitrai, Ilias Daoutidis, Prodromos |
| contents | Benders decomposition (BD), along with its generalized version (GBD), is a widely used algorithm for solving large-scale mixed-integer optimization problems that arise in the operation of process systems. However, the off-the-shelf application to online settings can be computationally inefficient due to the repeated solution of the master problem. An approach to reduce the solution time is to solve the master problem to local optimality. However, identifying the level of suboptimality at each iteration that minimizes the total solution time is nontrivial. In this paper, we propose the application of reinforcement learning to determine the best optimality gap at each GBD iteration. First, we show that the inexact GBD can converge to the optimal solution given a properly designed optimality gap schedule. Next, leveraging reinforcement learning, we learn a policy that minimizes the total solution time, balancing the solution time per iteration with optimality gap improvement. In the resulting RL-iGBD algorithm, the policy adapts the optimality gap at each iteration based on the features of the problem and the solution progress. In numerical experiments on a mixed-integer economic model predictive control problem, we show that the proposed RL-enhanced iGBD method achieves substantial reductions in solution time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_06700 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning to control inexact Benders decomposition via reinforcement learning Li, Zhe Agyeman, Bernard T. Mitrai, Ilias Daoutidis, Prodromos Optimization and Control Benders decomposition (BD), along with its generalized version (GBD), is a widely used algorithm for solving large-scale mixed-integer optimization problems that arise in the operation of process systems. However, the off-the-shelf application to online settings can be computationally inefficient due to the repeated solution of the master problem. An approach to reduce the solution time is to solve the master problem to local optimality. However, identifying the level of suboptimality at each iteration that minimizes the total solution time is nontrivial. In this paper, we propose the application of reinforcement learning to determine the best optimality gap at each GBD iteration. First, we show that the inexact GBD can converge to the optimal solution given a properly designed optimality gap schedule. Next, leveraging reinforcement learning, we learn a policy that minimizes the total solution time, balancing the solution time per iteration with optimality gap improvement. In the resulting RL-iGBD algorithm, the policy adapts the optimality gap at each iteration based on the features of the problem and the solution progress. In numerical experiments on a mixed-integer economic model predictive control problem, we show that the proposed RL-enhanced iGBD method achieves substantial reductions in solution time. |
| title | Learning to control inexact Benders decomposition via reinforcement learning |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2508.06700 |