1979
DOI: 10.1007/bf01601939
|View full text |Cite
|
Sign up to set email alerts
|

Computational methods for solving two-stage stochastic linear programming problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
25
0

Year Published

1980
1980
2011
2011

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 71 publications
(25 citation statements)
references
References 5 publications
0
25
0
Order By: Relevance
“…Let us assume that some of the entries of the technology matrix A and the righthand side b in the linear model (1) are uncertain and that this uncertainty is crucial for the decision making. One of possible modelling approaches to such a situation (see, e.g., Kall et al, 1979) is to assume that A and b are random and may attain one of finite many realizations with some known probabilities:…”
Section: A= -Kmentioning
confidence: 99%
“…Let us assume that some of the entries of the technology matrix A and the righthand side b in the linear model (1) are uncertain and that this uncertainty is crucial for the decision making. One of possible modelling approaches to such a situation (see, e.g., Kall et al, 1979) is to assume that A and b are random and may attain one of finite many realizations with some known probabilities:…”
Section: A= -Kmentioning
confidence: 99%
“…Conversely, reducing the allocation targets results in lower risk of penalties under water scarcity and a higher risk of water-resources wastage. Such problems can often be formulated as two-stage stochastic programming (TSP) models (Anderson, 1968;Kall, 1979;Louveaux, 1980;Birge, 1985;Birge & Louveaux, 1988;Gassmann, 1990;Eiger & Shamir, 1991;Lustig et al, 1991;Sen, 1993;Ediris-inghe & Ziemba, 1994;Ruszczynski & Swietanowski, 1997;Beraldi et al, 2000;Dai et al, 2000;Darby-Dowman et al, 2000;Yoshitomi et al, 2000;Zhao, 2001). In TSP, a decision is made at the first stage before random variables are known and then, after the random events have happened and their values are known, a second decision should be made in order to minimize penalties that may appear due to any infeasibility (Loucks et al, 1981;Birge et al, 1988;Ruszczynski, 1993).…”
Section: Introductionmentioning
confidence: 99%
“…Exact methods include simplex-based algorithms that exploit special structure of bases [17], decomposition or L-shaped schemes [2,31], interior point methods [24], and the Progressive Hedging algorithm [29]. A classic approximation scheme involves calculating deterministic lower and upper bounds via the inequalities of Jensen and Edmundson-Madansky, respectively; see [3,4,11,21] for extensions and alternatives.…”
mentioning
confidence: 99%
“…Theorem 7 Assume (7), (11), (16) If, in addition, (IS), (17), (18) hold and < e' < c then P{T(e) < oo} = 1.…”
mentioning
confidence: 99%
See 1 more Smart Citation