Part II. Future perspective on optimization

Computers and Chemical Engineering

Volumn 28, Issue 8, 2004, Pages 1193-1218

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Nonlinear programs; Optimization; Scientific computing

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; PROBLEM SOLVING; RESEARCH; SOFTWARE ENGINEERING;

OPTIMIZATION ALGORITHMS; OPTIMIZATION APPLICATIONS;

CHEMICAL ENGINEERING;

COMPUTER;

CHEMICAL STRUCTURE; COMPUTER PROGRAM; GENETIC ALGORITHM; INFORMATION PROCESSING; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; METHODOLOGY; NONLINEAR SYSTEM; PROCESS OPTIMIZATION; REVIEW;

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

References (161)

1. Adjiman C.S., Floudas C.A. Rigorous convex underestimators for general twice differentiable problems. Journal of Global Optimization. 9(1):1996;23-40
2. Adjiman C.S., Androulakis I.P., Maranas C.D., Floudas C.A. A global optimization method aBB for process design. Computers and Chemical Engineering. 20:1996;S419-S424
3. Adjiman C.S., Androulakis I.P., Floudas C.A. Global optimization of MINLP problems in process synthesis and design. Computers and Chemical Engineering. 21(Suppl.):1997;S445-S450
4. Adjiman C.S., Androulakis I.P., Floudas C.A. Global optimization of mixed-integer nonlinear problems. AIChE Journal. 46(9):2000;1769-1797
5. Ahmed S., Sahinidis N.V. Analytical investigations of the process planning problem. Computers and Chemical Engineering. 23:2000;1605-1621
6. Al-Khayyal F.A. Generalized bilinear programming. Part I. Models, applications and linear programming relaxation. European Journal of Operations Research. 60:1992;306-314
7. Al-Khayyal F.A., Falk J.E. Jointly constrained biconvex programming. Mathematics of Operations Research. 8:1983;273-286
8. Andreani, R., & Martinez, J. M. (2001). On the solution of mathematical programming problems with equilibrium constraints. Technical Report, Department of Applied Mathematics, IMECC-UNICAMP. University of Campinas, Campinas, SP, Brazil.
9. Anitescu, M. (2001). On solving mathematical programs with complementarity constraints as nonlinear programs. Preprint ANUMCS-P864-1200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne (p. I11).
10. Balas E. Disjunctive progrmming and a hierarchy of relaxations for discreteoptimizafion problems. SIAM Journal of Algorithms of Discovered Methods. 6:1985;466-486
11. Bartlett, R. A., & Biegler, L. T. (2003). rSQP++: An object-oriented framework for successive quadratic programming, p. 316, in Large-scale PDE-Constrained Optimization, Lecture Notes in Computational Science and Engineering, Biegler, Ghattas, Heinkenschloss, & van Bloemen Waanders (Eds.), Springer Verlag, Berlin (2003).
12. Bartlett R.A., Biegler L.T., Backstrom J., Gopal V. Quadratic programming algorithms for large-scale model predictive control. Journal of Process Control. 12:2002;775
13. Bartlett, R. A. (2001). Ph.D. Thesis, Chemical Engineering Department, Carnegie Mellon University, Pittsburgh, PA.
14. Battiti R., Tecchiolli G. The reactive Tabu search. ORSA Journal on Computing. 6:1994;126
15. Barton P.I., Pantelides C.C. Modeling of combined discrete/continuous processes. AIChE Journal. 40:1994;966-979
16. Bazaraa, M., Sherali, H., & Shetty, C. (1994). Nonlinear programming, theory and applications, second ed. New York: Wiley.
17. Beaumont N. An algorithm for disjunctive programs. European Journal of Operations Research. 48:1991;362-371
18. Ben-Tal, A., Eiger, G., & Gershovitz, V. (1994). Global minimization by reducing the duality gap. Mathematical Programming.
19. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik. 4:1962;238-252
20. Benson H.P., Horst R. A branch and bound - outer approximation for concave minimization over a convex set. Computers and Mathematics with Applications. 21:1991;67-76
21. Betts, J. T. (2001). Practical methods for optimal control using nonlinear programming. Advances in design and control, vol. 3. Philadelphia, USA: SIAM.
22. Biegler, L. T., & Wächter, A. (2003). SQP SAND strategies that link to existing modeling systems, p. 199, in Large-scale PDE-Constrained Optimization, Lecture Notes in Computational Science and Engineering, Biegler, Ghattas, Heinkenschloss, & van Bloemen Waanders (Eds.), Springer Verlag, Berlin (2003).
23. Biegler, L. T., & Grossmann, I. E. (2004). Retrospective on Optimization, submitted for publication.
24. Biegler L.T., Cervantes A., Wächter A. Advances in simultaneous strategies for dynamic process optimization. Chemical Engineering Science. 57:2002;575
25. Biegler, L. T., Schmid, C., & Ternet, D. (1997). A multiplier-free, reduced Hessian method for process optimization, large-scale optimization with applications. In IMA volumes in mathematics and applications (p. 101). Berlin: Springer-Verlag.
26. Biros, G., & Ghattas, O. (2001). Parallel Lagrange-Newton-Krylov- Schur methods for PDE-constrained optimization, submitted for publication.
27. Bockmayr A., Kasper T. Branch-and-infer: {a} unifying framework for integer and finite domain constraint programming. INFORMS Journal of Computing. 10:1998;287-300
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. Carøe C.C., Schultz R. Dual decomposition in stochastic integer programming. Operations Research Letters. 24(1-2):1999;37
30. Cavalier, T. M., & Soyster, A. L. (1987). Logical deduction via linear programming. IMSE Working Paper 87-147, Department of Industrial and Management Systems Engineering, Pennsylvania State University.
31. Cavalier T.M., Pardalos P.M., Soyster A.L. Modeling and integer programming techniques applied to propositional calculus. Computers and Operations Research. 17(6):1990;561-570
32. Ceria S., Soares J. Convex programming for disjunctive optimization. Mathematical Programming. 86(3):1999;595-614
33. Cervantes A.M., Biegler L.T. A stable elemental decomposition for dynamic process optimization. Computational Optimization and Applications. 120:2000;41-57
34. Cervantes A.M., Wächter A., Tutuncu R., Biegler L.T. A reduced space interior point strategy for optimization of differential algebraic systems. Computers and Chemical Engineering. 24:2000;39-51
35. Chandru, V., & Hooker, J. N. (1989). Extended horn sets in propositional logic. Working Paper 88-89-39, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.
36. Chandru, V., & Hooker, J. (1999). Optimization methods for logical inference. New York: Wiley.
37. Clark P.A., Westerberg A.W. Bilevel programming for steady state chemical process design I. Computers and Chemical Engineering. 14(1):1990;87-97
38. Clocksin, W. F., & Mellish, C. S. (1981). Programming in prolog. New York: Springer-Verlag.
39. Cook, S. A. (1971). The complexity of theorem proving procedures. In Proceedings of the 3rd ACM Symposium on the Theory of Computing (pp. 151-158).
40. Darby-Dowman K., Little J., Mitra G., Zaffalon M. Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints - An International Journal. 1:1997;245-264
41. Davis M., Putnam H. A computing procedure for quantification theory. Journal of ACM. 8:1960;201-215
42. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., & Bertier, F. (1988). The constraint programming language CHIP. In Proceedings on the International Conference on Fifth Generation Computer Systems. FGCS-88, Tokyo.
43. Dinkelbach W. On nonlinear fractional programming. Management Science. 13:1967;492-498
44. Dowling W.F., Gallier J.H. Linear-time algorithms for testing the satifiability of propositional Horn formulae. Logic Programming. 3:1984;267-284
45. Equi L., Gallo G., Marziale S., Weintraub A. A combined transportation and scheduling problem. European Journal of Operational Research. 97:1997;94-104
46. Ermoliev Y.M., Kryazhimskii A.V., Ruszcynski A. Constraint aggregation principle in convex optimization. Mathematical Programming. 76:1997;353-372
47. Falk, J. E., & Palocsay, S. W. (1992). Optimizing the sum of linear fractional functions. In C. A., Floudas, & P. M., Pardalos (Eds.), Recent advances in global optimization (pp. 221-258).
48. Falk J.E., Soland R.M. An algorithm for separable nonconvex programming problems. Management Science. 15:1969;550-569
49. Fisher M.L. The Lagrangean relaxation method for solving integer programming problems. Management Science. 27(1):1981;1-17
50. Floudas, C. A. (2000). Deterministic global optimization: theory, methods and applications. Dordrecht, The Netherlands: Kluwer Academic Publishers.
51. Floudas C.A., Grossmann I.E. Synthesis of flexible heat exchanger networks with uncertain flowrates and temperatures. Computers and Chemical Engineering. 11:1987;319-336
52. Floudas C.A., Gumus Z.H., Ierapetritou M.G. Global optimization in design under uncertainty: feasibility test and flexibility index problems. Industrial and Engineering Chemistry Research. 40:2001;42674282
53. Floudas C.A., Visweswaran V. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs-I theory. Computes and Chemical Engineering. 14:1990;1397-1417
54. Geoffrion A.M. Generalized Benders decomposition. Journal of Optimization Theory and Applications. 10(4):1972;237-260
55. Gill, P. E., Murray, W., & Saunders, M. A. (1987). User's guide for NPSOL: A FORTRAN package for sequential quadratic programming. Technical Report, Department of Mathematics, University of California, San Diego, USA.
56. Glover F. Tabu search: a tutorial. Interfaces. 20:1990;74
57. Gropp W.D., Keyes D.E., Mclnnes L.C., Tidiri M.D. Globalized Newton-Krylov-Schwarz algorithms and software for parallel implicit CFD. International Journal of High Performance in Computer Applications. 14:2000;102
58. Grossmann, I. E. (Ed.) (1996). Global optimization in engineering design. Dordrecht, The Netherlands: Kluwer Academic Publishers.
59. Grossmann, I. E., & Lee, S. (2002). Generalized disjunctive programming: Nonlinear convex hull relaxation and algorithms. Computational Optimization and Applications.
60. Guignard M. Lagrangean relaxation: A short course. Belgian Journal of OR: Special Issue Francoro. 35:1995;3
61. Guignard M., Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming. 39:1987;215-228
62. Gupta A., Maranas C.D. A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Industrial and Engineering Chemistry Research. 38:1999;1937-1947
63. Hansen E.R. Global optimization using interval analysis: The multi-dimensional case. Numerische Mathematik. 34:1980;247-270
64. Hansen P., Jaumard B., Lu S. Global optimization of univariate Lipschitz functions. I. Surrey and properties. Mathematical Programming. 55:1992a;251-272
65. Hansen P., Jaumard B., Lu S. Global optimization of univariate Lipschitz functions: New algorithms and computational comparison. Mathematical Programming. 55:1992;273-292
66. Harker P.T., Pang J.-S. Finite-dimensional variational inequalities and complementarity problems: A survey of theory, algorithms and applications. Mathematical Programming. 60:1990;161-220
67. Heipcke, S. (1999a). An example of integrating constraint programming and mathematical programming. Electronic Notes in Discrete Mathematics, 1.
68. Heipcke S. Comparing constraint programming and mathematical programming approaches to discrete optimisation - the change problem. Journal of Operational Research Society. 50:1999;581-595
69. Holland, J. H. (1975). Adaptations in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
70. Horst R., Tuy H. On the convergence of global methods in multiextremal optimization. Journal Optimization Theory and Application. 54:1987;253
71. Horst R., Thoai N.V., De Vries J. A new simplicial cover technique in constrained global optimization. Journal of Global Optimization. 2:1992;1-19
72. Hooker, J. N. (2000). Logic-based methods for optimization: Combining optimization and constraint satisfaction. New York: Wiley.
73. Hooker J.N., Osorio M.A. Mixed logical, linear programming. Discrete Applied Mathematics. 96-97:1999;395-442
74. Hooker, J. N., Ottosson, G., Thorsteinsson, E. S., & Kim, H. J. (1999). On integrating constraint propagation and linear programming for combinatorial optimization. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAM-99) (pp. 136-141). Cambridge, MA: MIT Press.
75. Horst, R., & Tuy, H. (1996). Global optimization: Deterministic approaches, third ed. Berlin: Springer-Verlag.
76. Ierapetritou M.G., Pistikopoulos E.N., Floudas C.A. Operational planning under uncertainty. Computers and Chemical Engineering. 20:1996;1499-1516
77. ILOG (1999). OPL Studio 2.1, user's manual. Incline Village, NV: ILOG Inc.
78. Iyer R.R., Grossmann I.E. A bilevel decomposition algorithm for long-range planning of process networks. Industrial and Engineering Chemistry Research. 37:1998;474
79. Jain V., Grossmann I.E. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal of Computing. 13:2001;258-276
80. Jeroslow R.E., Wang J. Solving propositional satisfiability problems. Annals of Mathematics and AI. 1:1990;167-187
81. Jorsten K., Leisten R. Scenario aggregation in single-resource production planning models with uncertain demand. Production Planning and Control. 5(3):1994;271-281
82. Jiang H., Ralph D. Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM Journal on Optimization. 10(3):2000;779-808
83. Jockenhoevel, T., Biegler, L. T., & Wächter, A. (2003). Dynamic optimization of the Tennessee Eastman process using the OptControlCentre. Computers and Chemical Engineering, 27, (11) 1513-1531.
84. Karp, R. M. (1972). In R. E. Miller, & J. W. Thatcher (Eds.), Reducibility among combinatorial problems, complexity of computer calculations (pp. 85-104). New York: Plenum Press.
85. Kesavan, P., & Barton, P. I. (2000a). Decomposition algorithms for nonconvex mixed-integer nonlinear programs. American Institute of Chemical Engineering Symposium Series, 96 (223) 458-461.
86. Kesavan P., Barton P.I. Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems. Computers and Chemical Engineering. 24:2000b;1361-1366
87. Kocis G.R., Grossmann I.E. A modelling and decomposition strategy for the MINLP optimization of process flowsheets. Computers and Chemical Engineering. 13(7):1989;797-819
88. Kondili E., Pantelides C.C., Sargent R.W.H. A general algorithm for short-term computers and chemical scheduling of batch operations. I. MILP formulation. Computers and Chemical Engineering. 17(2):1993;211-227
89. Konno H., Yajima Y., Matsui T. Parametric simplex algorithms for solving a special class of nonconvex minimization problems. Journal of Global Optimization. 1:1991;65-81
90. Kravanja Z., Grossmann I.E. PROSYN: An MINLP process synthesizer. Computers and Chemical Engineering. 14:1990;1363
91. Lang, Y. -D., Cervantes, A., & Biegler, L. T. (1998). DynoPC: A dynamic optimization tool for process engineering. In Proceedings of the INFORMS National Meeting. Seattle, WA.
92. Lee S., Grossmann I.E. New algorithms for nonlinear generalized disjunctive programming. Computers and Chemical Engineering. 24(9-10):2000;2125-2141
93. Lee S., Grossmann I.E. A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Computers and Chemical Engineering. 25:2001;1675-1697
94. Lehoucq, R., & Salinger, A. (1998). Massively parallel linear stability analysis with P_ARPACK for 3D fluid flow modeled with MPSalsa. In B. Kågström, J. Dongarra, E. Elmroth, & J. Wasniewski (Eds.), Proceedings of the 4th International Workshop on Applied Parallel Computing, PARA'98, vol. 1541 (pp. 286-295). Lecture Notes in Computer Science. Berlin: Springer-Verlag.
95. Leyffer, S. (2000). Mathematical programs with equilibrium constraints - much ado about nothing. ISMP, Atlanta.
96. Long, K. (2001). Sundance: A rapid prototyping tool for parallel PDE optimization. In Proceedings of the First CSRI Workshop on PDE-based Optimization. Santa Fe, NM.
97. Loveland, D. W. (1978). Automated theorem proving: A logical basis. Amsterdam: North-Holland.
98. Luo, Z. -Q., Pang, J. -S., & Ralph, D. (1996). Mathematical programs with equilibrium constraints. Cambridge: Cambridge University Press.
99. Maranas C.D., Floudas C.A. Global minimum potential energy conformations of small molecules. Journal of Global Optimization. 4(2):1994a;135-170
100. Maranas C.D., Floudas C.A. A deterministic global optimization approach for molecular structure determination. Journal of Chemical Physics. 100(2):1994b;1247-1261
101. Maranas C.D., Floudas C.A. Global optimization in generalized geometric programming. Computers and Chemical Engineering. 21:1997;351-569
102. Marquardt W., Nagl M. Tool integration via interface standardization? Papers of the 36th DECHEMA-Monographie. Computer Application in Process and Plant Engineering. 135:1998;95-126
103. McCormick G.P. Computability of global solutions to factorable nonconvex programs. Part I. Convex underestimating problems. Mathematical Programming. 10:1976;147-175
104. Mittelmann, H. (2002). ftp://plato.la.asu.edu/pub/ampl-nlp.txt.
105. Nowak, M. P., & Römisch, W. (1998). Stochastic Lagrangean relaxation applied to power scheduling in a hydro-thermal system under uncertainty. Institut für Mathematik Humboldt-Universitat, Berlin [preprint].
106. Papageorgiou L.G., Pantelides C.C. Optimal campaign planning/scheduling of multipurpose batch/semi-continuous plants. 2. A mathematical decomposition approach. Industrial and Engineering Chemistry Research. 35:1996;510
107. 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
108. Proll L., Smith B. Integer linear programming and constraint logic programming approaches to a template design problem, INFORMS. Journal of Computing. 10:1998;265-275
109. Puget, J. -F. (1994). A C++ implementation of CLP. In Proceedings of SPICIS'94. Singapore.
110. Quesada I., Grossmann I.E. Global optimization algorithm for heat exchanger networks. Industrial and Engineering Chemistry Research. 32:1993;487
111. Quesada I., Grossmann I.E. A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization. 6(1):1995;39-76
112. Raghunathan, A., & Biegler, L. T. (2003) MPEC formulations and algorithms in process engineering. Computers and Chemical Engineering, 27, 1381-1392.
113. Raghunathan, A., Wächter, A., & Biegler, L. T. (2002). Formulation and solution of MPEC problems for dynamic chemical process optimization. In Proceedings of the 2002 SIAM Conference on Optimization. Toronto.
114. Ramage, M. (1998). Computation and competitiveness: managing technology in the information age, FOCAPO'98. Snowbird, Utah, 5-10 July.
115. Raman R., Grossmann I.E. Symbolic integration of logic in mixed integer linear programming techniques for process synthesis. Computers and Chemical Engineering. 17:1993;909
116. Raman R., Grossmann I.E. Modelling and computational techniques for logic based integer programming. Computers and Chemical Engineering. 18(7):1994;563-578
117. Régin, J. -C. (1993). A filtering algorithm for constraints of difference in CSPs. Research Report No. LIRMM 93-068, Laboratoire d'Informatique, de Robotique et de Microelectronique de Montpellier, Universit Montpellier, France.
118. Rodosek R., Wallace M.G., Hajian M.T. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research. 86:1999;63-87
119. Rogers D.F., Plante R.D., Wong R.T., Evans J.R. Aggregation and disaggregation techniques and methodology in optimization. Operation Research. 39:1991;553
120. Ruszczynski A. Decomposition methods in stochastic programming. Mathematical Programming. 79:1997;333-353
121. Ryoo H.S., Sahinidis N.Y. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers and Chemical Engineering. 19(5):1995;551-566
122. Ryoo H.S., Sahinidis N.Y. A branch-and-reduce approach to global optimization. Journal of Global Optimization. 8:1996;107-138
123. Sahin K.H., Ciric A.R. A dual temperature simulated annealing approach for solving bilevel programming problems. Computers and Chemical Engineering. 23:1998;11-25
124. Sahinidis N.Y. BARON: A general purpose global optimization software package. Journal of Global Optimization. 8(2):1996;201-205
125. Schlegel, M., Binder, Th., Cruse, A., Oldenburg, J., & Marquardt, W. (2001). Adaptive optimization of dynamic systems. In R. Gani, & S. B. Jørgensen (Eds.), Proceedings of the European Symposium on Computer Aided Process Engineering, vol. 11 (pp. 1071-1076). Amsterdam: Elsevier.
126. Sherali H.D., Alameddine A. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization. 2:1992;379-410
127. Sherali H., Tuncbilek C.H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization. 2:1992;101-112
128. Shor N.Z. Dual quadratic estimates in polynomial and Boolean programming. Annals of Operations Research. 25:1990;163-168
129. Singer, A. B., & Barton, P. I. (2001). Global solution of linear dynamic embedded optimization problems. Part I. Theory. Journal of Optimization Theory and Applications, submitted for publication.
130. Smith B.M., Brailsford S.C., Hubbard P.-M., Williams H.-P. The progressive party problem: Linear programming and constraint programming compared. Constraints - An International Journal. 1:1997;119-138
131. Smith E.M.B., Pantelides C.C. A symbolic reformulation/spatial branch and bound algorithm for the global optimization of nonconvex MINLPs. Computers and Chemical Engineering. 23:1999;457-478
132. Soland R.M. An algorithm for separable nonconvex programming problems. II. Nonconvex constraints. Management Science. 17:1971;759-773
133. Sourlas D., Manousiouthakis V. Best achievable decentralized performance. IEEE Transactions on Automation Contribution. 40(11):1995;1858-1871
134. Stubbs R., Mehrotra S. A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming. 86(3):1999;515-532
135. Swaney R.E., Grossmann I.E. An index for operational flexibility in chemical process design. Part I. Formulation and theory. AIChE Journal. 31:1985;621
136. Swaney, R. E. (1993). Global solution of algebraic nonlinear programs. Paper MC36.3. presented at TIMS/ORSA Meeting, Phoenix, AZ.
137. Tawarmalani, M., & Sahinidis, N. V. (2000a). Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming, submitted for publication.
138. Tawarmalani, M., & Sahinidis, N. V. (2000b). Semidefinite relaxations of fractional programs via novel techniques for constructing convex envelopes of nonlinear functions. Journal of Global Optimization, submitted for publication.
139. Türkay M., Grossmann I.E. A logic based outer-approximation algorithm for MINI-P optimization of process flowsheets. Computers and Chemical Engineering. 20:1996;959-978
140. Tuy H., Horst R. Convergence and restart in branch and bound algorithms for global optimization Problems. Application to concave minimization and DC-optimization problems. Mathematical Programming. 41:1988;161-183
141. Tuy H., Thieu T.V., Thai N.Q. A conical algorithm for globally minimizing a concave function over a closed convex set. Mathematics of Operations Research. 10:1985;498-514
142. Tuy H. Global minimum of a difference of two convex functions. Mathematical Programming Study. 30:1987;150-182
143. van Bloemen Waanders, B., Bartlett, R. A., Salinger, A., Pawlowski, R, & Biegler, L. T. (2001). Simultaneous analysis and design optimization of massively parallel simulation codes using an object oriented framework. In Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing (SIAG/SC) (PO1).
144. Vanderbei, R. J., & Shanno, D. F. (1997). An interior point algorithm for nonconvex nonlinear programming. Technical Report 50R9721, CEOR, Princeton University, Princeton, NJ.
145. Van den Heever S.A., Grossmann I.E. An iterative aggregation/ disaggregation approach for the solution of a mixed-integer nonlinear oilfield infrastructure planning model. Industrial and Engineering Chemistry Research. 39(6):2000;1955-1971
146. Van den Heever S.A., Grossmann I.E., Vasantharajan S., Edwards K. A Lagrangean decomposition heuristic for the design and planning of offshore hydrocarbon field infrastructures with complex economic objectives. I&EC Research. 40:2001;2857-2875
147. Van Hentenryck, P. (1989). Constraint satisfaction in logic programming. Cambridge, MA: MIT Press.
148. Van Roy T.J. Cross decomposition for mixed integer programming. Mathematical Programming. 25:1983;46-63
149. van Schijndel, J., & Pistikopoulos, S. (1999). Towards the integration of process design, process control and process operability - current status and future trends. Presented at FOCAPD'99.
150. Vecchietti A., Grossmann I.E. LOGMIP: A discrete continuous nonlinear optimizer. Computers and Chemical Engineering. 23:1999;555-565
151. Vecchietti A., Grossmann I.E. Modeling issues and implementation of language for disjunctive programming. Computers and Chemical Engineering. 24:2000;2143-2155
152. Viswanathan J., Grossmann L.E. A combined penalty function and outer-approximation method for MINLP optimization. Computers and Chemical Engineering. 14:1990;769-782
153. 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.
154. Wächter, A. (2002). An interior point algorithm for large-scale nonlinear optimization with applications in process engineering. Ph.D. thesis, Carnegie Mellon University.
155. Wallace M., Novello S., Schimpf J. ECLiPSe: A platform for constraint logic programming. ICL Systems Journal. 12(1):1997;159-200
156. Wilkinson S.J., Cortier A., Shah N., Pantelides C.C. Integrated production and distribution scheduling on a Europe-wide basis. Computers and Chemical Engineering. 20:1996;S1275-S1280
157. Williams, H. P. (1985). Mathematical building in mathematical programming. Chichester: Wiley.
158. Womble D.E., Dosanja S.S., Hendrickson B., Heroux M.A., Plimpton S.J., Tonikins J.L., Greenberg D.S. Massively parallel computing: Sandia perspective. Parallel Computing. 25:1999;1853-1876
159. Zamora J.M., Grossmann I.E. A branch and bound algorithm for problems with concave univariate. Journal of Global Optimization. 14(3):1999;217-249
160. Zamora J.M., Grossmann I.E. A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits. Computers and Chemical Engineering. 22(13):1998a;367-384
161. Zamora J.M., Grossmann I.E. Continuous global optimization of structured process systems models. Computers and Chemical Engineering. 22(12):1998b;1749- 1770