MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens

Author(s)
Bertsimas, Dimitris; ten Eikelder, Stefan C. M.; den Hertog, Dick; Trichakis, Nikolaos
Thumbnail
Download10107_2023_1983_ReferencePDF.pdf (814.3Kb)
Open Access Policy

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-ShareAlike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We formalize the concept of Pareto Adaptive Robust Optimality (PARO) for linear two-stage Adaptive Robust Optimization (ARO) problems, with fixed continuous recourse. A worst-case optimal solution pair of here-and-now decisions and wait-and-see decisions is PARO if it cannot be Pareto dominated by another solution, i.e., there does not exist another worst-case optimal pair that performs at least as good in all scenarios in the uncertainty set and strictly better in at least one scenario. We argue that, unlike PARO, extant solution approaches—including those that adopt Pareto Robust Optimality from static robust optimization—could fail in ARO and yield solutions that can be Pareto dominated. The latter could lead to inefficiencies and suboptimal performance in practice. We prove the existence of PARO solutions, and present approaches for finding and approximating such solutions. Amongst others, we present a constraint & column generation method that produces a PARO solution for the considered two-stage ARO problems by iteratively improving upon a worst-case optimal solution. We present numerical results for a facility location problem that demonstrate the practical value of PARO solutions. Our analysis of PARO relies on an application of Fourier–Motzkin Elimination as a proof technique. We demonstrate how this technique can be valuable in the analysis of ARO problems, besides PARO. In particular, we employ it to devise more concise and more insightful proofs of known results on (worst-case) optimality of decision rule structures.
Date issued
2023-06-30
URI
https://hdl.handle.net/1721.1/154092
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Mathematical Programming
Publisher
Springer Science and Business Media LLC
Citation
Bertsimas, D., ten Eikelder, S.C.M., den Hertog, D. et al. Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens. Math. Program. 205, 485–538 (2024).
Version: Author's final manuscript
ISSN
0025-5610
1436-4646
Keywords
General Mathematics, Software

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.