A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

Journal of Global Optimization

Volumn 41, Issue 2, 2008, Pages 163-186

  Grossmann, Ignacio E ^a   Karuppiah, Ramkumar ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cuts; Global optimization; Lagrangean decomposition; Two stage stochastic programming

Indexed keywords

GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; PROBLEM SOLVING; STOCHASTIC PROGRAMMING;

DECOMPOSABLE STRUCTURES; GLOBAL OPTIMIZATION ALGORITHMS; LAGRANGEAN DECOMPOSITION; TWO-STAGE STOCHASTIC PROGRAMMING;

ALGORITHMS;

EID: 43149093360     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-007-9203-8     Document Type: Article

References (46)

1. Adhya N., Tawarmalani M. and Sahinidis N.V. (1999). A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38: 1956-1972
2. Adjiman C.S., Androulakis I.P. and Floudas C.A. (1997). Global optimization of MINLP problems in process synthesis and design. Comp. Chem. Eng. 21: S445-S450
3. Adjiman C.S., Androulakis I.P. and Floudas C.A. (2000). Global optimization of mixed-integer nonlinear problems. Am. Inst. Chem. Eng. J. 46(9): 1769-1797
4. Balas E. and Jeroslow R. (1972). Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23: 61-79
5. Bergamini M.L., Aguirre P. and Grossmann I.E. (2005). Logic-based outer approximation for globally optimal synthesis of process networks. Comp. Chem. Eng. 29: 1914-1933
6. Biegler L.T. and Grossmann I.E. (2004). Retrospective on optimization. Comp. Chem. Eng. 28: 1169-1192
7. Birge J.R. and Louveaux F.V. (1997). Introduction to Stochastic Programming. Springer, New York
8. Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: GAMS: A user's guide, release 2.50. GAMS Development Corporation (1998)
9. Carøe C.C. and Schultz R. (1999). Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24: 37-45
10. Chachuat B., Singer A.B. and Barton P.I. (2005). Global mixed-integer dynamic optimization. AICHE J. 51(8): 2235-2253
11. Duran M.A. and Grossmann I.E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36: 307-339
12. Fisher M.L. (1981). The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27(1): 1-18
13. Fisher M.L. (1985). An applications oriented guide to Lagrangian relaxation. Interfaces 15(2): 10-21
14. Fletcher R. and Leyffer S. (1994). Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66: 327-349
15. Floudas C.A. (2000). Deterministic Global Optimization: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands
16. Floudas C.A., Akrotirianakis I.G., Caratzoulas S., Meyer C.A. and Kallrath J. (2005). Global optimization in the 21st century: advances and challenges. Comp. Chem. Eng. 29: 1185-1202
17. Grossmann I.E. (2002). Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3: 227-252
18. Guignard M. and Kim S. (1987). Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Program. 39: 215-228
19. Gupta A. and Maranas C.D. (1999). A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Ind. Eng. Chem. Res. 38: 1937-1947
20. Horst R. and Tuy H. (1996). Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin
21. Jackson J.R. and Grossmann I.E. (2003). Temporal decomposition scheme for nonlinear multisite production planning and distribution models. Ind. Eng. Chem. Res. 42: 3045-3055
22. Jornsten, K.O., Nasberg, M., Smeds, P.A.: Variable Splitting - A New Lagrangean Relaxation Approach to some Mathematical Programming Models. Department of Mathematics Report LiTH-MAT-R-85-04, Linkoping Institute of Technology, Sweden (1985)
23. Karuppiah, R., Grossmann, I.E.: Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty. Comp. Chem. Eng. (2007, in press)
24. Karuppiah, R., Furman, K.C., Grossmann, I.E.: Global optimization for scheduling refinery crude oil operations. Comp. Chem. Eng. (2007, submitted)
25. Kesavan P., Allgor R.J., Gatzke E.P. and Barton P.I. (2004). Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. Math. Program. 100: 517-535
26. Kiwiel, K.C.: User's Guide for NOA 2.0/3.0: A Fortran Package for Convex Nondifferentiable Optimization. Polish Academy of Sciences, Systems Research Institute, Warsaw, Poland (1993/1994)
27. Kuno T. and Utsunomiya T. (2000). A Lagrangian based branch-and-bound algorithm for production-transportation problems. J. Global Optim. 18: 59-73
28. Lee S. and Grossmann I.E. (2001). A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Comp. Chem. Eng. 25: 1675-1697
29. Maranas C.D. and Floudas C.A. (1994). Global minimum potential energy conformation of small molecules. J. Global Optim. 4: 135-170
30. McCormick G.P. (1976). Computability of global solutions to factorable nonconvex programs - part I - convex underestimating problems. Math. Program. 10: 146-175
31. Meyer C.A., Floudas C.A. and Neumaier A. (2002). Global optimization with nonfactorable constraints. Ind. Eng. Chem. Res. 41: 6413-6424
32. Norkin V.I., Pflug G.Ch. and Ruszczynski A. (1998). A branch and bound method for stochastic global optimization. Math. Program. 83: 425-450
33. Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. In: Iserles, A. (ed.) Acta Numerica 2004. Cambridge University Press, Cambridge (2004)
34. Papamichail I. and Adjiman C.S. (2004). Global optimization of dynamic systems. Comp. Chem. Eng. 28: 403-415
35. Pörn R. and Westerlund T. (2000). A cutting plane method for minimizing pseudo-convex functions in the mixed integer case. Comp. Chem. Eng. 24: 2655-2665
36. Quesada I. and Grossmann I.E. (1995). A global optimization algorithm for linear fractional and bilinear programs. J. Global Optim. 6: 39-76
37. Ryoo H.S. and Sahinidis N. (1995). Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comp. Chem. Eng. 19(5): 551-556
38. Sahinidis N. (1996). BARON: a general purpose global optimization software package. J. Global Optim. 8(2): 201-205
39. Sherali H.D. and Alameddine A. (1992). A new reformulation linearization technique for bilinear programming problems. J. Global Optim. 2: 379-410
40. Takriti S., Birge J.R. and Long E. (1996). A stochastic model of the unit commitment problem. IEEE Trans. Power Syst. 11: 1497-1508
41. Tawarmalani M. and Sahinidis N. (2002). Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands
42. Tawarmalani M. and Sahinidis N. (2004). Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3): 563-591
43. Grossmann I.E., Vasantharajan S., Edwards K. and Heever S.A. (2001). A Lagrangean decomposition heuristic for the design and planning of offshore hydrocarbon field infrastructures with complex economic objectives. Ind. Eng. Chem. Res. 40: 2857-2875
44. Westerberg A.W. and Shah J.V. (1978). Assuring a global optimum by the use of an upper bound on the lower (dual) bound. Comp. Chem. Eng. 2: 83-92
45. Zamora J.M. and Grossmann I.E. (1999). A branch and bound algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14(3): 217-249
46. Zhu Y. and Kuno T. (2005). A global optimization method, QBB, for twice-differentiable nonconvex optimization problem. J. Global Optim. 33: 435-464