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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12593 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 319-328 |
| ISSN: | 0324-721X |