Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.09091 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911389826678784 |
|---|---|
| author | Kothari, Harshit Luedtke, James R. |
| author_facet | Kothari, Harshit Luedtke, James R. |
| contents | Sample average approximation (SAA) is a technique for obtaining approximate solutions to stochastic programs that uses the average from a random sample to approximate the expected value that is being optimized. Since the outcome from solving an SAA is random, statistical estimates on the optimal value of the true problem can be obtained by solving multiple SAA replications with independent samples. We study techniques to accelerate the solution of this set of SAA replications, when solving them sequentially via Benders decomposition. We investigate how to exploit similarities in the problem structure, as the replications just differ in the realizations of the random samples. Our extensive computational experiments provide empirical evidence that our techniques for using information from solving previous replications can significantly reduce the solution time of later replications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_09091 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Accelerating Benders decomposition for solving a sequence of sample average approximation replications Kothari, Harshit Luedtke, James R. Optimization and Control Sample average approximation (SAA) is a technique for obtaining approximate solutions to stochastic programs that uses the average from a random sample to approximate the expected value that is being optimized. Since the outcome from solving an SAA is random, statistical estimates on the optimal value of the true problem can be obtained by solving multiple SAA replications with independent samples. We study techniques to accelerate the solution of this set of SAA replications, when solving them sequentially via Benders decomposition. We investigate how to exploit similarities in the problem structure, as the replications just differ in the realizations of the random samples. Our extensive computational experiments provide empirical evidence that our techniques for using information from solving previous replications can significantly reduce the solution time of later replications. |
| title | Accelerating Benders decomposition for solving a sequence of sample average approximation replications |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2411.09091 |