Optimal decomposition of process networks

The tearing or decomposition of recycle process networks is extended to include the enumeration of alternate cut sets or tear stream sets. The optimality criterion is the response to convergence acceleration in the quasi‐Newton sense and an algorithm is proposed to select the optimum cut set adaptiv...

Full description

Saved in:
Bibliographic Details
Published in:AIChE journal 1975-07, Vol.21 (4), p.656-663
Main Authors: Genna, Peter L., Motard, R. L.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863
cites cdi_FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863
container_end_page 663
container_issue 4
container_start_page 656
container_title AIChE journal
container_volume 21
creator Genna, Peter L.
Motard, R. L.
description The tearing or decomposition of recycle process networks is extended to include the enumeration of alternate cut sets or tear stream sets. The optimality criterion is the response to convergence acceleration in the quasi‐Newton sense and an algorithm is proposed to select the optimum cut set adaptively as the recycle computation proceeds.
doi_str_mv 10.1002/aic.690210403
format article
fullrecord <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_aic_690210403</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>AIC690210403</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863</originalsourceid><addsrcrecordid>eNp9j01Lw0AQhhdRsFaP3nP1kDr7lckeS9VaqO2l0OOynWwg9mPDbqD23xtpEU-ehhmed2Yexh45jDiAeHYNjQoDgoMCecUGXCvMtQF9zQYAwPN-wG_ZXUqffSewFAP2tGy7Zu92WeUp7NuQmq4JhyzUWRsD-ZSyg--OIW7TPbup3S75h0sdstXb62ryns-X09lkPM9JapS5cpXU0sGGqqoEKFH5grxTskLBqSYqNkZjaRCdIFWQcuVGGFKIkkRZyCHLz2sphpSir20b-wfjyXKwP5q217S_mj2PZ_7Y7Pzpf9iOZ5O_yculJnX-6zfp4tYWKFHb9WJqX8x6beYfC2vkN-BFZGs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal decomposition of process networks</title><source>Wiley-Blackwell Journals (Backfile Content)</source><creator>Genna, Peter L. ; Motard, R. L.</creator><creatorcontrib>Genna, Peter L. ; Motard, R. L.</creatorcontrib><description>The tearing or decomposition of recycle process networks is extended to include the enumeration of alternate cut sets or tear stream sets. The optimality criterion is the response to convergence acceleration in the quasi‐Newton sense and an algorithm is proposed to select the optimum cut set adaptively as the recycle computation proceeds.</description><identifier>ISSN: 0001-1541</identifier><identifier>EISSN: 1547-5905</identifier><identifier>DOI: 10.1002/aic.690210403</identifier><language>eng</language><publisher>New York: American Institute of Chemical Engineers</publisher><ispartof>AIChE journal, 1975-07, Vol.21 (4), p.656-663</ispartof><rights>Copyright © 1975 American Institute of Chemical Engineers</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863</citedby><cites>FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Faic.690210403$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Faic.690210403$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1410,27901,27902,46024,46448</link.rule.ids></links><search><creatorcontrib>Genna, Peter L.</creatorcontrib><creatorcontrib>Motard, R. L.</creatorcontrib><title>Optimal decomposition of process networks</title><title>AIChE journal</title><addtitle>AIChE J</addtitle><description>The tearing or decomposition of recycle process networks is extended to include the enumeration of alternate cut sets or tear stream sets. The optimality criterion is the response to convergence acceleration in the quasi‐Newton sense and an algorithm is proposed to select the optimum cut set adaptively as the recycle computation proceeds.</description><issn>0001-1541</issn><issn>1547-5905</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1975</creationdate><recordtype>article</recordtype><recordid>eNp9j01Lw0AQhhdRsFaP3nP1kDr7lckeS9VaqO2l0OOynWwg9mPDbqD23xtpEU-ehhmed2Yexh45jDiAeHYNjQoDgoMCecUGXCvMtQF9zQYAwPN-wG_ZXUqffSewFAP2tGy7Zu92WeUp7NuQmq4JhyzUWRsD-ZSyg--OIW7TPbup3S75h0sdstXb62ryns-X09lkPM9JapS5cpXU0sGGqqoEKFH5grxTskLBqSYqNkZjaRCdIFWQcuVGGFKIkkRZyCHLz2sphpSir20b-wfjyXKwP5q217S_mj2PZ_7Y7Pzpf9iOZ5O_yculJnX-6zfp4tYWKFHb9WJqX8x6beYfC2vkN-BFZGs</recordid><startdate>197507</startdate><enddate>197507</enddate><creator>Genna, Peter L.</creator><creator>Motard, R. L.</creator><general>American Institute of Chemical Engineers</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>197507</creationdate><title>Optimal decomposition of process networks</title><author>Genna, Peter L. ; Motard, R. L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1975</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Genna, Peter L.</creatorcontrib><creatorcontrib>Motard, R. L.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>AIChE journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Genna, Peter L.</au><au>Motard, R. L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal decomposition of process networks</atitle><jtitle>AIChE journal</jtitle><addtitle>AIChE J</addtitle><date>1975-07</date><risdate>1975</risdate><volume>21</volume><issue>4</issue><spage>656</spage><epage>663</epage><pages>656-663</pages><issn>0001-1541</issn><eissn>1547-5905</eissn><abstract>The tearing or decomposition of recycle process networks is extended to include the enumeration of alternate cut sets or tear stream sets. The optimality criterion is the response to convergence acceleration in the quasi‐Newton sense and an algorithm is proposed to select the optimum cut set adaptively as the recycle computation proceeds.</abstract><cop>New York</cop><pub>American Institute of Chemical Engineers</pub><doi>10.1002/aic.690210403</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0001-1541
ispartof AIChE journal, 1975-07, Vol.21 (4), p.656-663
issn 0001-1541
1547-5905
language eng
recordid cdi_crossref_primary_10_1002_aic_690210403
source Wiley-Blackwell Journals (Backfile Content)
title Optimal decomposition of process networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T06%3A53%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20decomposition%20of%20process%20networks&rft.jtitle=AIChE%20journal&rft.au=Genna,%20Peter%20L.&rft.date=1975-07&rft.volume=21&rft.issue=4&rft.spage=656&rft.epage=663&rft.pages=656-663&rft.issn=0001-1541&rft.eissn=1547-5905&rft_id=info:doi/10.1002/aic.690210403&rft_dat=%3Cwiley_cross%3EAIC690210403%3C/wiley_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c3573-4ad353a0bcdd800874e6cea43d721cfcc6b9578977a2c46c4a8b29c4773c2863%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true