Abstract
Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming model is tedious to solve because it usually involves a large number of binary variables. A structural model of PNS can be given on the basis of a combinatorial approach. An optimal solution of this model can conveniently be generated by a branch-and-bound method if an effective bounding procedure is available. In the present work, a sharp bounding function is given for solving PNS by a branch-and-bound method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blázsik, Z.and B. Imreh, Note on connection between PNS and set covering problems, Acta Cybernetica, to appear.
Floudas, C. A. and I. E. Grossmann, Algorithmic Approaches to Process Synthesis: Logic and Global Optimization, AIChE Symposium Series No. 304, 91 (Vol.: L. T. Biegler and M. F. Doherly), 198–221 (1995).
Friedler, F., L. T. Fan, and B. Imreh, Process Network Synthesis: Problem Definition, Networks, to appear.
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Combinatorial Structure of Process Network Synthesis, Sixth SIAM Conference on Discrete Mathematics, Vancouver, Canada, 1992.
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis: Axioms and Theorems, Chem. Eng. Sci., 47 (8), 1973–1988 (1992).
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis: Polynomial Algorithm for Maximal Structure Generation, Computers chem. Engng., 17, 929–942 (1993).
Friedler, F., J. B. Varga, E. Fehér, L. T. Fan, Combinatorially Accelerated Branch-and -Bound Method for Solving the MIP Model of Process Network Synthesis, presented at the International Conference on State of the Art in Global Optimization: Computational Methods and Applications, Princeton University, Princeton, NJ, U.S.A., April 28–30, 1995; also published in Nonconvex Optimization and its Applications (Eds: C. A. Floudas and P. M. Pardalos), pp. 609–626, Kluwer Academic Publishers, Norwell, MA, U.S.A., 1996.
Friedler, F., J. B. Varga, and L. T. Fan, Decision-Mappings: A Tool for Consistent and Complete Decisions in Process Synthesis, Chem. Eng. Sci., 50, 1755–1768 (1995).
Grossmann, I. E., V. T. Voudouris, O. Ghattas, Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems, In: Recent Advances in Global Optimization (Eds: C. A. Floudas and P. M. Pardalos) Princeton University Press, New Jersey, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Imreh, B., Friedler, F., Fan, L.T. (1997). An Algorithm for Improving the Bounding Procedure in Solving Process Network Synthesis by a Branch-and-Bound Method. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M. (eds) Developments in Global Optimization. Nonconvex Optimization and Its Applications, vol 18. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2600-8_19
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2600-8_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4768-0
Online ISBN: 978-1-4757-2600-8
eBook Packages: Springer Book Archive