×

A review of deterministic optimization methods in engineering and management. (English) Zbl 1264.90002

Summary: With the increasing reliance on modeling optimization problems in practical applications, a number of theoretical and algorithmic contributions of optimization have been proposed. The approaches developed for treating optimization problems can be classified into deterministic and heuristic. This paper aims to introduce recent advances in deterministic methods for solving signomial programming problems and mixed-integer nonlinear programming problems. A number of important applications in engineering and management are also reviewed to reveal the usefulness of the optimization methods.

MSC:

90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90C30 Nonlinear programming
90C11 Mixed integer programming

Software:

APOGEE; GGPECP
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] W. Sharpe, “A linear programming approximation for the general portfolio analysis,” Journal of Financial and Quantitative Analysis, vol. 6, pp. 1263-1275, 1971.
[2] B. Stone, “A linear programming formulation of the general portfolio selection model,” Journal of Financial and Quantitative Analysis, vol. 8, pp. 621-636, 1973.
[3] M. R. Young, “A minimax portfolio selection rule with linear programming solution,” Management Science, vol. 44, no. 5, pp. 673-683, 1998. · Zbl 0999.91043
[4] C. S. Chen, S. M. Lee, and Q. S. Shen, “An analytical model for the container loading problem,” European Journal of Operational Research, vol. 80, no. 1, pp. 68-76, 1995. · Zbl 0927.90087
[5] L. Faina, “A global optimization algorithm for the three-dimensional packing problem,” European Journal of Operational Research, vol. 126, no. 2, pp. 340-354, 2000. · Zbl 0971.90071
[6] H. L. Li, C. T. Chang, and J. F. Tsai, “Approximately global optimization for assortment problems using piecewise linearization techniques,” European Journal of Operational Research, vol. 140, no. 3, pp. 584-589, 2002. · Zbl 0998.90067
[7] R. J. Duffin, E. L. Peterson, and C. Zener, Geometric programming: Theory and application, John Wiley & Sons Inc., New York, 1967. · Zbl 0171.17601
[8] J. S. Arora, Introduction to Optimum Design, McGraw-Hill, New York, NY, USA, 1989.
[9] E. Sandgren, “Nonlinear integer and discrete programming in mechnical design optimization,” Journal of Mechanisms, Transmissions, and Automation in Design, vol. 112, no. 2, pp. 223-229, 1990.
[10] J. F. Fu, R. G. Fenton, and W. L. Cleghorn, “A mixed integer-discrete -continuous programming method and its application to engineering design optimization,” Engineering Optimization, vol. 17, pp. 263-280, 1991.
[11] J. F. Tsai, H. L. Li, and N. Z. Hu, “Global optimization for signomial discrete programming problems in engineering design,” Engineering Optimization, vol. 34, no. 6, pp. 613-622, 2002.
[12] J. F. Tsai, “Global optimization for signomial discrete programming problems in engineering design,” Engineering Optimization, vol. 42, no. 9, pp. 833-843, 2010.
[13] D. Rotem, G. A. Schloss, and A. Segev, “Data allocation for multidisk databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 5, pp. 882-887, 1993. · Zbl 05109638
[14] X. Lin and M. Orlowska, “An integer linear programming approach to data allocation with the minimum total communication cost in distributed database systems,” Information Sciences, vol. 85, no. 1-3, pp. 1-10, 1995. · Zbl 05468801
[15] R. Sarathy, B. Shetty, and A. Sen, “A constrained nonlinear 0-1 program for data allocation,” European Journal of Operational Research, vol. 102, no. 3, pp. 626-647, 1997. · Zbl 0951.90569
[16] J. F. Tsai and H. L. Li, “Technical note-on optimization approach for multidisk vertical allocation problems,” European Journal of Operational Research, vol. 165, no. 3, pp. 835-842, 2005. · Zbl 1141.90475
[17] M. H. Lin, “An optimal workload-based data allocation approach for multidisk databases,” Data and Knowledge Engineering, vol. 68, no. 5, pp. 499-508, 2009. · Zbl 05841515
[18] H. S. Ryoo and N. V. Sahinidis, “Global optimization of nonconvex NLPs and MINLPs with applications in process design,” Computers and Chemical Engineering, vol. 19, no. 5, pp. 551-566, 1995.
[19] C. A. Floudas, “Global optimization in design and control of chemical process systems,” Journal of Process Control, vol. 10, no. 2, pp. 125-134, 2000.
[20] C. A. Floudas, “Recent advances in global optimization for process synthesis, design and control: enclosure of all Solutions,” Computers and Chemical Engineering, vol. 23, no. 1, pp. S963-S973, 1999.
[21] C. A. Floudas, Deterministic Global Optimization: Theory, Methods and Application, Kluwer Academic Publishers, Boston, Mass, USA, 2000.
[22] C. D. Maranas and C. A. Floudas, “Global optimization in generalized geometric programming,” Computers and Chemical Engineering, vol. 21, no. 4, pp. 351-369, 1997.
[23] J. G. Ecker, M. Kupferschmid, C. E. Lawrence, A. A. Reilly, and A. C. H. Scott, “An application of nonlinear optimization in molecular biology,” European Journal of Operational Research, vol. 138, no. 2, pp. 452-458, 2002. · Zbl 1003.90043
[24] J. Mockus, W. Eddy, L. Mockus, and G. Reklaitis, Bayesian Heuristic Approach to Discrete and Global Optimization, Kluwer Academic Publishers, London, UK, 1996. · Zbl 0864.65036
[25] I.E. Grossmann, Global Optimization in Engineering Design, Kluwer Academic Publishers, London, UK, 1996. · Zbl 0869.00021
[26] I. M. Bomze, T. Csendes, R. Horst, and P. M. Pardalos, Developments in Global Optimization, Kluwer Academic Publishers, London, UK, 1997. · Zbl 0865.00047
[27] A. Migdalas, P. M. Pardalos, and P. Varbrand, Multilevel Optimization: Algorithms and Applications, Kluwer Academic Publishers, London, UK, 1997.
[28] E. S. Mistakidis and G. E. Stavroulakis, Nonconvex Optimization in Mechanics: Algorithm, Heuristics and Engineering Applications by the F.E.M, Kluwer Academic Publishers, London, UK, 1997. · Zbl 0918.73002
[29] R. De Leone, A. Murli, P. M. Pardalos, and G. Toraldo, High Performance Software for Nonlinear Optimization, Kluwer Academic Publishers, London, UK, 1998. · Zbl 0931.00038
[30] E. M. T. Hendrix, Global optimization at work, Ph.D. thesis, Agriculture University Wageningen, Wageningen, The Netherlands, 1998.
[31] G. F. Corliss and R. B. Kearfott, “Rigorous global search: industrial applications,” in Developments in Reliable Computing, T. Csendes, Ed., pp. 1-16, Kluwer Academic Publishers, London, UK, 1999. · Zbl 0949.65067
[32] C. A. Floudas and P. M. Pardalos, Optimization in Computational Chemistry and Molecular Biology-Local and Global Approaches, Kluwer Academic Publishers, London, UK, 2000. · Zbl 0936.00053
[33] M. Laguna and J. L. González-Velarde, Computing Tools for Modeling Optimization and Simulation, Kluwer Academic Publishers, London, UK, 2000.
[34] P. M. Papalambros and D. J. Wilde, Principles of Optimal Design-modeling and Computation, Cambridge University Press, Cambridge, UK, 2nd edition, 2000. · Zbl 0962.90002
[35] A. Atkinson, B. Bogacka, and A. A. Zhigljavsky, Optimum Design 2000, Kluwer Academic, London, UK, 2001.
[36] T. F. Edgar, D. M. Himmelblau, and L. S. Lasdon, Optimization of Chemical Processes, McGraw-Hill, Boston, Mass, USA, 2nd edition, 2001.
[37] P.M. Pardalos and H.E. Romeijn, Handbook of Global Optimization, vol. 2, Kluwer Academic Publishers, London, UK, 2002. · Zbl 0991.00017
[38] M. Tawarmalani and N. V. Sahinidis, “Convex extensions and envelopes of lower semi-continuous functions,” Mathematical Programming A, vol. 93, no. 2, Ser. A, pp. 247-263, 2002. · Zbl 1065.90062
[39] N. Hadjisavvas, S. Komlósi, and S. S. Schaible, Handbook of Generalized Convexity and Generalized Monotonicity, Kluwer Academic Publishers, London, UK, 2005. · Zbl 1070.26002
[40] C. A. Floudas, I. G. Akrotirianakis, S. Caratzoulas, C. A. Meyer, and J. Kallrath, “Global optimization in the 21st century: advances and challenges,” Computers and Chemical Engineering, vol. 29, pp. 1185-1202, 2005.
[41] J. D. Pintér, Global Optimization: Scientific and Engineering Case Studies, Kluwer Academic Publishers, London, UK, 2006. · Zbl 1103.90011
[42] S. K. Mishra and G. Giorgi, Invexity and Optimization, Kluwer Academic Publishers, London, UK, 2008. · Zbl 1155.90016
[43] S. K. Mishra, S. Wang, and K. K. Lai, Generalized Convexity and Vector Optimization, Kluwer Academic Publishers, London, UK, 2009. · Zbl 1162.49001
[44] C. A. Floudas and C. E. Gounaris, “A review of recent advances in global optimization,” Journal of Global Optimization, vol. 45, no. 1, pp. 3-38, 2009. · Zbl 1180.90245
[45] R. J. Duffin and E. L. Peterson, “Duality theory for geometric programming,” SIAM Journal on Applied Mathematics, vol. 14, pp. 1307-1349, 1966. · Zbl 0203.21902
[46] R. J. Duffin, “Linearizing geometric programs,” SIAM Review, vol. 12, pp. 211-227, 1970. · Zbl 0229.90047
[47] S. Boyd, S.-J. Kim, L. Vandenberghe, and A. Hassibi, “A tutorial on geometric programming,” Optimization and Engineering, vol. 8, no. 1, pp. 67-127, 2007. · Zbl 1178.90270
[48] R. J. Duffin and E. L. Peterson, “Geometric programming with signomials,” Journal of Optimization Theory and Applications, vol. 11, pp. 3-35, 1973. · Zbl 0238.90069
[49] J. G. Ecker, “Geometric programming: methods, computations and applications,” SIAM Review, vol. 22, no. 3, pp. 338-362, 1980. · Zbl 0438.90088
[50] C. D. Maranas and C. A. Floudas, “Finding all solutions of nonlinearly constrained systems of equations,” Journal of Global Optimization, vol. 7, no. 2, pp. 143-182, 1995. · Zbl 0841.90115
[51] C. A. Floudas and P. M. Pardalos, State of the Art in Global Optimization: Computational Methods and Applications, Kluwer Academic Publishers, Boston, MAss, USA, 1996. · Zbl 0847.00058
[52] R. Pörn, I. Harjunkoski, and T. Westerlund, “Convexification of different classes of non-convex MINLP problems,” Computers and Chemical Engineering, vol. 23, no. 3, pp. 439-448, 1999.
[53] H. L. Li and J. F. Tsai, “Treating free variables in generalized geometric global optimization programs,” Journal of Global Optimization, vol. 33, no. 1, pp. 1-13, 2005. · Zbl 1116.90096
[54] J. F. Tsai and M. H. Lin, “An optimization approach for solving signomial discrete programming problems with free variables,” Computers and Chemical Engineering, vol. 30, no. 8, pp. 1256-1263, 2006.
[55] J. F. Tsai and M.-H. Lin, “Finding all solutions of systems of nonlinear equations with free variables,” Engineering Optimization, vol. 39, no. 6, pp. 649-659, 2007.
[56] J. F. Tsai and M.-H. Lin, “Global optimization of signomial mixed-integer nonlinear programming problems with free variables,” Journal of Global Optimization, vol. 42, no. 1, pp. 39-49, 2008. · Zbl 1173.90483
[57] J. F. Tsai, M.-H. Lin, and Y.-C. Hu, “On generalized geometric programming problems with non-positive variables,” European Journal of Operational Research, vol. 178, no. 1, pp. 10-19, 2007. · Zbl 1109.90050
[58] J. F. Tsai, “Treating free variables in generalized geometric programming problems,” Computers and Chemical Engineering, vol. 33, no. 1, pp. 239-243, 2009.
[59] H. L. Li and H. C. Lu, “Global optimization for generalized geometric programs with mixed free-sign variables,” Operations Research, vol. 57, no. 3, pp. 701-713, 2009. · Zbl 1226.90078
[60] M.-H. Lin and J. F. Tsai, “Finding multiple optimal solutions of signomial discrete programming problems with free variables,” Optimization and Engineering, vol. 12, no. 3, pp. 425-443, 2011. · Zbl 1284.90082
[61] J. F. Tsai and M.-H. Lin, “An efficient global approach for posynomial geometric programming problems,” INFORMS Journal on Computing, vol. 23, no. 3, pp. 483-492, 2011. · Zbl 1243.90181
[62] K. M. Björk, A global optimization method with some heat exchanger network applications, Ph.D. thesis, Åbo Akademi University, 2002.
[63] K. M. Björk, P. O. Lindberg, and T. Westerlund, “Some convexifications in global optimization of problems containing signomial terms,” Computers and Chemical Engineering, vol. 27, no. 5, pp. 669-679, 2003.
[64] R. Pörn, K.-M. Björk, and T. Westerlund, “Global solution of optimization problems with signomial parts,” Discrete Optimization, vol. 5, no. 1, pp. 108-120, 2008. · Zbl 1134.90041
[65] T. Westerlund and J. Westerlund, “GGPECP-An algorithm for solving non-convex MINLP problems by cutting plane and transformation techniques,” Chemical Engineering Transactions, vol. 3, pp. 1045-1050, 2003.
[66] T. Westerlund, “Some transformation techniques in global optimization,” in Global Optimization, vol. 84, pp. 45-74, Springer, New York, NY, USA, 2006. · Zbl 1100.90037
[67] A. Lundell and T. Westerlund, “Optimization of power transformations in global optimization,” Chemical Engineering Transactions, vol. 11, pp. 95-100, 2007.
[68] A. Lundell, J. Westerlund, and T. Westerlund, “Some transformation techniques with applications in global optimization,” Journal of Global Optimization, vol. 43, no. 2-3, pp. 391-405, 2009. · Zbl 1169.90453
[69] A. Lundell and T. Westerlund, “Convex underestimation strategies for signomial functions,” Optimization Methods & Software, vol. 24, no. 4-5, pp. 505-522, 2009. · Zbl 1178.90278
[70] A. Lundell and T. Westerlund, “On the relationship between power and exponential transformations for positive signomial functions,” Chemical Engineering Transactions, vol. 17, pp. 1287-1292, 2009.
[71] M.-H. Lin and J. F. Tsai, “Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems,” European Journal of Operational Research, vol. 216, no. 1, pp. 17-25, 2012. · Zbl 1242.90177
[72] B. Borchers and J. E. Mitchell, “An improved branch and bound algorithm for mixed integer nonlinear programs,” Computers & Operations Research, vol. 21, no. 4, pp. 359-367, 1994. · Zbl 0797.90069
[73] M. A. Duran and I. E. Grossmann, “An outer-approximation algorithm for a class of mixed-integer nonlinear programs,” Mathematical Programming, vol. 36, no. 3, pp. 307-339, 1986. · Zbl 0619.90052
[74] R. Fletcher and S. Leyffer, “Solving mixed integer nonlinear programs by outer approximation,” Mathematical Programming, vol. 66, no. 3, Ser. A, pp. 327-349, 1994. · Zbl 0833.90088
[75] C. A. Floudas, Nonlinear and Mixed Integer Optimization:Fundamentals and Applications, Oxford University Press, New York, NY, USA, 1995. · Zbl 0886.90106
[76] A. M. Geoffrion, “Generalized Benders decomposition,” Journal of Optimization Theory and Applications, vol. 10, pp. 237-260, 1972. · Zbl 0229.90024
[77] S. Leyffer, “Integrating SQP and branch-and-bound for mixed integer nonlinear programming,” Computational Optimization and Applications, vol. 18, no. 3, pp. 295-309, 2001. · Zbl 1009.90074
[78] S. Lee and I. E. Grossmann, “New algorithms for nonlinear generalized disjunctive programming,” Computers and Chemical Engineering, vol. 24, no. 9-10, pp. 2125-2142, 2000.
[79] I. Quesada and I. E. Grossmann, “An LP/NLP based branch and bound algorithm for convex MINLP optimization problems,” Computers and Chemical Engineering, vol. 16, no. 10-11, pp. 937-947, 1992.
[80] R. A. Stubbs and S. Mehrotra, “A branch-and-cut method for 0-1 mixed convex programming,” Mathematical Programming A, vol. 86, no. 3, pp. 515-532, 1999. · Zbl 0946.90054
[81] T. Westerlund and F. Pettersson, “An extended cutting plane method for solving convex MINLP problems,” Computers and Chemical Engineering, vol. 19, no. 1, supplement, pp. S131-S136, 1995.
[82] C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier, “A global optimization method, \alpha BB, for general twice-differentiable constrained NLPs-I. Theoretical advances,” Computers and Chemical Engineering, vol. 22, no. 9, pp. 1137-1158, 1998.
[83] C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, “A global optimization method, \alpha BB, for general twice-differentiabe constrained NLPs-II. Implementation and computational results,” Computers and Chemical Engineering, vol. 22, no. 9, pp. 1159-1179, 1998.
[84] M. Tawarmalani and N. V. Sahinidis, “Semidefinite relaxations of fractional programs via novel convexification techniques,” Journal of Global Optimization, vol. 20, no. 2, pp. 137-158, 2001. · Zbl 1001.90064
[85] H. S. Ryoo and N. V. Sahinidis, “Analysis of bounds for multilinear functions,” Journal of Global Optimization, vol. 19, no. 4, pp. 403-424, 2001. · Zbl 0982.90054
[86] M. Tawarmalani, S. Ahmed, and N. V. Sahinidis, “Product disaggregation in global optimization and relaxations of rational programs,” Optimization and Engineering, vol. 3, no. 3, pp. 281-303, 2002. · Zbl 1035.90064
[87] M. Tawarmalani, S. Ahmed, and N. V. Sahinidis, “Global optimization of 0-1 hyperbolic programs,” Journal of Global Optimization, vol. 24, no. 4, pp. 385-416, 2002. · Zbl 1046.90054
[88] L. Liberti and C. C. Pantelides, “Convex envelopes of monomials of odd degree,” Journal of Global Optimization, vol. 25, no. 2, pp. 157-168, 2003. · Zbl 1030.90117
[89] C. A. Meyer and C. A. Floudas, “Trilinear Monomials with Positive or Negative Domains: Facets of Convex and Concave Envelopes,” in Frontiers in global optimization, C. A. Floudas and P. M. Pardalos, Eds., pp. 327-352, Kluwer Academic Publishers, Santorini, Greece, 2003. · Zbl 1176.90469
[90] C. A. Meyer and C. A. Floudas, “Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes,” Journal of Global Optimization, vol. 29, no. 2, pp. 125-155, 2004. · Zbl 1085.90047
[91] F. Tardella, “On the existence of polyhedral convex envelopes,” in Frontiers in Global Optimization, C. A. Floudas and P. M. Pardalos, Eds., pp. 563-573, Kluwer Academic Publishers, Santorini, Greece, 2003. · Zbl 1176.90473
[92] C. A. Meyer and C. A. Floudas, “Convex envelopes for edge-concave functions,” Mathematical Programming B, vol. 103, no. 2, pp. 207-224, 2005. · Zbl 1099.90045
[93] S. Caratzoulas and C. A. Floudas, “Trigonometric convex underestimator for the base functions in Fourier space,” Journal of Optimization Theory and Applications, vol. 124, no. 2, pp. 339-362, 2005. · Zbl 1066.90089
[94] I. G. Akrotirianakis and C. A. Floudas, “Computational experience with a new class of convex underestimators: box-constrained NLP problems,” Journal of Global Optimization, vol. 29, no. 3, pp. 249-264, 2004. · Zbl 1133.90420
[95] I. G. Akrotirianakis and C. A. Floudas, “A new class of improved convex underestimators for twice continuously differentiable constrained NLPs,” Journal of Global Optimization, vol. 30, no. 4, pp. 367-390, 2004. · Zbl 1082.90090
[96] A. S. E. Hamed, Calculation of bounds on variables and underestimating convex functions for nonconvex functions, Ph.D. thesis, The George Washington University, 1991.
[97] H. L. Li, J. F. Tsai, and C. A. Floudas, “Convex underestimation for posynomial functions of positive variables,” Optimization Letters, vol. 2, no. 3, pp. 333-340, 2008. · Zbl 1152.90610
[98] H. C. Lu, H. L. Li, C. E. Gounaris, and C. A. Floudas, “Convex relaxation for solving posynomial programs,” Journal of Global Optimization, vol. 46, no. 1, pp. 147-154, 2010. · Zbl 1181.90225
[99] A. Aggarwal and C. A. Floudas, “Synthesis of general distillation sequences-nonsharp separations,” Computers and Chemical Engineering, vol. 14, no. 6, pp. 631-653, 1990.
[100] A. R. Ciric and C. A. Floudas, “A retrofit approach for heat exchanger networks,” Computers and Chemical Engineering, vol. 13, no. 6, pp. 703-715, 1989.
[101] A. C. Kokossis and C. A. Floudas, “Optimization of complex reactor networks-II. Nonisothermal operation,” Chemical Engineering Science, vol. 49, no. 7, pp. 1037-1051, 1994.
[102] L. T. Biegler and I. E. Grossmann, “Retrospective on optimization,” Computers and Chemical Engineering, vol. 28, no. 8, pp. 1169-1192, 2004.
[103] I. E. Grossmann, “Review of nonlinear mixed-integer and disjunctive programming techniques,” Optimization and Engineering, vol. 3, no. 3, pp. 227-252, 2002. · Zbl 1035.90050
[104] I. E. Grossmann and L. T. Biegler, “Part II. Future perspective on optimization,” Computers and Chemical Engineering, vol. 28, no. 8, pp. 1193-1218, 2004.
[105] H. D. Sherali, W. P. Adams, and P. J. Driscoll, “Exploiting special structures in constructing a hierarchy of relaxations for mixed integer problems,” Operations Research, vol. 46, no. 3, pp. 396-405, 1998. · Zbl 0979.90090
[106] M. Sinha, L. E. K. Achenie, and G. M. Ostrovsky, “Environmentally benign solvent design by global optimization,” Computers and Chemical Engineering, vol. 23, no. 10, pp. 1381-1394, 1999.
[107] I. Harjunkoski, T. Westerlund, and R. Pörn, “Numerical and environmental considerations on a complex industrial mixed integer non-linear programming (MINLP) problem,” Computers and Chemical Engineering, vol. 23, no. 10, pp. 1545-1561, 1999.
[108] R. Pörn and T. Westerlund, “A cutting plane method for minimizing pseudo-convex functions in the mixed integer case,” Computers and Chemical Engineering, vol. 24, no. 12, pp. 2655-2665, 2000.
[109] G. Parthasarathy and M. M. El-Halwagi, “Optimum mass integration strategies for condensation and allocation of multicomponent VOCs,” Chemical Engineering Science, vol. 55, no. 5, pp. 881-895, 2000.
[110] C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, “Global optimization of MINLP problems in process synthesis and design,” Computers and Chemical Engineering, vol. 21, no. 1, pp. S445-S450, 1997.
[111] C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, “Global optimization of mixed-integer nonlinear problems,” AIChE Journal, vol. 46, no. 9, pp. 1769-1797, 2000.
[112] K. M. Björk and T. Westerlund, “Global optimization of heat exchanger network synthesis problems with and without the isothermal mixing assumption,” Computers and Chemical Engineering, vol. 26, no. 11, pp. 1581-1593, 2002.
[113] G. M. Ostrovsky, L. E. K. Achenie, and M. Sinha, “On the solution of mixed-integer nonlinear programming models for computer aided molecular design,” Computers and Chemistry, vol. 26, no. 6, pp. 645-660, 2002.
[114] M. Tawarmalani and N. V. Sahinidis, “Global optimization of mixed-integer nonlinear programs: a theoretical and computational study,” Mathematical Programming. A, vol. 99, no. 3, pp. 563-591, 2004. · Zbl 1062.90041
[115] P. Kesavan, R. J. Allgor, E. P. Gatzke, and P. I. Barton, “Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs,” Mathematical Programming A, vol. 100, no. 3, pp. 517-535, 2004. · Zbl 1136.90024
[116] S. Emet and T. Westerlund, “Comparisons of solving a chromatographic separation problem using MINLP methods,” Computers and Chemical Engineering, vol. 28, no. 5, pp. 673-682, 2004.
[117] J. Kallrath, “Solving planning and design problems in the process industry using mixed integer and global optimization,” Annals of Operations Research, vol. 140, pp. 339-373, 2005. · Zbl 1091.90089
[118] M. Tawarmalani and N. V. Sahinidis, “A polyhedral branch-and-cut approach to global optimization,” Mathematical Programming. B, vol. 103, no. 2, pp. 225-249, 2005. · Zbl 1099.90047
[119] C. A. Meyer and C. A. Floudas, “Global optimization of a combinatorially complex generalized pooling problem,” AIChE Journal, vol. 52, no. 3, pp. 1027-1037, 2006.
[120] R. Karuppiah and I. E. Grossmann, “Global optimization for the synthesis of integrated water systems in chemical processes,” Computers and Chemical Engineering, vol. 30, no. 4, pp. 650-673, 2006.
[121] M. L. Bergamini, N. J. Scenna, and P. A. Aguirre, “Global optimal structures of heat exchanger networks by piecewise relaxation,” Industrial and Engineering Chemistry Research, vol. 46, no. 6, pp. 1752-1763, 2007.
[122] R. Karuppiah, K. C. Furman, and I. E. Grossmann, “Global optimization for scheduling refinery crude oil operations,” Computers and Chemical Engineering, vol. 32, no. 11, pp. 2745-2766, 2008.
[123] P. T. Foteinou, E. Yang, G. K. Saharidis, M. G. Ierapetritou, and I. P. Androulakis, “A mixed-integer optimization framework for the synthesis and analysis of regulatory networks,” Journal of Global Optimization, vol. 43, no. 2-3, pp. 263-276, 2009. · Zbl 1279.90119
[124] R. Misener, C. E. Gounaris, and C. A. Floudas, “Mathematical modeling and global optimization of large-scale extended pooling problems with the (EPA) complex emissions constraints,” Computers and Chemical Engineering, vol. 34, no. 9, pp. 1432-1456, 2010.
[125] R. Misener, J. P. Thompson, and C. A. Floudas, “Apogee: global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes,” Computers and Chemical Engineering, vol. 35, no. 5, pp. 876-892, 2011.
[126] T. Westerlund, A. Lundelf, and J. Westerlund, “On convex relaxations in nonconvex optimization,” Chemical Engineering Transactions, vol. 24, pp. 331-336, 2011.
[127] E. Balas and R. Jeroslow, “Canonical cuts on the unit hypercube,” SIAM Journal on Applied Mathematics, vol. 23, pp. 61-69, 1972. · Zbl 0237.52004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.