Abstract
We investigate the properties of robust solutions of the Capacitated Facility Location Problem with uncertain demand. We show that the monotonic behavior of the price of robustness is not guaranteed, and therefore that one cannot discriminate among alternative robust solutions by simply relying on the trade-off price-vs-robustness. Furthermore, we report a computational study on benchmark instances from the literature and on instances derived from a real-world application, which demonstrates the validity in practice of our findings.
Original language | English |
---|---|
Pages (from-to) | 2711-2727 |
Number of pages | 17 |
Journal | Optimization Letters |
Volume | 16 |
Issue number | 9 |
DOIs | |
Publication status | Published - Dec 2022 |
Externally published | Yes |
Keywords
- Integer programming
- Network/graphs: applications
- Robust optimization