On the Regularized Decomposition Method for Two Stage Stochastic Linear Problems.
A new approach to the regularized decomposition (RD) algorithm for two stage stochastic problems is presented. The RD method combines the ideas of the Dantzig-Wolfe decomposition principle and modern nonsmooth optimization methods. A new subproblem solution method using the primal simplex algorithm for linear programming is proposed and then tested on a number of large scale problems. The new approach makes it possible to use a more general problem formulation and thus allows considerably more freedom when creating the model. The computational results are highly encouraging.
Year of publication: |
1996-02
|
---|---|
Authors: | Ruszczynski, A. ; Swietanowski, A. |
Institutions: | International Institute for Applied Systems Analysis (IIASA) |
Saved in:
freely available
Saved in favorites
Similar items by person
-
A Modular Presolve Procedure for Large Scale Linear Programming.
Swietanowski, A., (1995)
-
A Penalty Based Simplex Method for Linear Programming.
Swietanowski, A., (1995)
-
Managing Water Quality under Uncertainty: Application of a New Stochastic Branch and Bound Method.
Lence, B.J., (1996)
- More ...