The transportation problem with stochastic demands is a special version of the stochastic linear programming problem with simple recourse. It has many economic applications. In this paper we present a new algorithm to solve this problem. Instead of discretizing the distribution functions of the stochastic demands, the author explores the problem's network aspects and proposes a forest iteration method to solve it. This method iterates from one base forest triple to another base forest triple with strictly decreasing objective values. Therefore, it converges in finitely many steps. The nonlinear work in each step consists of solving a small number of one-dimensional monotone equations.
|Number of pages||22|
|Journal||Mathematical Programming Study|
|Publication status||Published - 1 Oct 1985|
ASJC Scopus subject areas