Retrospective on optimization

Computers and Chemical Engineering

Volumn 28, Issue 8, 2004, Pages 1169-1192

  Biegler, Lorenz T ^a   Grossmann, Ignacio E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Dynamic optimization; Linear programming; Mixed integer nonlinear programming; Nonlinear programming; Process optimization; Stochastic optimization

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; PROCESS ENGINEERING;

OPTIMIZATION PROBLEMS; PROCESS SYSTEM ENGINEERING;

CHEMICAL ENGINEERING;

STOCHASTIC METHOD;

COMPUTER SYSTEM; GENETIC ALGORITHM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; NONLINEAR SYSTEM; PROCESS DESIGN; PROCESS OPTIMIZATION; REVIEW; SEQUENTIAL ANALYSIS; SYSTEM ANALYSIS;

EID: 2342632555     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2003.11.003     Document Type: Article

References (142)

1. Albuquerque J., Gopal V., Staus G., Biegler L.T., Ydstie B.E. Interior point SQP strategies for large-scale structured process optimization problems. Computers and Chemical Engineering. 23:1997;283
2. Allgor R., Barton P. Mixed-integer dynamic optimization. I. Problem formulation. Computers and Chemical Engineering. 23(4-5):1999;457
3. Avraam M., Shah N., Pantelides C. Modeling and optimization of general hybrid systems in continuous time domain. Computers and Chemical Engineering. 22:1998;S221
4. Bader G., Ascher U.M. A new basis implementation for mixed order boundary value ODE solver. SIAM Journal of Science and Computers. 8:1987;483-500
5. Balas E., Ceria S., Cornuejols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming. 58:1993;295-324
6. Banga, J. R., & W. D. Seider (1996). Global optimization of chemical processes using stochastic algorithms. In C. Floudas & P. Pardalos (Eds.), State of the art in global optimization (p. 563). Dordrecht: Kluwer Academic Publishers.
7. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H. Branch-and-price: Column generation for solving huge integer programs. Operations Research. 46:1998;316-329
8. Barton P., Park T. Analysis and control of combined discrete/continuous systems: Progress and challenges in the chemical process industries. AIChE Symposium Series. 93(316):1997;102
9. Bausa, J., & Tsatsaronis, G. (2001). Discretization methods for direct collocation of optimal control problems. Computers and Chemical Engineering, in press.
10. Bazaraa, M. S., & Sherali, H. D., & Shetty, C. M. (1994), Nonlinear programming. New York: Wiley.
11. Beale, E. M., Forrest, J. J. H., & Taylor, C. J. (1980). Multi-time-period stochastic programming. In M. A. H. Dempster (Ed.), Stochastic programming (pp. 387-402). New York: Academic Press.
12. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerical Mathematics. 4:1962;238-252
13. Benders J.F. Partitioning procedures for solving mixed-variable programming problems. Numerische Mathematic. 4:1962;238-252
14. Betts, J. T. (2001). Practical methods for optimal control using nonlinear programming. In Advances in design and control (Vol. 3). Philadelphia, USA: SIAM.
15. Betts, J. T. (2001). Practical methods for optimal control using nonlinear programming. Advances in design and control (Vol. 3), Philadelphia, USA: SIAM.
16. Bhatia T., Biegler L.T. Dynamic optimization in the design and scheduling of multiproduct batch plants. I&EC Research. 35(7):1996;2234
17. Biegler L.T., Cervantes A.M., Wächter A. Advances in simultaneous strategies for dynamic process optimization. Chemical Engineering Science. 57(4):2002;575-593
18. Biehn, N. (2001). Ph.D. Thesis, Department of Mathematics, North Carolina State University.
19. Binder, T., Blank, L., Bock, H. G., Bulitsch, R., Dahmen, W., Diehl, M., Kronseder, T., Marquardt, W., Schloeder J., & von Stryk, O. (2001). Introduction to model based optimization of chemical processes on moving horizons. In Groetschel, M., Krumke, S. O., & Rambau, J. (Eds.), Online optimization of large scale systems. Berlin: Springer.
20. Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2002). MIP: Theory and practice - closing the gap (http://www.ilog.com/ products/optimization/tech/research/mip.pdf).
21. Bloss K.F., Biegler L.T., Schiesser W.E. Dynamic process optimization through adjoint formulations and constraint aggregation. Industrial Engineering in Chemical Research. 38:1999;421-432
22. Bock, H. G., & Plitt, K. J. (1984). A multiple shooting algorithm for direct solution of optimal control problems. In Proceedings of the 9th IFAC world congress, Budapest.
23. Bojko B., Luus R. Use of random admissible values for control in iterative dynamic programming. Industrial Engineering in Chemical Research. 31:1992;1308-1314
24. Booker, A. J., Dennis Jr., J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1998). A rigorous framework for optimization of expensive functions by surrogates. CRPC Technical Report 98739, Rice University.
25. Borchers B., Mitchell J.E. An improved branch and bound algorithm for mixed-integer nonlinear programming. Computers and Operations Research. 21:1994;359-367
26. Brooke, A., Kendrick, D., Meeraus, A., & Raman, R. (1998). GAMS - A user's guide (www.gams.com).
27. Bryson, A. E., & Ho, Y. C. (1969). Applied optimal control: Optimization, estimation, and control. Waltham, MA: Ginn and Company.
28. Byrd, R. H., Hribar, M. E., & Nocedal, J. (1997). An interior point algorithm for large scale nonlinear programming. Optimization Technology Center, Northwestern University.
29. Cervantes A., Biegler L.T. Large-scale date optimization using simultaneous nonlinear programming formulations. AIChE Journal. 44:1998;1038
30. Cervantes A.M., Tonelli S., Brandolin A., Bandoni J.A., Biegler L.T. Large-scale dynamic optimization for grade transitions in a low density polyethylene plant. Computers and Chemical Engineering. 26:2002;227
31. Conn A.R., Scheinberg K., Toint P. Recent progress in unconstrained nonlinear optimization without derivatives. Mathematical Programming, Series B. 79(3):1997;397
32. Conn, A. R., Gould, N., & Toint, P. (2000). Trust region methods. Philadelphia, USA: SIAM.
33. Cuthrell J.E., Biegler L.T. Simultaneous optimization and solution methods for batch reactor control profiles. Computers and Chemical Engineering. 13(1-2):1989;49
34. Cuthrell J.E., Biegler L.T. On the optimization of differential-algebraic process systems. AIChE Journal. 33:1987;1257-1270
35. Dadebo S.A., McAuley K.B. Dynamic optimization of constrained chemical engineering problems using dynamic programming. Computers and Chemical Engineering. 19(5):1995;513-525
36. Dakin R.J. A tree search algorithm for mixed-integer programming problems. Computer Journal. 8:1965;250-255
37. Dantzig, G. B. (1963). Linear programming and extensions. Princeton, NJ: Princeton University Press.
38. Das H., Cummings P., LeVan M. Scheduling of serial multiproduct batch processes via simulated annealing. Computers and Chemical Engineering. 14(12):1990;1351-1362
39. Dempster, M. A. H. (1965). On stochastic programming, Ph.D. Thesis, Department of Mathematics, Carnegie Mellon University.
40. Dempster, M. A. H. (1980). Introduction to stochastic programming. In M. A. H. Dempster (Ed.), Stochastic programming (pp. 3-62). New York: Academic Press.
41. Dennis, J. E., & Torczon, V. (1991). Direct search methods on parallel machines. SIAM Journal of Optics, 1, 448.
42. Dennis J.E., Heinkenschloss M., Vicente L.N. Trust-region interior-point SQP algorithms for a class of nonlinear programming problems. SIAM Journal on Control and Optimization. 36:1998;1750-1794
43. Ding-Mai, & Sargent (1992). A combined SQP and branch and bound algorithm for MINLP optimization. Internal Report, Centre for Process Systems Engineering, London.
44. Dolan W.D., Cummings P.T., Levan M.D. Process optimization via simulated annealing. AIChE Journal. 35:1989;725-736
45. Duran M.A., Grossmann I.E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming. 36:1986;307
46. Edgar, T. F., Himmelblau, D. M., & Lasdon, L. S. (2002). Optimization of chemical processes. New York: McGraw-Hill.
47. Edgar, T. F., Himmelblau, D. M., & Lasdon, L. S. (2001). Optimization of chemical processes. New York: McGraw-Hill.
48. Eldred, M. (2002). DAKOTA: A multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis (http://endo.sandia.gov/DAKOTA/ software.html).
49. Ermoliev, Y., & Wets, R. J.-B. (1988). Numerical techniques for stochastic optimization. New York: Springer-Verlag.
50. Feehery W.F., Barton P.I. Dynamic optimization with state variable path constraints. Computers and Chemical Engineering. 22:1998;1241-1256
51. Fletcher, R., Gould, N. I. M., Leyffer, S., Toint, Ph. L., & Waechter, A. (2001). Global convergence of a trust-region (SQP)-filter algorithms for general nonlinear programming. Department of Mathematics, University of Namur, Belgium (Revised).
52. Fletcher R., Leyffer S. Solving mixed-integer nonlinear programs by outer approximation. Mathematical Programming. 66:1994;327
53. Fletcher, R. (1987). Practical methods of optimization. Chichester: Wiley.
54. Flippo O.E., Kan A.H.G.R. Decomposition in general mathematical programming. Mathematical Programming. 60:1993;361-382
55. Floquet, P., Pibouleau, & Domenech, S. (1994). Separation system synthesis: How to use a simulated annealing procedure. Computers and Chemical Engineering, 18, 1141.
56. Fourer, R., Gay, D. M., & Kernighan, B. W. (1992). AMPL: A modeling language for mathematical programming. Belomont, CA: Duxbury Press.
57. Garrard A., Fraga E.S. Mass exchange network synthesis using genetic algorithms. Computers and Chemical Engineering. 22:1998;1837
58. Gassmann, H. I. (1990). MSLiP: A computer code for the multistage stochastic linear programming problem. Mathematical Programming, 47 (pp. 407-423). Amsterdam: North-Holland.
59. Geoffrion A.M. Generalized benders decomposition. Journal of Optimization Theory and Applications. 10(4):1972;237-260
60. Gill, P. E., Murray, W., & Wright, M. (1981). Practical optimization. New York: Academic Press.
61. Gill, P. E., Murray, W., & Saunders, M. A. (1998). User's guide for SNOPT: A FORTRAN package for large-scale nonlinear programming. Technical report, Department of Mathematics, University of California, San Diego, USA, 1998.
62. Goulcher R., Cesares Long J. The solution of steady state chemical engineering optimization problems using a random search algorithm. Computers and Chemical Engineering. 2:1978;23
63. Grossmann I.E., Floudas C.A. Active constraint strategy for flexibility analysis in chemical processes. Computers and Chemical Engineering. 11(6):1987;675-693
64. Grossmann, I. E., & Straub, D. A. (1991). Recent developments in the evaluation and optimization of flexible chemical processes. In L. Puigjaner & A. Espuna (Eds.), Proceedings of COPE-91 (pp. 49-59). Barcelona, Spain.
65. Grossmann I.E., Sargent R.W.H. Optimum design of chemical plants with uncertain parameters. AIChE Journal. 24:1978;1021
66. Grossmann I.E., Sargent R.W.H. Optimum design of multipurpose chemical plants. Industrial Engineering in Chemical Process, Design and Development. 18:1979;343
67. Grossmann, I. E., & Kravanja, Z. (1997). Mixed-integer nonlinear programming: A survey of algorithms and applications. In Biegler, Coleman, Conn, Santosa (Eds.), The IMA volumes in mathematics and its applications: Large-scale optimization with applications (Vol. 93). Part II. Optimal design and control (pp. 73-100), Berlin: Springer-Verlag.
68. Grossmann, I. E., Quesada, J., Raman, R., & Voudouris, V. (1996). Mixed-integer optimization techniques for the design and scheduling of batch processes. In G. V. Reklaitis, A. K. Sunol, D. W. T. Rippin, & O. Hortacsu (Eds.), Batch processing systems engineering (pp. 451-494). Berlin: Springer-Verlag.
69. Grossmann I.E., Caballero J.A., Yeomans H. Advances in mathematical programming for automated design, integration and operation of chemical processes. Korean Journal of Chemical Engineering. 16:1999;407-426
70. Gupta O.K., Ravindran V. Branch and bound experiments in convex nonlinear integer programming. Management Science. 31(12):1985;1533-1546
71. Halemane K.P., Grossmann I.E. Optimal process design under uncertainty. AIChE Journal. 29:1983;425
72. Halemane K.P., Grossmann I.E. Optimal process design under uncertainty. AIChE Journal. 29:1993;425
73. Hasdorff, L. (1976). Gradient optimization and nonlinear control. New York, NY: Wiley/Interscience.
74. Hillier, F., & Lieberman, G. J. (1974). Introduction to operations research. San Francisco: Holden-Day.
75. Holland, J. H. (1975). Adaptations in natural and artificial systems. Ann Arbor: University of Michigan Press.
76. Ierapetritou M.G. A new approach for quantifying process feasibility: Convex and one dimensional quasi-convex regions. AIChE Journal. 47:2001;1407
77. Johns W.R., Marketos G., Rippin D.W.T. The optimal design of chemical plant to meet time-varying demands in the presence of technical and commercial uncertainty. Design Congress. 76:1976;F1
78. Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000). Progress in linear programming based branch-and-bound algorithms: Exposition. INFORMS Journal of Computing, 12.
79. Jung J.H., Lee C.H., Lee I.-B. A genetic algorithm for scheduling of multiproduct batch processes. Computers and Chemical Engineering. 22:1998;1725
80. Kallrath J. Mixed-integer optimization in the chemical process industry: Experience, potential and future. Transactions of Industrial and Chemical Engineering. 78(Part A):2000;809-822
81. Kelley J.E. Jr. The cutting-plane method for solving convex programs. Journal of SIAM. 8:1960;703-712
82. Kocis G.R., Grossmann I.E. Relaxation strategy for the structural optimization of process flowsheets. Industrial Engineering in Chemical Research. 26:1987;1869
83. Laarhoven, P. J. M., & van Aarts, E. H. L. (1987). Simulated annealing: Theory and applications. Dordrecht: Reidel.
84. Lakshmanan A., Biegler L.T. Synthesis of optimal chemical reactor networks. I&EC Research. 35(4):1995;1344
85. Leineweber, D. B. Bock, H. G., Schlöder, J. P., Gallitzendö rfer, J. V., Schäfer, A., & Jansohn, P. (1997). A boundary value problem approach to the optimization of chemical processes described by DAE models. Computers & Chemical Engineering (also: IWR-Preprint 97-14, Universität Heidelberg, March 1997).
86. Leyffer, S., (1993), Deterministic methods for mixed-integer nonlinear programming. Ph.D. Thesis, Department of Mathematics and Computer Science, University of Dundee, Dundee.
87. Leyffer S. Integrating SQP and branch and bound for mixed-integer noninear programming. Computational Optimization and Applications. 18:2001;295-309
88. Loehl T., Schulz C., Engell S. Sequencing of batch operations for highly coupled production process: Genetic algorithms vs. mathematical programming. Computers and Chemical Engineering. 22:1998;S579
89. Logsdon J.S., Biegler L.T. On the accurate solution of differential-algebraic optimization problems. I&EC Research. 28:1989;1628
90. Louveaux, F. V. (1986), Multistage stochastic programs with block-separable recourse, mathmatical programming study (Vol. 28, pp. 48-62). Amsterdam: North-Holland.
91. Luus R., Jaakola T.H.I. Direct search for complex systems. AIChE Journal. 19:1973;645-646
92. Luus R. Piecewise linear continuous optimal control by iterative dynamic programming. Industrial Engineering in Chemical Research. 32:1993;859-865
93. Madansky, A. (1963). In R. L. Graves, & P. Wolfe (Eds.), Linear programming under uncertainty, mathematical programming (pp. 103-110). New York: McGraw-Hill.
94. Magnanti T.L., Wong R.T. Accelerated benders decomposition: Algorithm enhancement and model selection criteria. Operations Research. 29:1981;464-484
95. Malik R.K., Hughes R.R. Optimal design of flexible chemical processes. Computers and Chemical Engineering. 3:1979;473
96. Mekarapiruk W., Luus R. Optimal control of inequality state constrained systems. Industrial Engineering in Chemical Research. 36:1997;1686-1694
97. Murtagh, B. A., & Saunders, M. A. (1987). MINOS 5.1 user's guide. Technical Report SOL 83-20R, Stanford University.
98. Nabar, S., & Schrage, L. (1991). Modeling and solving nonlinear integer programming problems. In Presented at annual AIChE meeting, Chicago.
99. Nelder J.A., Mead R. A simplex method for function minimization. Computer Journal. 7:1965;308
100. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley/Interscience.
101. Nilchan S., Pantelides C. On the optimization of periodic adsorption processes. Adsorption. 4:1998;113
102. Nocedal, J., & Wright, S. J. (1999). Numerical optimization. New York: Springer.
103. Ostrovsky G.M., Volin M., Senyavinj M.M. An approach to solving two-stage optimization problems under uncertainty. Computers and Chemical Engineering. 21:1997;311-325
104. Pinto J., Grossmann I.E. Assignment and sequencing models for the scheduling of chemical processes. Annals of Operations Research. 81:1998;433-466
105. Pistikoploulos, E. N. (2002). Review of Stochastic Flexibility, in preparation.
106. Pistikopoulos, E. N., & Mazzuchi, T. A. (1990). A novel flexibility analysis approach for processes with stochastic parameters with E. Pistikopoulos. Computers and Chemical Engineering, 14, 991-1000.
107. Polak, E. (1997). Optimization: Algorithms and consistent approximations. New York: Springer.
108. Pontryagin, V. V., Boltyanskii, Gamkrelidge, R., & Mishchenko, E. (1962). The mathematical theory of optimal processes. New York, NY: Interscience.
109. Pörn R., Westerlund T. A cutting plane method for minimizing pseudo-convex functions in the mixed-integer case. Computers and Chemical Engineering. 24:2000;2655-2665
110. Powell M.J.D. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Computing Journal. 7:1964;155
111. Quesada I., Grossmann I.E. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering. 16:1992;937-947
112. Raghunathan, A., & Biegler, L. T. (2002). MPEC Formulations and Algorithms in Process Engineering, submitted for publication.
113. Rao C.V., Rawlings J.B., Wright S. On the application of interior point methods to model predictive control. Journal of Optimum Theory and Applications. 99:1998;723
114. Reddien G.W. Collocation at Gauss points as a discretization in optimal control. SIAM Journal on Control and Optimization. 17:1979;298
115. Rooney W.R., Biegler L.T. Incorporating joint confidence regions into design under uncertainty. Computers and Chemical Engineering. 23(10):1999;1563-1575
116. Sahinidis, N. V. (2003). Optimization under uncertainty: State-of-the-art and opportunities. In I. E. Grossmann, & C. M. McDonald (Eds.), Proceedings of FOCAPO2003, Coral Springs.
117. Sahinidis N.V. BARON: A general purpose global optimization software package. Journal of Global Optimization. 8(2):1996;201-205
118. Sahinidis N.V., Grossmann I.E. Convergence properties of generalized benders decomposition. Computers and Chemical Engineering. 15:1991;481
119. Sargent R.W.H., Sullivan G.R. Development of feed changeover policies for refinery distillation units. Industrial Engineering in Chemical Process, Design and Development. 18:1979;113
120. Schittkowski, K. (1987). More test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems (Vol. 282). Berlin: Springer-Verlag.
121. Schwartz, A. (1996). Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of California-Berkeley.
122. Schweiger, C. A., & Floudas, C. A. (Eds.), Process synthesis, design and control: A mixed-integer optimal control framework (pp. 189-194). Proceedings of DYCOPS-5 on dynamics and control of process systems.
123. Sen S., Narasimhan S., Deb K. Sensor network design of linear processes using genetic algorithms. Computers and Chemical Engineering. 22:1998;385
124. Straub D.A., Grossmann I.E. Design optimization of stochastic flexibility. Computers and Chemical Engineering. 17:1993;339
125. Stubbs R., Mehrotra S. A Branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming. 86(3):1999;515-532
126. Swaney R.E., Grossmann I.E. An index for operational flexibility in chemical process design. Part I. Formulation and theory. AIChE Journal. 31:1985a;621
127. Swaney R.E., Grossmann I.E. An index for operational flexibility in chemical process design. Part II. Computational algorithms. AIChE Journal. 31:1985;631
128. Tanartkit P., Biegler L.T. Stable decomposition for dynamic optimization. Industrial Engineering in Chemical Research. 34:1995;1253-1266
129. Torczon V. On the convergence of the multidimensional search algorithm. SIAM Journal of Optics. 1:1991;123
130. Vanderbei, R. J., & Shanno, D. F. (1997). An interior point algorithm for non-convex nonlinear programming. Technical Report SOR-97-21, CEOR, Princeton University, Princeton, NJ.
131. Varvarezos D.K., Grossmann I.E., Biegler L.T. An outer approximation method for multiperiod design optimization. Industrial Engineering and Chemical Research. 31:1992;1466-1477
132. Vassiliadis V.R., Sargent W.H., Pantelides C. Solution of a class of multistage dynamic optimization problems. I&EC Research. 33:1994;2123
133. Vassiliadis, V. S. (1993). Computational solution of dynamic optimization problems with general differential-algebraic constraints. Ph.D. Thesis, University of London, London, UK.
134. Vassiliadis V.S., Sargent R.W.H., Pantelides C.C. Solution of a class of multistage dynamic optimization problems. 2. Problems with path constraints. Industrial Engineering in Chemical Research. 33:1994;2123-2133
135. Viswanathan J., Grossmann I.E. A combined penalty function and outer-approximation method for MINLP optimization. Computers and Chemical Engineering. 14:1990;769
136. Wächter, A., & Biegler, L. T. (2002). Global and local convergence of line search filter methods for nonlinear programming. CAPD Technical Report B-01-09 (August 2001, revised May 2002), submitted for publication.
137. Wächter, A. (2002), An interior point algorithm for large-scale nonlinear optimization with applications in process engineering. Ph.D. Thesis, Carnegie Mellon University.
138. Westerlund T., Pettersson F. A cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering. 19:1995;S131-S136
139. 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). Amsterdam: North-Holland.
140. Williams, H. P. (1985). Mathematical building in mathematical programming. Chichester: Wiley.
141. Wright, S. J. (1996). Primal-dual interior point methods. Philadelphia: SIAM.
142. Yuan X., Zhang S., Piboleau L., Domenech S. Une Methode d'optimisation Nonlineare en Variables Mixtes pour la Conception de Procedes. RAIRO. 22:1988;331