Abstract
Application of the regularized decomposition method to large scale structured linear programming problems arising in stochastic programming is discussed. The method uses a quadratic regularizing term to stabilize the master but is still finitely convergent. Its practical performance is illustrated with numerical results for large real world problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birge J.R. and F.V. Louveaux, âA multicut algorithm for two-stage stochastic linear programs,â European Journal of Operations Research 34(1988) 384â392.
Birge J.R. and R.J.-B. Wets, âDesigning approximation schemes for stochastic approximation problems, in particular for stochastic programs with recourse,â in: Stochastic Programming 1984, A. Prekopa and R.J.-B. Wets (eds.), Mathematical Programming Study 27(1986) 54â102.
Dantzig G. and A. Madansky, âOn the solution of two-stage linear programs under uncertainty,â in Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, University of California Press, Berkeley 1961, pp. 165â176.
Dantzig G. and P. Wolfe, âDecomposition principle for linear programs,â Operations Research 8(1960) 101â111.
Ermoliev Yu. and R.J.-B. Wets (eds.), Numerical Techniques for Stochastic Optimization, Springer Verlag, Berlin 1988.
Kall P., A. Ruszczyñski and K. Frauendorfer, âApproximation techniques in stochastic programming,â in: Numerical Techniques for Stochastic Optimization (Yu. Ermoliev and R. Wets, eds.), Springer-Verlag, Berlin 1988, pp. 33â64.
Kiwiel K.C., Methods of Descent for Nondifferentiable Optimization, Springer-Verlag, Berlin, 1985.
Marsten R., âThe design of the XMP linear programming library,â ACM Transactions of Mathematical Software 7(1981) 481â497.
Mulvey J.M. and A. RuszczyĆski, âA new scenario decomposition method for large-scale stochastic optimization,â technical report SOR-91â19, Dea-partment of Civil Engineering and Operations Research, Princeton University, Princeton 1991 (to appear in Operations Research).
RuszczyĆski A., âA regularized decomposition method for minimizing a sum of polyhedral functions,â Mathematical Programming 35(1986) 309â333.
RuszczyĆski A., âAn augmented Lagrangian decomposition method for block diagonal linear programming problems,â Operations Research Letters 8(1989) 287â294.
RuszczyĆski A., âParallel decomposition of multistage stochastic programming problems,â Mathematical Programming 58(1993) 201â228.
RuszczyĆski A., âRegularized decomposition of stochastic programs: algorithmic techniques and numerical results,â working paper WP-93â21, International Institute for Applied Systems Analysis, Laxenburg 1993.
Sen S., R.D. Doverspike and S. Cosares, âNetwork planning with random demand,â technical report, Department of Systems and Industrial Engineering, University of Arizona, Tucson, 1992.
Topkis J.M., âA cutting plane algorithm with linear and geometric rates of convergence,â Journal of Optimization Theory and Applications 36(1982) 1â22.
Van Slyke R. and R.J.-B. Wets, âL-shaped linear programs with applications to optimal control and stochastic programming,â SIAM Journal on Applied Mathematics 17(1969) 638â663.
Wets R.J.-B., âStochastic programs with fixed recourse: the equivalent deterministic program,â SIAM Review 16(1974) 309â339.
Wets R.J.-B., âLarge scale linear programming techniques,â in: Numerical Techniques for Stochastic Optimization (Yu. Ermoliev and R. Wets, eds.), Springer-Verlag, Berlin 1988, pp. 65â94.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
RuszczyĆski, A. (1995). On the Regularized Decomposition Method for Stochastic Programming Problems. In: Marti, K., Kall, P. (eds) Stochastic Programming. Lecture Notes in Economics and Mathematical Systems, vol 423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-88272-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-88272-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58996-9
Online ISBN: 978-3-642-88272-2
eBook Packages: Springer Book Archive