Solution of separation-network synthesis problems by the P-graph methodology

The current work demonstrates that separation-network synthesis (SNS) problems can be transformed into process-network synthesis (PNS) problems: the SNS problems constitute a particular class of PNS problems. Thus, the transformed SNS problems are solvable by resorting to the P-graph methodology originally introduced for the PNS problems. The methodology has been unequivocally proven to be inordinately effective.