Separation-network synthesis: global optimum through rigorous super-structure

The available algorithmic methods often fail to yield with certainty the gl obal optima in solving even a relatively simple class of separation-network synthesis problem for which the cost functions are considered to be linear . This is attributable to two complications; firstly the super-structures o n which the solutions are based are incomplete; and the secondly, the mathe matical programming models derived for the problems are unnecessarily cumbe rsome. To circumvent these complications, a novel method is proposed here t o generate the complete super-structure and the corresponding mathematical programming model necessary for the separation-network synthesis problem wi th linear cost function. The efficacy of the proposed method is demonstrate d by re-examining Four published problems for which the optima obtained are claimed to be global. For all the problems re-examined, the costs of the s olutions resulting from the present method are the same or as much as 30% l ower than those of the published solutions. (C) 2000 Elsevier Science Ltd. All rights reserved.