Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems | Zendy

Pho T. K. | Zendy; Lapidus L. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems

Author(s) -

Pho T. K.,

Lapidus L.

Publication year - 1973

Publication title -

aiche journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.958

H-Index - 167

eISSN - 1547-5905

pISSN - 0001-1541

DOI - 10.1002/aic.690190614

Subject(s) - tearing , reduction (mathematics) , signal flow graph , process (computing) , graph , algorithm , diagram , flow (mathematics) , computer science , enhanced data rates for gsm evolution , enumeration , data flow diagram , mathematical optimization , streams , mathematics , theoretical computer science , engineering , discrete mathematics , geometry , mechanical engineering , artificial intelligence , database , electrical engineering , operating system , computer network

The concepts of ineligible streams and two‐way edge reduction are extended to simplify the signal flow diagram of a recycle process flow sheet graph. The solution to a tearing problem can be obtained readily by repeated reduction of ineligible streams and two‐way edges. When this fails, a branch and bound method will guarantee optimality at the expense of a few enumerations.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research