Optimal decomposition of process networks

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.