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

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

Research output: Chapter in Book/Report/Conference proceedingChapter

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 publicationComputer Aided Chemical Engineering
Pages641-646
Number of pages6
Volume26
DOIs
Publication statusPublished - 2009

Publication series

NameComputer Aided Chemical Engineering
Volume26
ISSN (Print)15707946

Keywords

  • mathematical modeling
  • optimization
  • P-graphs
  • process-network synthesis
  • separation-network synthesis

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 Computer Aided Chemical Engineering (Vol. 26, pp. 641-646). (Computer Aided Chemical Engineering; Vol. 26). https://doi.org/10.1016/S1570-7946(09)70107-5

Solution of separation network synthesis problems by the P-graph methodology. / Heckl, István; Friedler, F.; Fan, L. T.

Computer Aided Chemical Engineering. Vol. 26 2009. p. 641-646 (Computer Aided Chemical Engineering; Vol. 26).

Research output: Chapter in Book/Report/Conference proceedingChapter

Heckl, I, Friedler, F & Fan, LT 2009, Solution of separation network synthesis problems by the P-graph methodology. in Computer Aided Chemical Engineering. vol. 26, Computer Aided Chemical Engineering, vol. 26, pp. 641-646. https://doi.org/10.1016/S1570-7946(09)70107-5
Heckl I, Friedler F, Fan LT. Solution of separation network synthesis problems by the P-graph methodology. In Computer Aided Chemical Engineering. Vol. 26. 2009. p. 641-646. (Computer Aided Chemical Engineering). https://doi.org/10.1016/S1570-7946(09)70107-5
Heckl, István ; Friedler, F. ; Fan, L. T. / Solution of separation network synthesis problems by the P-graph methodology. Computer Aided Chemical Engineering. Vol. 26 2009. pp. 641-646 (Computer Aided Chemical Engineering).
@inbook{ce6de2f997b5483492e2c32543d74898,
title = "Solution of separation network synthesis problems by the P-graph methodology",
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.,.",
keywords = "mathematical modeling, optimization, P-graphs, process-network synthesis, separation-network synthesis",
author = "Istv{\'a}n Heckl and F. Friedler and Fan, {L. T.}",
year = "2009",
doi = "10.1016/S1570-7946(09)70107-5",
language = "English",
isbn = "9780444534330",
volume = "26",
series = "Computer Aided Chemical Engineering",
pages = "641--646",
booktitle = "Computer Aided Chemical Engineering",

}

TY - CHAP

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

AU - Heckl, István

AU - Friedler, F.

AU - Fan, L. T.

PY - 2009

Y1 - 2009

N2 - 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.,.

AB - 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.,.

KW - mathematical modeling

KW - optimization

KW - P-graphs

KW - process-network synthesis

KW - separation-network synthesis

UR - http://www.scopus.com/inward/record.url?scp=67649119871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649119871&partnerID=8YFLogxK

U2 - 10.1016/S1570-7946(09)70107-5

DO - 10.1016/S1570-7946(09)70107-5

M3 - Chapter

SN - 9780444534330

VL - 26

T3 - Computer Aided Chemical Engineering

SP - 641

EP - 646

BT - Computer Aided Chemical Engineering

ER -