This demonstration program is the realization of the algorithm presented in

**Problem definition**- simple and sharp separators,
- dividers, and
- mixers.
- The cost of a separation-network is the sum of the costs of its separators;
- The cost of a separator is: D
_{i}f_{i }where **Demonstration program**- It generates the super-structure and the corresponding mathematical-programming model and also it solves this model, i.e., the whole synthesis procedure is implemented algorithmically;
- The super-structure generated by the program always includes the optimal solution for the class of problems considered, i.e., the super-structure is rigorous;
- A linear programming model is generated, and thus it is highly effective;
- The optimality of the solution is guaranteed.
- The number of feed-streams can be up to 6;
- The number of product-streams can be up to 6;
- The number of components can be up to 6.
- A large number of separators may appear in the optimal solution because of the linearity of the cost function;
- In general, the number of separators can be reduced without increasing the cost of the network by combining certain separators in the network; its algorithmic solution is also included.

View the abstract of the presentation

View the transparencies of the presentation

Download the abstract of the
presentation

Word for Windows document (13 Kbytes)

Download the copies of the
transparencies of the presentation

Word for Windows document (651 Kbytes)

f_{i} mass load

D_{i} degree of difficulty

A program has been developed on the basis of the method given in the above mentioned presentation. This program can be downloaded here.

General features of this program:

Limitations on the sizes of the problems:

Comments:

Download demonstration program for

Please send your comments to capo@dcs.vein.hu