Abstract

In this note we show that multiple solutions exist for the production-inventory example in the seminal paper on adjustable robust optimization in Ben-Tal et al. (Math Program 99(2):351---376, 2004). All these optimal robust solutions have the same worst-case objective value, but the mean objective values differ up to 21.9 % and for individual realizations this difference can be up to 59.4 %. We show via additional experiments that these differences in performance become negligible when using a folding horizon approach. The aim of this paper is to convince users of adjustable robust optimization to check for existence of multiple solutions. Using the production-inventory example and an illustrative toy example we deduce three important implications of the existence of multiple optimal robust solutions. First, if one neglects this existence of multiple solutions, then one can wrongly conclude that the adjustable robust solution does not outperform the nonadjustable robust solution. Second, even when it is a priori known that the adjustable and nonadjustable robust solutions are equivalent on worst-case objective value, they might still differ on the mean objective value. Third, even if it is known that affine decision rules yield (near) optimal performance in the adjustable robust optimization setting, then still nonlinear decision rules can yield much better mean objective values.

Highlights

  • In [2] the Robust Optimization (RO) methodology is extended to multi-stage problems

  • The proposed Adjustable Robust Optimization (ARO) techniques appeared to be very effective to solve uncertain multi-stage optimization problems. This first paper on ARO has been cited more than 500 times already, and the ARO methodology has been applied to a wide variety of problems

  • In this note we show that the ARO model of the production-inventory problem in [2], which is the seminal work on ARO, has multiple optimal robust solutions

Read more

Summary

Introduction

In [2] the Robust Optimization (RO) methodology is extended to multi-stage problems. The proposed Adjustable Robust Optimization (ARO) techniques appeared to be very effective to solve uncertain multi-stage optimization problems. For the cases considered in [2], we show that among the optimal robust solutions, the difference in mean objective value can be as much as 21.9 % and for individual realizations the difference can be up to 59.4 % This underlines the importance of the message in [8] that ARO problems may have multiple optimal robust solutions. In a folding horizon approach the model is re-optimized in each period using the available information at that point of time and only the decisions for the current time are implemented Using this approach we find that there are still multiple optimal robust solutions, but the differences in mean costs diminish. Researchers who use the same production-inventory example as in the seminal work [2] to test new ARO methods, should be aware of the fact that this problem has many optimal robust solutions with big differences in mean costs

Multiple adjustable robust solutions
Folding horizon versus non-folding horizon
Toy examples
Implications for robust optimization
Findings
Gurobi Optimization Inc
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call