A disaggregation algorithm for the optimization of stochastic planning models

Computers and Chemical Engineering

Volumn 21, Issue 7, 1997, Pages 751-774

  Clay, R L ^a,b   Grossmann, I E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Aggregate models; Linear programming; Production planning; Stochastic programming; Successive disaggregation algorithm

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

DISAGGREGATION ALGORITHM; STOCHASTIC PLANNING MODELS;

PRODUCTION CONTROL;

EID: 0030686008     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(96)00286-4     Document Type: Article

References (42)

1. Beale, E. M., Forrest, J. J. H. and Taylor, C. J. (1980) Multi-time-period stochastic programming. In M. A. H. Dempster (ed.), Stochastic Programming, pp. 387-402. Academic Press, New York.
2. Benders, J. F. (1962) Partitioning procedures for solving mixed-variable programming problems. Numerische Mathematic 4, 238-252.
3. Bienstock, D. and Shapiro, J. F. (1985) Stochastic programming models for strategic planning: an application to electric utilities. MIT Technical Report OR 128-84, revised.
4. Birge, J. R. (1982) The value of the stochastic solution in stochastic linear programs with fixed recourse. Mathematical Programming 24, 314-325.
5. Birge, J. R. (1982b) Decomposition and partitioning methods for multi-stage stochastic linear programs. Technical Report No. 82-6, Dept. of Industrial and Operations Engineering, University of Michigan, Ann Arbor.
6. Birge, J. R. (1985) Aggregation bounds in stochastic linear programming. Mathematical Programming 31, 25-41.
7. Birge, J. R. (1992) Stochastic programming: optimizing the uncertain. Technical Report No. 92-24, Dept. of Industrial and Operations Engineering, University of Michigan, Ann Arbor.
8. Birge, J. R. (1993) Models and model value in stochastic programming. Technical Report No. 93-2, Dept. of Industrial and Operations Engineering, University of Michigan, Ann Arbor.
9. Birge, J. R. and Wallace, S. W. (1986) Refining bounds for stochastic linear programs with linearly transformed independent random variables. Operations Research Letters 5, 2.
10. Birge, J. R. and Wallace, S. W. (1987) A separable piecewise linear upper bound for stochastic linear programs. Technical Report NLS55-87-001, Naval Postgraduate School.
11. Birge, J. R. and Wets, R. J.-B. (1985) Generating upper bounds on the expected value of a convex function with applications to stochastic programming. Technical Report 85-14, Dept. of Industrial and Operations Engineering, University of Michigan, Ann Arbor.
12. Dantzig, G. B. (1955) Linear programming under uncertainty. Management Science 1, 3 and 4 197-206.
13. Dantzig, G. B. (1963) Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
14. Dantzig, G. B. (1988) Planning under certainty using parallel computing. Annals of Operations Research (Switzerland) 14, 1-4 (A01) 1-16.
15. Dantzig, G. B. and Glynn, P. W. (1989) Parallel processors for planning under uncertainty. Technical Report SOL 88-8R, Department of Operations Research, Stanford University, Stanford, CA.
16. Dantzig, G. B. and Infanger, G. (1993) Multi-stage stochastic linear programs for portfolio optimization. Annals of Operations Research (Switzerland) 45, 1-4, 59-76.
17. Dempster, M. A. H. (1965) On stochastic programming, Ph.D. Thesis, Dept. of Mathematics, Carnegie Mellon University.
18. Dempster, M. A. H. (1980) Introduction to Stochastic Programming. In M. A. H. Dempster (ed.), Stochastic Programming, pp. 3-62. Academic Press, New York.
19. Edgar, T. F. and Himmelblau, D. M. (1988) Optimization of Chemical Processes. McGraw-Hill, New York.
20. Ermoliev, Y. and Wets, R. J.-B. (1988) Numerical Techniques for Stochastic Optimization. Springer, New York.
21. Gassmann, H. I. (1990) MSLiP: a computer code for the multistage stochastic linear programming problem. Mathematical Programming 47, 407-423.
22. Geoffrion, A. M. (1972) Generalized Benders decomposition. JOTA 10, 237-260.
23. Grossmann, I. E. and Floudas, C. A. (1987) Active constraint strategy for flexibility analysis in chemical processes. Computers and Chemical Engineering 11, 6, 675-693.
24. Grossmann, I. E. and Straub, D. A. (1991) Recent developments in the evaluation and optimization of flexible chemical processes. In L. Puigjaner and A. Espuna (eds), Proceedings Computer-oriented Process Engineering, pp. 49-59. Elsevier, Amsterdam.
25. Ierapetritou, M. G. and Pistikopoulos, E. N. (1994) Simultaneous incorporation of flexibility and economic risk in operational planning under uncertainty. Computers and Chemical Engineering 18, 3, 163-189.
26. Infanger, G. (1991) Monte Carlo (Importance) sampling within a Benders decomposition algorithm for stochastic linear programs, extended version: including results of large-scale problems. Technical Report SOL 91-6, Dept. of Operations Research, Stanford University, Stanford, CA.
27. Kall, P. and Wallace, S. W. (1994) Stochastic Programming. Wiley, New York.
28. Karreman, H. (1963) A stochastic model for programming the supply of a strategic material. In R. L. Graves and P. Wolfe (eds), Mathematical Programming, pp. 223-238. McGraw-Hill, New York.
29. Louveaux, F. V. (1986) Multistage stochastic programs with block-separable recourse. Mathematical Programming Study 28, 48-62.
30. Madansky, A. (1960) Inequalities for stochastic linear programming problems. Management Science 6, 197-204.
31. Madansky, A. (1963) Linear programming under uncertainty. In R. L. Graves and P. Wolfe (eds), Mathematical Programming, pp. 103-110. McGraw-Hill, New York.
32. Rogers, D. F., Plante, R. D., Wong, R. T. and Evans, J. R. (1991) Aggregation and disaggregation techniques and methodology in optimization. Operations Research 39, 4 553-582.
33. Rosen, J. B. (1963) Convex partition programming. In R.L. Graves and P. Wolfe (eds), Mathematical Programming, pp. 159-176. McGraw-Hill, New York.
34. Sahinidis, N. V. and Grossmann, I. E. (1992) Reformulation of the multiperiod MILP model for capacity expansion of chemical processes. Operations Research 40, 1, S127-S144.
35. Swaney, R.E. and Grossmann, I.E. (1985) An index of operational flexibility in chemical process design: I. Formulation and theory. AIChE J. 31, 4, 621-630.
36. Van Slyke, R. and Wets, R. J.-B. (1969) L-shaped linear programs with application to optimal control and stochastic optimization. SIAM J. Appl. Math. 17, 638-663.
37. Wets, R. J.-B. (1966) Programming under uncertainty: the equivalent convex program. SIAM J. Appl. Math. 14, 89-105.
38. Wets, R. J.-B. (1974) Stochastic programs with fixed recourse: the equivalent deterministic program. SIAM Review 16, 3, 309-339.
39. Wets, R. J.-B. (1983) Stochastic programming: solution techniques and approximation schemes. In A. Bachem et al. (eds), Mathematical Programming: The State of the Art, pp. 566-603. Springer, Berlin.
40. Wets, R. J.-B. (1989) Stochastic programming. In G. L. Nemhauser et al. (eds), Handbooks in Operations Research and Management Science, vol. 1, pp. 573-629. North-Holland, Amsterdam.
41. Zipkin, P.H. (1980) Bounds on the effect of aggregating variables in linear programs. Operations Research 28, 2.
42. Zipkin, P.H. (1980) Bounds for row-aggregation in linear programs. Operations Research 28, 4.