Solution of separation network synthesis problems by the P-graph methodology

István Heckl, Ferenc Friedler, L. T. Fan

Research output: Chapter

2 Citations (Scopus)

Abstract

The current work demonstrates that separation-network synthesis (SNS) problems can be transformed into process-network synthesis (PNS) problems: The SNS problems constitute a particular class of PNS problems. Thus, the transformed SNS problems are solvable by resorting to the P-graph methodology originally introduced for the PNS problems. The methodology has been unequivocally proven to be inordinately effective.,.

Original languageEnglish
Title of host publication19th European Symposium on Computer Aided Process Engineering
EditorsJacek Jezowski, Jan Thullie
Pages641-646
Number of pages6
DOIs
Publication statusPublished - jún. 26 2009

Publication series

NameComputer Aided Chemical Engineering
Volume26
ISSN (Print)1570-7946

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this

Heckl, I., Friedler, F., & Fan, L. T. (2009). Solution of separation network synthesis problems by the P-graph methodology. In J. Jezowski, & J. Thullie (Eds.), 19th European Symposium on Computer Aided Process Engineering (pp. 641-646). (Computer Aided Chemical Engineering; Vol. 26). https://doi.org/10.1016/S1570-7946(09)70107-5