An algebraic approach to targeting waste discharge and impure fresh usage via material recycle/reuse networks

This paper introduces an algebraic procedure that targets material-recycle networks. The problem involves the allocation of process streams and fresh sources to process units (sinks) with the objective of minimizing fresh usage and waste discharge. First, observations from the graphical targeting approach are transformed into algebraic insights. Then, a geometrical transformation is developed to account for the possibility of using impure fresh resources. These insights and geometrical transformations are arranged through a cascade analysis, which identifies and adjusts any recycle infeasibilities so as to maximize the recycle opportunities. A systematic non-iterative algebraic approach is developed to identify rigorous targets for minimum usage of impure fresh resources, maximum recycle of process resources and minimum discharge of waste. These targets are identified a priori and without commitment to the detailed design of the recycle/reuse network. The approach is valid for both pure and impure fresh resources. The devised procedure also identifies the location of the material-recycle pinch point and addresses its significance in managing process sources, fresh usage, and waste discharge. Two case studies are solved to illustrate the ease, rigor, and applicability of the developed targeting technique and its relationship to graphical targeting techniques.