Optimization Online


Efficient methods for several classes of ambiguous stochastic programming problems under mean-MAD information

Krzysztof Postek(k.postek***at***tilburguniversity.edu)
Ward Romeijnders(w.romeijnders***at***rug.nl)
Dick den Hertog(d.denhertog***at***tilburguniversity.edu)
Maarten H. van der Vlerk(m.h.van.der.vlerk***at***rug.nl)

Abstract: We consider decision making problems under uncertainty, assuming that only partial distributional information is available - as is often the case in practice. In such problems, the goal is to determine here-and-now decisions, which optimally balance deterministic immediate costs and worst-case expected future costs. These problems are challenging, since the worst-case distribution needs to be determined while the underlying problem is already a difficult multistage recourse problem. Moreover, as found in many applications, the model may contain integer variables in some or all stages. Applying a well-known result by Ben-Tal and Hochman (1972), we are able to efficiently solve such problems without integer variables, assuming only readily available distributional information on means and mean absolute deviations. Moreover, we extend the result to the non-convex integer setting by means of convex approximations (see Romeijnders et al. (2015a)), proving corresponding performance bounds. Our approach is straightforward to implement using of-the-shelf software as illustrated in our numerical experiments.

Keywords: robust; ambiguous; integer; recourse; stochastic; multi-stage

Category 1: Robust Optimization

Category 2: Stochastic Programming

Citation: CentER Discussion Paper No. 2016-039

Download: [PDF]

Entry Submitted: 09/29/2016
Entry Accepted: 09/29/2016
Entry Last Modified: 09/29/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society