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.
No takes yet. Share an insight, caveat, or question.
Motard et al. (1981) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: