Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems
T. K. Pho, Leon Lapidus · AIChE Journal · 1973
Abstract 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.