Robust optimization with ambiguous stochastic constraints under mean and dispersion information

Krzysztof Postek, A. Ben-Tal, Dick den Hertog, Bertrand Melenberg

Research output: Contribution to journalArticleScientificpeer-review

16 Citations (Scopus)

Abstract

In this paper we consider ambiguous stochastic constraints under partial information consisting of means and dispersion measures of the underlying random parameters. Whereas the past literature used the variance as the dispersion measure, here we use the mean absolute deviation from the mean (MAD). This makes it possible to use the 1972 result of Ben-Tal and Hochman (BH) in which tight upper and lower bounds on the expectation of a convex function of a random variable are given. First, we use these results to treat ambiguous expected feasibility constraints to obtain exact reformulations for both functions that are convex and concave in the components of the random variable. This approach requires, however, the independence of the random variables and, moreover, may lead to an exponential number of terms in the resulting robust counterparts. We then show how upper bounds can be constructed that alleviate the independence restriction, and require only a linear number of terms, by exploiting models in which random variables are linearly aggregated. Moreover, using the BH bounds we derive three new safe tractable approximations of chance constraints of increasing computational complexity and quality. In a numerical study, we demonstrate the efficiency of our methods in solving stochastic optimization problems under mean-MAD ambiguity.
Original languageEnglish
Pages (from-to)814-833
JournalOperations Research
Volume66
Issue number3
DOIs
Publication statusPublished - May 2018

Keywords

  • robust optimization
  • ambiguity
  • stochastic programming
  • chance constraints

Fingerprint Dive into the research topics of 'Robust optimization with ambiguous stochastic constraints under mean and dispersion information'. Together they form a unique fingerprint.

Cite this