Solving multistage stochastic networks: An application of scenario aggregation
Ημερομηνία
1991Source
NetworksVolume
21Issue
6Pages
619-643Google Scholar check
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
The scenario aggregation algorithm is specialized for stochastic networks. The algorithm determines a solution that does not depend on hindsight and accounts for the uncertain environment depicted by a number of appropriately weighted scenarios. The solution procedure decomposes the stochastic program to its constituent scenario subproblems, thus preserving the network structure. Computational results are reported demonstrating the algorithm's convergence behavior. Acceleration schemes are discussed along with termination criteria. The algorithm's potential for execution on parallel multiprocessors is discussed. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company