Improved Decision Rule Approximations for Multi-Stage Robust Optimization via Copositive Programming release_6on2gzpnpjbuhdnft4our64mfa

by Guanglin Xu, Grani A. Hanasusanto

Released as a article .



We study decision rule approximations for generic multi-stage robust linear optimization problems. We consider linear decision rules for the case when the objective coefficients, the recourse matrices, and the right-hand sides are uncertain, and consider quadratic decision rules for the case when only the right-hand sides are uncertain. The resulting optimization problems are NP-hard but amenable to copositive programming reformulations that give rise to tight conservative approximations. We further enhance these approximations through new piecewise decision rule schemes. Finally, we prove that our proposed approximations are tighter than the state-of-the-art schemes and demonstrate their superiority through numerical experiments.
In text/plain format

Archived Files and Locations

application/pdf  457.0 kB
file_pwvr3cv7incyrbsqoaezuwkgjq (repository) (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-05-01
Version   v3
Language   en ?
arXiv  1808.06231v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 806fe20f-adb5-4317-822d-5b60608ba816