Article ID: | iaor20134961 |
Volume: | 25 |
Issue: | 4 |
Start Page Number: | 666 |
End Page Number: | 681 |
Publication Date: | Sep 2013 |
Journal: | INFORMS Journal on Computing |
Authors: | den Hertog Dick, Yankolu hsan |
Keywords: | approximation, robust optimization, Chance-constrained programming |
This paper proposes a new way to construct uncertainty sets for robust optimization. Our approach uses the available historical data for the uncertain parameters and is based on goodness‐of‐fit statistics. It guarantees that the probability the uncertain constraint holds is at least the prescribed value. Compared to existing safe approximation methods for chance constraints, our approach directly uses the historical data information and leads to tighter uncertainty sets and therefore to better objective values. This improvement is significant, especially when the number of uncertain parameters is low. Other advantages of our approach are that it can handle joint chance constraints easily, it can deal with uncertain parameters that are dependent, and it can be extended to nonlinear inequalities. Several numerical examples illustrate the validity of our approach.