### Abstract

Original language | English |
---|---|

Pages (from-to) | 17-33 |

Journal | Surveys in Operations Research and Management Science |

Volume | 19 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2014 |

### Fingerprint

### Cite this

*Surveys in Operations Research and Management Science*,

*19*(1), 17-33. https://doi.org/10.1016/j.sorms.2014.04.001

}

*Surveys in Operations Research and Management Science*, vol. 19, no. 1, pp. 17-33. https://doi.org/10.1016/j.sorms.2014.04.001

**Approximation in two-stage stochastic integer programming.** / Romeijnders, W.; Stougie, L.; van der Vlerk, M.H.

Research output: Contribution to Journal › Article › Academic › peer-review

TY - JOUR

T1 - Approximation in two-stage stochastic integer programming

AU - Romeijnders, W.

AU - Stougie, L.

AU - van der Vlerk, M.H.

PY - 2014

Y1 - 2014

N2 - Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value. However, efficiency in the complexity theoretical sense is usually not taken into account. Quality statements mostly remain restricted to convergence to an optimal solution without accompanying implications on the running time of the algorithms for attaining more and more accurate solutions.However, over the last thirty years also some studies on performance analysis of approximation algorithms for stochastic programming have appeared. In this direction we find both probabilistic analysis and worst-case analysis.Recently the complexity of stochastic programming problems has been addressed, indeed confirming that these problems are harder than most deterministic combinatorial optimization problems. Polynomial-time approximation algorithms and their performance guarantees for stochastic linear and integer programming problems have received increasing research attention only very recently.Approximation in the traditional stochastic programming sense will not be discussed in this chapter. The reader interested in this issue is referred to surveys on stochastic programming, like the Handbook on Stochastic Programming by Ruszczyński and Shapiro (2003) or the textbooks by Birge and Louveaux (1997), Kall and Wallace (1994), Prékopa (1995), and Shapiro etal. (2009). We concentrate on the studies of approximation algorithms in relation to computational complexity theory.With this survey we intend to give a flavor of the type of results existing in the literature on approximation algorithms in two-stage stochastic integer programming rather than a complete overview of the literature on the subject. We do so by exhibiting a representative selection of results, which we present in full detail. While presenting them we do not refer to the literature; these references, together with pointers to other relevant work in this field of research, are given in an extensive notes section at the end of the survey. © 2014 Elsevier Ltd.

AB - Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value. However, efficiency in the complexity theoretical sense is usually not taken into account. Quality statements mostly remain restricted to convergence to an optimal solution without accompanying implications on the running time of the algorithms for attaining more and more accurate solutions.However, over the last thirty years also some studies on performance analysis of approximation algorithms for stochastic programming have appeared. In this direction we find both probabilistic analysis and worst-case analysis.Recently the complexity of stochastic programming problems has been addressed, indeed confirming that these problems are harder than most deterministic combinatorial optimization problems. Polynomial-time approximation algorithms and their performance guarantees for stochastic linear and integer programming problems have received increasing research attention only very recently.Approximation in the traditional stochastic programming sense will not be discussed in this chapter. The reader interested in this issue is referred to surveys on stochastic programming, like the Handbook on Stochastic Programming by Ruszczyński and Shapiro (2003) or the textbooks by Birge and Louveaux (1997), Kall and Wallace (1994), Prékopa (1995), and Shapiro etal. (2009). We concentrate on the studies of approximation algorithms in relation to computational complexity theory.With this survey we intend to give a flavor of the type of results existing in the literature on approximation algorithms in two-stage stochastic integer programming rather than a complete overview of the literature on the subject. We do so by exhibiting a representative selection of results, which we present in full detail. While presenting them we do not refer to the literature; these references, together with pointers to other relevant work in this field of research, are given in an extensive notes section at the end of the survey. © 2014 Elsevier Ltd.

U2 - 10.1016/j.sorms.2014.04.001

DO - 10.1016/j.sorms.2014.04.001

M3 - Article

VL - 19

SP - 17

EP - 33

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 1876-7354

IS - 1

ER -