Premium
Exclusive tear sets for flowsheets
Author(s) -
Motard Rodolphe L.,
Westerberg Arthur W.
Publication year - 1981
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.690270504
Subject(s) - tearing , unit (ring theory) , set (abstract data type) , enumeration , mathematics , loop (graph theory) , algorithm , combinatorics , mathematical optimization , computer science , engineering , mechanical engineering , mathematics education , programming language
A new implicit enumeration algorithm locates the minimum weighted tear sets among those which belong to the nonredundant families of Upadhye and Grens (1975). Theoretical developments support the algorithm and give a new insight relating nonredundancy to the tearing of unit loops in a flowsheet. If all loops can be torn exactly one time, the nonredundant family is unique and a member of it is trivial to find. If not possible, two or more nonredundant families exist and the above algorithm discerns among them, picking a tear set which minimizes the maximum number of times any unit loop is torn.