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

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

Research output: Contribution to journalArticle

27 Citations (Scopus)


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
Pages (from-to)700-706
Number of pages7
JournalComputers and Chemical Engineering
Issue number5
Publication statusPublished - May 10 2010


  • Mathematical modeling
  • Optimization
  • P-graphs
  • Process-network synthesis
  • Separation-network synthesis

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this