FEASIBLE DESIGN FOR SEPARATION NETWORKS - A SELECTION TECHNIQUE

Presented is a non-mathematical, non-computer technique for obtaining feasible designs for simple separation networks. Once the transfer function of the unit operations of a network are known and the desired separation factor and beneficiation ratio specified, a set of graphs approximating network performance is used to design the network. The technique results in networks which closely meet target specification. These graphs specify: (1) the total number of network stages; (2) the stage at which the feed should enter the network; and (3) the specific arrangement of the stages, thereby specifying the entire network. An unexpected finding of this effort was the acknowledgement that the number of stages the recycle steam is fed back may be greater than one stage. This network designing method appears to be an excellent tool for teaching network design.