On decision-mappings related to process network synthesis problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Blázsik Zoltán
Holló Csaba
Imreh Balázs
Format: Article
Published: 1998
Series:Acta cybernetica 13 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12593
Description
Summary: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.
Physical Description:319-328
ISSN:0324-721X