Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Multistage Robust Mixed-Integer Optimization with Adaptive Partitions

Multistage Robust Mixed-Integer Optimization with Adaptive Partitions

Thumbnail Image
Download
Name

Multistage Robust Mixed Integer Optimization with Adaptive Partitions.pdf

Size

826.57 KB

Format

Adobe PDF

Checksum (MD5)

01918634f92a79afccca1b1f98760bd4

Author(s)
Bertsimas, Dimitris J
•
Dunning, Iain Robert
Date Issued
June 2016
Journal
Operations Research
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Bertsimas, Dimitris and Dunning, Iain. “Multistage Robust Mixed-Integer Optimization with Adaptive Partitions.” Operations Research 64, no. 4 (August 2016): 980–998.
Version
Original manuscript
Abstract
We present a new partition-and-bound method for multistage adaptive mixed-integer optimization (AMIO) problems that extends previous work on finite adaptability. The approach analyzes the optimal solution to a static (nonadaptive) version of an AMIO problem to gain insight into which regions of the uncertainty set are restricting the objective function value. We use this information to construct partitions in the uncertainty set, leading to a finitely adaptable formulation of the problem. We use the same information to determine a lower bound on the fully adaptive solution. The method repeats this process iteratively to further improve the objective until a desired gap is reached. We provide theoretical motivation for this method, and characterize its convergence properties and the growth in the number of partitions. Using these insights, we propose and evaluate enhancements to the method such as warm starts and smarter partition creation. We describe in detail how to apply finite adaptability to multistage AMIO problems to appropriately address nonanticipativity restrictions. Finally, we demonstrate in computational experiments that the method can provide substantial improvements over a nonadaptive solution and existing methods for problems described in the literature. In particular, we find that our method produces high-quality solutions versus the amount of computational effort, even as the problem scales in the number of time stages and the number of decision variables.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/108744
DOI of Published Version
https://doi.org/10.1287/opre.2016.1515
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.