Logic-based modeling and solution of nonlinear discrete/continuous optimization problems

Annals of Operations Research

Volumn 139, Issue 1, 2005, Pages 267-288

  Lee, Sangbum ^a   Grossmann, Ignacio E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Generalized disjunctive programming; Global optimization; Logic based programming; Mixed integer programming

Indexed keywords

EID: 25444451843     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-3451-0     Document Type: Article

References (58)

1. Adjiman, C.S., I.P. Androulakis, C.D. Maranas, and C. A. Floudas. (1996). "A Global Optimization Method, α BB, for Process Design." Computers and Chem. Engng. 20, (Suppl.), S419-S424.
2. Adjiman, C.S., I.P. Androulakis, and C.A. Floudas. (1997). "Global Optimization of MINLP Problems in Process Synthesis and Design." Computers and Chem. Engng. 21, (Suppl.), S445-S450.
3. Adjiman, C.S., I.P. Androulakis, and C.A. Floudas. (2000). "Global Optimization of Mixed-Integer Nonlinear Problems." AIChE Journal 46(9), 1769-1797.
4. Balas, E. (1965). "An Additive Algorithm for Solving Linear Programs with Zero-One Variables." Operations Research 13, 517-546.
5. Balas, E. (1979). "Disjunctive Programming ." Annals of Discrete Mathematics 5, 3-51.
6. Balas, E. (1985). "Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems." SIAM J. Alg. Disc. Meth. 6, 466-486.
7. Balas, E., S. Ceria, and G. Cornuejols. (1993). "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs." Mathematical Programming 58, 295-324.
8. Beaumont, N. (1991). "An Algorithm for Disjunctive Programs." European Journal of Operations Research 48, 362-371.
9. Benders, J.F. (1962). "Partitioning Procedures for Solving Mixed Variables Programming Problems." Numerische Mathematik 4, 238-252.
10. Borchers, B. and J.E. Mitchell. (1994). "An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programming." Computers and Operations Research 21, 359-367.
11. Ceria, S. and J. Soares. (1999). "Convex Programming for Disjunctive Optimization," Mathematical Programming 86(3), 595-614.
12. Crowder, H.P., E.L. Johnson, and M. W. Padberg. (1983) "Solving Large-Scale Zero-One Linear Programming Problems." Operations Research 31, 803-834.
13. Dakin, R.J. (1965). "A Tree Search Algorithm for Mixed Integer Programming Problems." Computer Journal 8, 250-255.
14. Duran, M.A. and I.E. Grossmann. (1986). "An Outer-Approximation Algorithm for a Class of Mixed-Integer Nonlinear Programs." Mathematical Programming 36, 307-339.
15. Fletcher, R. and S. Leyffer. (1994). "Solving Mixed Nonlinear Programs by Outer Approximation." Mathematical Programming 66(3), 327-349.
16. Geoffrion, A.M. (1972). "Generalized Benders Decomposition." Journal of Optimization Theory and Application 10(4), 237-260.
17. Gomory, R.E. (1958). "Outline of an Algorithm for Integer Solutions to Linear Programs." Bulletin of the American Mathematics Society 64, 275-278.
18. Grossmann, I.E. (2002). "Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques for Process Systems Engineering." Journal of Optimization and Engineering (submitted to) 2002.
19. Grossmann, I.E., J.P. Caballero, and H. Yeomans. (1999). "Mathematical Programming Approaches to the Synthesis of Chemical Process Systems." Korean Journal of Chemical Engineering 16(4), 407-426.
20. Grossmann, I.E. and S. Lee. (2003). "Generalized Disjunctive Programming: Nonlinear Convex Hull Relaxation and Algorithms." Computational Optimization and Applications 26, 83-100.
21. Gupta, O.K. and V. Ravindran. (1985). "Branch and Bound Experiments in Convex Nonlinear Integer Programming." Management Science 31(12), 1533-1546.
22. Hentenryck, P.V. (1989). Constraint Satisfaction in Logic Programming. Cambridge, MA: MIT Press.
23. Hiriart-Urruty, J. and C. Lemaréchal. (1993). Convex Analysis and Minimization Algorithms. Berlin, New York: Springer-Verlag.
24. Hooker, J.N. (2000). Logic-Based Methods for Optimization. John Wiley & Sons.
25. Hooker, J.N. and M.A. Osorio. (1999). "Mixed logical/linear programming." Discrete Applied Mathematics 96-97(1-3), 395-442.
26. Horst R. and H. Tuy (1996) Global Optimization: Deterministic Approaches, 3rd ed. Springer-Verlag, Berlin.
27. Johnson, E.L., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). "Progress in Linear Programming Based Branch-and-Bound Algorithms: An Exposition." INFORMS Journal on Computing 12.
28. Kallrath, J. (2000)."Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future." Trans. I. Chem. E. 78 (Part A), 809-822.
29. Kesavan, P., R.J. Allgor, E.P. Gatzke, and P.I. Barton. (2004). "Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs." Mathematical Programming 100, 517-535.
30. Kesavan, P. and P.I. Barton. (2000). "Generalized Branch-and-Cut Framework for Mixed-Integer Nonlinear Optimization Problems." Computers Chem. Engng. 24, 1361-1366.
31. Kelley, Jr. J.E. (1960). "The Cutting-Plane Method for Solving Convex Programs." Journal of SIAM 8, 703.
32. Kocis, G.R. and I.E. Grossmann. (1987). "Relaxation Strategy for the Structural Optimization of Process Flowsheets." Ind. Eng. Chem. Res. 26, 1869.
33. Kocis, G.R. and I.E. Grossmann. (1989). "A Modelling and Decomposition Strategy for the MINLP Optimization of Process Flowsheets." Computers and Chem. Engng. 13(7), 797-819.
34. Land, A.H. and A.G. Doig. (1960). "An Automatic Method for Solving Discrete Programming Problems." Econometrica 28, 497-520.
35. Lee, S. and I.E. Grossmann. (2000). "New Algorithms for Nonlinear Generalized Disjunctive Programming." Computers Chem. Engng. 24, 2125-2141.
36. Lee, S. and I.E. Grossmann. (2001). "A Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems." Computers Chem. Engng. 25, 1675-1697.
37. Leyffer, S. (2001). "Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming." Computational Optimization and Applications 18, 295-309.
38. Lovász, L. and A. Schrijver. (1991). "Cones of Matrices and Set-Functions and 0-1 Optimization." SIAM Journal on Optimization 12, 166-190.
39. McCormick, G.P. (1976)."Computability of Global Solutions to Factorable Nonconvex Programs: Part I -Convex Underestimating Problems." Mathematical Programming 10, 147-175.
40. Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization. New York: Wiley-Interscience.
41. Quesada, I. and I.E. Grossmann. (1992). "An LP/NLP Based Branch and Bound Algorithm for Convex MINLP Optimization Problems. Computers Chem. Engng. 16(10/11), 937-947.
42. Quesada, I. and I.E. Grossmann. (1995). "A Global Optimization Algorithm for Linear Fractional and Bilinear Programs." Journal of Global Optimization 6(1), 39-76.
43. Raman, R. and I.E. Grossmann. (1991). "Relation Between MILP Modelling and Logical Inference for Chemical Process Synthesis." Computers Chem. Engng. 15(2), 73-84.
44. Raman, R. and I.E. Grossmann. (1994). "Modelling and Computational Techniques for Logic Based Integer Programming." Computers Chem. Engng. 18(7), 563-578.
45. Ryoo, H.S. and N.V. Sahinidis. (1995). "Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design." Computers and Chem. Engng. 19(5), 551-566.
46. Sawaya, N.W. and I.E. Grossmann. (2005). "A Cutting Plane Method for Solving Linear Generalized Disjunctive Programming Problems." Computers Chem. Engng (to appear).
47. Sawaya, N.W. and I.E. Grossmann. (2005). "Computational Implementation of Non-Linear Convex Hull Reformulation." Submitted for publication Computers Chem. Engng.
48. Sherali, H.D. and W.P. Adams. (1990). "A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems." SIAM Journal on Discrete Mathematics 3(3), 411-430.
49. Smith, E.M.B. and C.C. Pantelides. (1997). "Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design." Computers Chem. Engng. 21(1001), S791-S796.
50. Stubbs, R. and S. Mehrotra. (1999)."A Branch-and-Cut Method for 0-1 Mixed Convex Programming." Mathematical Programming 86(3), 515-532.
51. Türkay, M. and I.E. Grossmann. (1996). "Logic-based MINLP Algorithms for the Optimal Synthesis of Process Networks." Computers Chem. Engng. 20(8), 959-978.
52. Van Roy, T.J. and L.A. Wolsey. (1986). "Valid Inequalities for Mixed 0-1 Programs." Discrete Applied Mathematics 14, 199-213.
53. Vecchietti, A. and I.E. Grossmann. (1999). "LOGMIP: A Disjunctive 0-1 Nonlinear Optimizer for Process Systems Models." Computers Chem. Engng. 23, 555-565.
54. Viswanathan, J. and I.E. Grossmann. (1990). "A Combined Penalty Function and Outer-Approximation Method for MINLP Optimization." Computers Chem. Engng. 14, 769.
55. Yuan, X, S. Zhang, L. Piboleau, and S. Domenech. (1988). "Une Methode d' optimization Nonlineare en Variables Mixtes pour la Conception de Porcedes." Rairo Recherche. Operationnele. 22, 331.
56. Westerlund, T. and F. Pettersson. (1995). "An Extended Cutting Plane Method for Solving Convex MINLP Problems." Computers Chem. Engng. 19(supl.), S131-S136.
57. Williams, H.P. (1985). Mathematical Building in Mathematical Programming. Chichester; John Wiley.
58. Zamora, J.M. and I.E. Grossmann. (1999). "A Branch and Bound Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms." Journal of Global Optimization 14(3), 217-249.