Solving stochastic programs with network recourse
- 1 September 1986
- Vol. 16 (3) , 295-317
- https://doi.org/10.1002/net.3230160306
Abstract
In this paper we provide computational procedures for solving stochastic programs with network recourse. Special attention is paid to the feasibility problem, and we show how to solve the recourse or second stage problem. This problem is how to solve a large number of networks where the only differences are the amounts supplied and demanded at the nodes. For this purpose we have developed the Schur complement for networks. Computational results are given. Finally we show how preprocessing based upon facet generation can simplify the rest of the procedures.Keywords
This publication has 17 references indexed in Scilit:
- On finding the K best cuts in a networkOperations Research Letters, 1984
- Solving stochastic programs with simple recourseStochastics, 1983
- An O(K·n4) algorithm for finding the k best cuts in a networkOperations Research Letters, 1982
- Matrix augmentation and partitioning in the updating of the basis inverseMathematical Programming, 1977
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic ProgramSIAM Review, 1974
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969
- Lifting projections of convex polyhedraPacific Journal of Mathematics, 1969
- Programming Under Uncertainty: The Solution SetSIAM Journal on Applied Mathematics, 1966
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- A theorem on flows in networksPacific Journal of Mathematics, 1957