Solving stochastic programs with network recourse
β Scribed by Stein W. Wallace
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 997 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two-stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the firststage decision variables. T
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal, Exponential and Erlang. For the first two instances we extend the equivalent deter