On a New Collection of Stochastic Linear Programming Test Problems

Published Online:https://doi.org/10.1287/ijoc.1030.0037

References

  • Ariyawansa K. A., Jiang P. L. Polynomial cutting plane algorithms for two-stage stochastic linear programs based on ellipsoids, volumetric centers and analytic centers. (1996) . Technical report, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA. http://www.wsu.eduGoogle Scholar
  • Averick B. M., Carter R. G., Moré J. J. The Minpack-2 test problem collection (preliminary version). (1991) . Technical report ANL/MCS-TM-150, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, ILGoogle Scholar
  • Benson S. J., McInnes L. C., Moré J. J. A case study in the performance and scalability of optimization algorithms. ACM Trans. Math. Software (2001) 27:361–376CrossrefGoogle Scholar
  • Birge J., Dempster M., Gassmann H., Gunn E., King A., Wallace S. A standard input format for multiperiod stochastic linear programs. COAL Newslett. (1987) 17):1–19 http://www.mgmt.dal.caGoogle Scholar
  • Birge J. R., Louveaux F. R.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
  • Cariño D. R., Kent T., Myers D. H., Stacy C., Sylvanus M., Turner A. L., Watanabe K., Ziemba W. T. The Russell-Yasuda Kasai model: An asset/liability model for a Japanese insurance company using multistage stochastic programming. Interfaces (1994) 24:29–49LinkGoogle Scholar
  • Cariño D. R., Myers D. H., Ziemba W. T. Concepts, technical issues, and uses of the Russell-Yasuda Kasai financial planning model. Oper. Res. (1998) 46:450–462LinkGoogle Scholar
  • Cariño D. R., Ziemba W. T. Formulation of the Russell-Yasuda Kasai financial planning model. Oper. Res. (1998) 46:433–449LinkGoogle Scholar
  • Fragnière E.Choix énergétiques et environnementaux pour le Canton de Genève (1995) . Ph.D. thesis, Thèse No. 412. Départment HEC, Université de Genève, Geneva, SwitzerlandGoogle Scholar
  • Frauendorfer K., Marohn C., Schürle M. SG-portfolio test problems for stochastic multistage linear programming (II). (1997) . Technical report, Institute of Operations Research, University of St. Gallen, St. Gallen, SwitzerlandGoogle Scholar
  • Gassmann H. I. Optimal harvest of a forest in the presence of uncertainty. Canadian J. Forest Res. (1989) 19:1267–1274See also http://www.netlib.orgCrossrefGoogle Scholar
  • Gassmann H. I. Utility routines for working with the SMPS input format for stochastic linear programs. (2001) . http://www.mgmt.dal.caGoogle Scholar
  • Gassmann H., Schweitzer E. A comprehenseve input format for stochastic linear programs. Ann. Oper. Res. (2001) 104:89–125CrossrefGoogle Scholar
  • Holmes D. A (PO)rtable (S)tochastic programming (T)est (S)et (POSTS). (1997) . http://users.iems.nwu.eduGoogle Scholar
  • Kall P., Wallace S.Stochastic Programming (1994) (Wiley, Chichester, U.K) Google Scholar
  • King A., Ermoliev Y., Wets R. J-B. Stochastic programming problems: Examples from literature. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, New York) 543–567Chap. 30CrossrefGoogle Scholar
  • Klaassen P., Shapiro J. F., Spitz D. E. Sequential decision models for selecting currency options. (1990) . Technical report IFSRC No. 133-90, International Financial Services Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Lin C., Moré J. J. Newton's method for large bound-constrained optimization problems. SIAM J. Optim. (1999) 9:1100–1127CrossrefGoogle Scholar
  • Louveaux F. V., Smeers Y., Ermoliev Y., Wets R. J-B. Optimal investments for electricity generation: A stochastic model and a test-problem. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, New York) 445–453Chap. 24CrossrefGoogle Scholar
  • Midler J. L., Wollmer R. D. Stochastic programming models for scheduling airlift operations. Naval Res. Logist. Quart. (1969) 16:315–330CrossrefGoogle Scholar
  • Moré J. J. A collection of nonlinear model problems. Computational Solution of Nonlinear Systems of Equations (1990) 26(American Mathematical Society, Providence, RI) 723–762Google Scholar
  • Moré J. J., Toraldo G. On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. (1991) 1:93–113CrossrefGoogle Scholar
  • Mulvey J. M. Re: Stochastic LP examples. (1999) . Personal e-mail from authorGoogle Scholar
  • Mulvey J. M., Ruszczyński A. A new scenario decomposition method for large-scale stochastic optimization. Oper. Res. (1995) 43:477–490LinkGoogle Scholar
  • Mulvey J. M., Vladimirou H. Applying the progressive hedging algorithm to stochastic generalized networks. Ann. Oper. Res. (1991) 31:399–424CrossrefGoogle Scholar
  • Prékopa A.Stochastic Programming (1995) 324(Kluwer Academic Publishers Group, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Sen S., Doverspike R. D., Cosares S. Network planning with random demand. Telecomm. Systems (1994) 3:11–30CrossrefGoogle Scholar
  • Subrahmanyam S., Pekny J. F., Reklaitis G. V. Design of batch chemical plants under market uncertainty. Indust. Engrg. Chemical Res. (1994) 33:2688–2701CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.