Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information

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

Research output: Working paperDiscussion paperOther research output

725 Downloads (Pure)


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 old result of Ben-Tal and Hochman (1972) in which tight upper and lower bounds on the expectation of a convex function of a random variable are given. We use these bounds to derive
exact robust counterparts of expected feasibility of convex constraints and to construct new safe tractable approximations of chance constraints. Numerical examples show our method to be applicable to numerous applications of Robust Optimization, e.g., where implementation error or linear decision rules are present.
Also, we show that the methodology can be used for optimization the average-case performance of worst-case
optimal Robust Optimization solutions.
Original languageEnglish
Place of PublicationTilburg
PublisherCentER, Center for Economic Research
Number of pages36
Publication statusPublished - 5 Jun 2015

Publication series

NameCentER Discussion Paper


  • robust optimization
  • ambiguity
  • stochastic programming
  • chance constraints


Dive into the research topics of 'Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information'. Together they form a unique fingerprint.

Cite this