Wiley Encyclopedia of Operations Research and Management Science 2011
DOI: 10.1002/9780470400531.eorms0232
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Mixed‐Integer Programming Algorithms: Beyond Benders' Decomposition

Abstract: This article is dedicated to a new generation of decomposition algorithms that are designed to solve two‐stage stochastic mixed‐integer programming problems. This class of methods, which constitute extensions of Benders' decomposition, is designed to allow integer variables within subproblems, and such situations occur naturally within stochastic mixed‐integer programming problems. In addition to providing a unified treatment of the algorithms, we also summarize some computational results.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 41 publications
0
12
0
Order By: Relevance
“…Interesting reviews on approximation of multi-stage stochastic optimization problems with mixed-integer variables can be found in [45], [46], [47]. Two-stage optimization problems with continuous and integer variables in the second stage were considered for the first time in [48] where an approach to compute modified Benders cut is proposed under the assumption that the first stage only contains binary variables.…”
Section: A Decomposition Techniquesmentioning
confidence: 99%
“…Interesting reviews on approximation of multi-stage stochastic optimization problems with mixed-integer variables can be found in [45], [46], [47]. Two-stage optimization problems with continuous and integer variables in the second stage were considered for the first time in [48] where an approach to compute modified Benders cut is proposed under the assumption that the first stage only contains binary variables.…”
Section: A Decomposition Techniquesmentioning
confidence: 99%
“…In any event, we have chosen to summarize these two methods because of their ability to manage general integer decisions in both stages. For prior research on more special cases, we refer to [53].…”
Section: Decomposition For Two-stage Stochastic Mixed-integer Programsmentioning
confidence: 99%
“…We refer the reader to [66] and [8] for an introduction to these topics. Furthermore, the reader should note that we have omitted some SMIP ideas that have appeared in earlier surveys on this subject ( [53], [52]).…”
Section: Introductionmentioning
confidence: 99%
“…Where stochastic optimization [123] focuses on optimizing the expected objective value, robust optimization aims to find a solution that optimizes the worst case considered (to be specified below). In this contribution, we promote Assuming w.l.o.g.…”
Section: Robust Optimization and Network Designmentioning
confidence: 99%