Logic-Based Outer-Approximation and Benders Decomposition Algorithms for the Synthesis of Process Networks

  • Metin Türkay
  • Ignacio E. Grossmann
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 7)

Abstract

In this paper the MINLP problem for the optimal synthesis of process networks is modeled as a discrete optimization problem involving logic disjunctions with nonlinear equations and pure logic relations. The logic disjunctions allow the conditional modeling of equations. The outer approximation algorithm is used as a basis to derive a logic-based OA solution method which naturally gives rise to NLP subproblems that avoid zero flows and a disjunctive LP master problem. The NLP subproblems are selected through a set covering problem for which we consider both the cases of disjunctive and conjunctive normal form logic. The master problem, on the other hand, is converted to mixed-integer form using a convex-hull representation. Furthermore, based on some interesting relations of outer-approximation with Generalized Benders Decomposition it is also shown that it is possible to derive a logic-based method for the latter algorithm. The performance of the proposed algorithms illustrated with two process network problems.

Keywords

Hull Balas Mellon Kocis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas E. (1985), Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Meth., 6, 466–486.MathSciNetMATHCrossRefGoogle Scholar
  2. Beaumont N. (1990), An algorithm for disjunctive programs. European Journal of Operational Research, 48, 362–271.MATHCrossRefGoogle Scholar
  3. Benders J.F. (1982), Partitioning procedures for solving mixed-variables programming problems. Numeri. Math., 4, 238–252.MathSciNetCrossRefGoogle Scholar
  4. Duran M.A. and Grossmann I.E. (1986), An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36, 307–339.MathSciNetMATHCrossRefGoogle Scholar
  5. Geoffrion, A.M. (1972), Generalized Benders Decomposition. Journal of Optimization Theory and Applications, 10, 237–260.MathSciNetMATHCrossRefGoogle Scholar
  6. Grossmann I.E. and Daichendt M.M. (1994), New trends in optimization-based approaches to process synthesis. Proc. of PSE’94 ( Eds. Yoon E.S. ), 95–109.Google Scholar
  7. Kocis G.R. and Grossmann I.E. (1989), A modeling and decomposition strategy for the MINLP optimization of process flowsheets, Computers and Chem. Eng., 13, 797–819.CrossRefGoogle Scholar
  8. Nemhauser G.L. and Wolsey L. (1988), Integer and Combinatorial Optimization. Wiley, New York.MATHGoogle Scholar
  9. Raman R. and Grossmann I.E. (1993), Symbolic integration of logic in mixed integer linear programming techniques for process synthesis, Computers and Chem. Eng., 17, 909–927.CrossRefGoogle Scholar
  10. Raman R. and Grossmann I.E. (1994), Modeling and computational techniques for logic based integer programming, Computers and Chem. Eng., 18, 563–578.CrossRefGoogle Scholar
  11. Reklaitis G.V. (1991), Perspectives on Scheduling and Planning of Process Operations. Proc. of PSE’91, vol. IV, Montebello, Canada.Google Scholar
  12. Türkay M. and Grossmann I.E. (1994), Logic-based MINLP algorithms for the optimal synthesis of process networks. AIChE Annual Meeting, San Francisco, CA.Google Scholar
  13. Viswanathan J. and Grossmann I.E. (1990), A combined penalty function and outer- approximation method for MINLP optimization, Computers and Chem. Eng., 14, 769–782.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Metin Türkay
    • 1
  • Ignacio E. Grossmann
    • 1
  1. 1.Department of Chemical EngineeringCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations