On Decision-Mappings Related to Process Network Synthesis Problem

Z. Blázsik 1, Cs. Holló, B. Imreh2

Abstract

 Process network synthesis (PNS) has enormous practical impact and a structural model can be given for it on the basis of a combinatorial approach. An important tool of this approach is the notion of the decision-mapping. In the present work, the number of the consistent decision-mappings is counted and an upper bound is presented for the number of the feasible solutions of a PNS problem.

Footnotes:

  1 Research Group on Artificial Intelligence of the Hungarian Academy of Sciences, Aradi vértanúk tere 1, H-6720 Szeged, Hungary

  2 Dept. of Informatics, József Attila University, Árpád tér 2, H-6720 Szeged, Hungary