Forest iteration method for stochastic transportation problem
From MaRDI portal
Publication:3703594
DOI10.1007/BFb0121081zbMath0581.90066OpenAlexW160766995MaRDI QIDQ3703594
Publication date: 1985
Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121081
treeconvexityiteration methodtransportation problemstochastic demandssimple recoursestochastic linear programmingforest iterationnetwork aspects
Numerical mathematical programming methods (65K05) Linear programming (90C05) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels ⋮ Solving multistage stochastic networks: An application of scenario aggregation ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Solving multistage stochastic network programs on massively prallel computers ⋮ Siting noxious facilities under uncertainty ⋮ A comparison of feasible direction methods for the stochastic transportation problem ⋮ A transportation planning problem with transfer costs in uncertain environment