Forest iteration method for stochastic transportation problem
From MaRDI portal
Publication:3703594
DOI10.1007/BFb0121081zbMath0581.90066MaRDI QIDQ3703594
Publication date: 1985
Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)
tree; convexity; iteration method; transportation problem; stochastic demands; simple recourse; stochastic linear programming; forest iteration; network aspects
65K05: Numerical mathematical programming methods
90C05: Linear programming
90C15: Stochastic programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Siting noxious facilities under uncertainty, A comparison of feasible direction methods for the stochastic transportation problem, Efficient decomposition and linearization methods for the stochastic transportation problem, Solving multistage stochastic network programs on massively prallel computers, Solving multistage stochastic networks: An application of scenario aggregation