Skip to main content
SpringerLink
Log in

Some insights into the solution algorithms for SLP problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider classes of stochastic linear programming problems which can be efficiently solved by deterministic algorithms. For two–stage recourse problems we identify two such classes. The first one consists of problems where the number of stochastically independent random variables is relatively low; the second class is the class of simple recourse problems. The proposed deterministic algorithm is successive discrete approximation. We also illustrate the impact of required accuracy on the efficiency of this algorithm. For jointly chance constrained problems with a random right–hand–side and multivariate normal distribution we demonstrate the increase in efficiency when lower accuracy is required, for a central cutting plane method. We support our argumentation and findings with computational results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ariyawansa, K.A. and A.J. Felt. (2001). “On a New Collection of Stochastic Linear Programming Test Problems.” WEB–Publication at http://www.optimization-online.org.

  • Birge, J.R. (1985). “Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs.” Oper. Res. 33, 989–1007.

    Google Scholar 

  • Birge, J.R., M.A.H. Dempster, H. Gassmann, E. Gunn, A.J. King, and S.W. Wallace. (1987). “A Standard Input Format for Multiperiod Stochastic Linear Programs.” Working Paper WP-87-118, IIASA, Laxenburg, Austria.

  • Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. Springer-Verlag.

  • Brooke, A., D. Kendrick, A. Meeraus, and R. Raman. (1998). GAMS. A user's guide. Technical report, GAMS Development Corporation, Washington DC, USA. It can be downloaded from http://www.gams.com/docs.

  • Consigli, G. and M.A.H. Dempster. (1998). “The CALM Stochastic Programming Model for Dynamic Asset–Liability Management.” In W.T. Ziemba and J.M. Mulvey (eds.), Worldwide asset and liability management, pp. 464–500. Cambridge University Press.

  • Dempster, M.A.H., N. Hicks Pedron, E. Medova, J.E. Scott, and A. Sembos. (2000). “Planning Logistic Operations in the Oil Industry.” Journal of Operational Research Society 51, 1271–1288.

    Article  Google Scholar 

  • Frauendorfer, K. and P. Kall. (1988). “A Solution Method for SLP Recourse Problems with Arbitrary Multivariate Distributions—the Independent Case.” Problems of Control and Information Theory 17, 177–205.

    Google Scholar 

  • Gassmann, H.I. (1989). “Optimal Harvest of a Forest in The Presence of Uncertainty.” Canadian Journal of Forest Research 19, 1267–1274.

    Google Scholar 

  • Gassmann, H.I. (1990). “MSLiP: A Computer Code for the Multistage Stochastic Linear Programming Problem.” Math. Prog. 47, 407–423.

    Article  Google Scholar 

  • Gondzio, J. (1995). “HOPDM (version 2.12) – A Fast LP Solver Based on a Primal–Dual Interior Point Method.” Eur. J. Oper. Res. 85, 221–225.

    Article  Google Scholar 

  • Higle, J.L. and S. Sen. (1991). “Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse.” Math. of Oper. Res. 16, 650–669.

    Google Scholar 

  • Higle, J.L. and S. Sen. (1996). “Stochastic Decomposition. A Statistical Method for Large Scale Stochastic Linear Programming.” Kluwer Academic Publ.

  • Kall, P. (1974). “Approximations to Stochastic Programs with Complete Fixed Recourse.” Numer. Math. 22, 333–339.

    Article  Google Scholar 

  • Kall, P. (1988). “Stochastic Programming with Recourse: Upper Bounds and Moment Problems – a Review.” In J. Guddat, B. Bank, H. Hollatz, P. Kall, D. Klatte, B. Kummer, K. Lommatzsch, K. Tammer, M. Vlach, and K. Zimmermann (eds.), Advances in Mathematical Optimization (Dedicated to Prof. Dr.hc. F. Nožička), pp. 86–103. Akademie-Verlag, Berlin.

  • Kall, P. (1998). “Bounds for and Approximations to Stochastic Linear Programs with Recourse –Tutorial.” In K. Marti and P. Kall (eds.), Stochastic Programming Methods and Technical Applications, pp. 1–21. Springer-Verlag.

  • Kall, P. and J. Mayer. (1992). “SLP-IOR: A Model Management System for Stochastic Linear Programming—System Design.” In A.J.M. Beulens and H.-J. Sebastian (eds.), Optimization-Based Computer-Aided Modelling and Design, pp. 139–157. Springer-Verlag.

  • Kall, P. and J. Mayer. (1992). “A Model Management System for Stochastic Linear Programming.” In P. Kall (ed.), System Modelling and Optimization, pp. 580–587. Springer-Verlag.

  • Kall, P. and J. Mayer. (1996) “SLP–IOR: An Interactive Model Management System for Stochastic Linear Programs.” Math. Prog. 75, 221–240.

    Article  Google Scholar 

  • Kall, P. and J. Mayer. (1998). “On Testing SLP Codes with SLP–IOR.” In F. Giannessi, T. Rapcsák, and S. Komløsi (eds.), New Trends in Mathematical Programming, pp. 115–135. Kluwer Academic Publ.

  • Kall, P. and J. Mayer. (2005). “Building and Solving Stochastic Linear Programming Models with SLP–IOR.” In S.W. Wallace and W.T. Ziemba (eds.), Applications of Stochastic Programming. MPS–SIAM–Series in Optimization, pp. 79–93.

  • Kall, P. and D. Stoyan. (1982), “Solving stochastic programming problems with recourse including error bounds.” Math. Operationsforsch. Statist., Ser. Opt. 13, 431–447.

  • Kall, P. and S.W. Wallace. (1994). Stochastic Programming. John Wiley & Sons.

  • Klein Haneveld, W. (1986). Duality in Stochastic Linear and Dynamic Programming. Springer-Verlag, Lecture Notes in Economics and Mathematical Systems 274.

  • Laporte, G., F.V. Louveaux, and H. Mercure. (1992). “The Vehicle Routing Problem with Stochastic Travel Times.” Transportation Science 26, 161–170.

    Google Scholar 

  • Linderoth, J. and S. Wright. (2002). “Decomposition Algorithms for Stochastic Programming on a Computational Grid.” Optimization Technical Report 02–07, Computer Sciences Department, University of Wisconsin–Madison.

  • Linderoth, J., A. Shapiro, and S. Wright. (2002). “The Empirical Behavior of Sampling Methods for Stochastic Programming.” Optimization Technical Report 02–01, Computer Sciences Department, University of Wisconsin–Madison.

  • Maros, I. and Cs. Mészáros. (1998). “The Role of the Augmented System in Interior Point Methods.” European Journal of Operational Research 107(3), 720–736.

    Article  Google Scholar 

  • Mayer, J. (1998). Stochastic Linear Programming Algorithms: A Comparison Based on a Model Management System. Gordon and Breach.

  • Mayer, J. (2000). “On the Numerical Solution of Jointly Chance Constrained Problems.” In S. Uryasev (ed.), Probabilistic Constrained Optimization: Methodology and Applications, pp. 220–233. Kluwer Academic Publ.

  • Cs. Mészáros. (1997). “The Augmented System Variants of IPM's in Two Stage Stochastic Programming.” Eur. J. Oper. Res. 101, 317–327.

    Article  Google Scholar 

  • MirHassani, S.A., C.A. Lucas, G. Mitra, E. Messina, and C.A. Poojari. (2000). “Computational Solution of Capacity Planning Models Under Uncertainty.” Parallel Computing 26, 511–538.

    Article  Google Scholar 

  • Mulvey, J.M. and A. Ruszczyński. (1995). “A New Scenario Decomposition Method for Large–Scale Stochastic Optimization.” Oper. Res. 43, 477–490.

    Article  Google Scholar 

  • Prékopa, A. (1995). Stochastic Programming. Kluwer Academic Publ.

  • Ruszczyński, A. (1986). “A Regularized Decomposition Method for Minimizing a Sum of Polyhedral Functions.” Math. Prog. 35, 309–333.

    Article  Google Scholar 

  • Sen, S., R.D. Doverspike, and S. Cosares. (1994). “Network Planning with Random Demand.” Telecommunications Systems 3, 11–30.

    Article  Google Scholar 

  • Shapiro, A. and T. Homem–de–Mello. (2000). “On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs.” SIAM J. Opt. 11, 70–86.

    Article  Google Scholar 

  • Szántai, T. (1987). “Calculation of the Multivariate Probability Distribution Function Values and their Gradient Vectors.” Working Paper WP-87-82, IIASA.

  • Valente, P., G. Mitra, and C.A. Poojari. (2005). “A Stochastic Programming Integrated Environment (SPInE).” In S.W. Wallace and W.T. Ziemba (eds.), Applications of stochastic programming, MPS–SIAM–Series in Optimization, pp. 115–136.

  • Van Slyke, R., and R.J-B. Wets. (1969). “L–Shaped Linear Program with Applications to Optimal Control and Stochastic Linear Programs.” SIAM J. Appl. Math. 17, 638–663.

    Article  Google Scholar 

  • Van der Vlerk, M.H. (2002). “On Multiple Simple Recourse Models.” SOM Research Report 02A06, University of Groningen.

Download references

Author information

Authors and Affiliations

  1. IOR University of Zurich, Zurich

    Peter Kall & János Mayer

Authors
  1. Peter Kall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. János Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to János Mayer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kall, P., Mayer, J. Some insights into the solution algorithms for SLP problems. Ann Oper Res 142, 147–164 (2006). https://doi.org/10.1007/s10479-006-6166-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-6166-y

Keywords

Search

Navigation