On a new collection of stochastic linear programming test problems

INFORMS Journal on Computing

Volumn 16, Issue 3, 2004, Pages 291-299

  Ariyawansa, K A ^a   Felt, Andrew J ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WISCONSIN STEVENS POINT   (United States)

Author keywords

Analysis of algorithms; Probability; Programming; Stochastic; Stochastic model applications

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY; SET THEORY; STOCHASTIC PROGRAMMING; WORLD WIDE WEB;

ANALYSIS OF ALGORITHMS; LINEAR PROGRAMMING TEST PROBLEMS; STOCHASTIC MODEL APPLICATIONS;

RANDOM PROCESSES;

EID: 4544226577     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0037     Document Type: Article

References (28)

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