Reduction constraints for the global optimization of NLPs

International Transactions in Operational Research

Volumn 11, Issue 1, 2004, Pages 33-41

  Liberti, Leo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Branch and bound; Global optimization; NLP; Valid cut

Indexed keywords

EID: 85040393756     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2004.00438.x     Document Type: Article

References (18)

1. Adhya, N., Tawarmalani, M., Sahinidis, N., 1999. A Lagrangian approach to the pooling problem. Industrial and Engineering Chemistry Research, 38, 1956-1972.
2. Adjiman, C.S., Androulakis, I.P., Floudas, C.A., 1998. A global optimization method, αBB, for general twice-differentiable constrained NLPs: II. Implementation and computational results. Computers & Chemical Engineering, 22, 9, 1159-1179.
3. Adjiman, C., Schweiger, C., Floudas, C., 1998. Mixed-integer nonlinear optimization in process synthesis. In:Du, D.-Z., Pardalos, P.E.(eds), Handbook of Combinatorial Optimization, vol. I, Kluwer Academic Publishers, Dordrecht, pp.1-6.
4. Adjiman, C., Dallwig, S., Floudas, C., Neumaier, A., 1998. A global optimization method, αBB, for general twice-differentiable constrained NLPs: I. Theoretical advances. Computers & Chemical Engineering, 22, 9, 1137-1158.
5. Al-Khayyal, F., Falk, J., 1983. Jointly constrained biconvex programming. Mathematics of Operations Research, 8, 2, 273-286.
6. Floudas, C., 2001. Global optimization in design and control of chemical process systems. Journal of Process Control, 10, 125-134.
7. Hägglöf, K., Lindberg, P., Svensson, L., 1995. Computing global minima to polynomial optimization problems using Gröbner bases. Journal of Global Optimization, 7, 2, 115-125.
8. Hirafuji, M., Hagan, >S., 2000. A global optimization algorithm based on the process of evolution in complex biological systems. Computers and Electronics in Agriculture, 29, 125-134.
9. Kesavan, P., Barton, P., 2000. Generalized branch-and-cut framework for mixed integer nonlinear optimization problems. Computers and Chemical Engineering, 24, 1361-1366.
10. Liberti, L., Pantelides, C., forthcoming. Tightest convex envelopes of monomials of odd degree. Journal of Global Optimization.
11. McCormick, G., 1976. Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems. Mathematical Programming, 10, 146-175.
12. Pardalos, P., Edwin Romeijin, H., Tuy, H., 2000. Recent development and trends in global optimization. Journal of Computational and Applied Mathematics, 124, 209-228.
13. Ryoo, H.S., Sahinidis, N.V., 1995. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers & Chemical Engineering, 19, 5, 551-566.
14. Sherali, H., Alameddine, A., 1992. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization, 2, 379-410.
15. Sherali, H., Wang, H., 2001. Global optimization of nonconvex factorable programming problems. Mathematical Programming, A89, 459-478.
16. Smith, E., 1996. On the Optimal Design of Continuous Processes. PhD thesis, Imperial College of Science, Technology and Medicine, University of London.
17. Smith, E., Pantelides, C., 1999. A symbolic reformulation/spatial Branch-and-Bound algorithm for the global optimisation of nonconvex MINLPs. Computers and Chemical Engineering, 23, 457-478.
18. Vaidyanathan, R., El-Halwagi, M., 1996. Global optimization of nonconvex MINLPs by interval analysis. In:Grossmann I.(ed.), Global Optimization in Engineering Design. Kluwer Academic Publishers, Dordrecht, pp.175-193.