A note on connection between PNS and set covering problems
Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming model is tedious to solve because it usually involves a large number of binary variables. Using a combinatorial approach, a structural model of PNS can be given, and a branch-and-bound technique can...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1996
|
| Sorozat: | Acta cybernetica
12 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12563 |
| Tartalmi kivonat: | Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming model is tedious to solve because it usually involves a large number of binary variables. Using a combinatorial approach, a structural model of PNS can be given, and a branch-and-bound technique can be applied for searching an optimal solution. In some realistic examples of PNS, this method is efficient. Nevertheless, efficient methods are unavailable for solving these models generally. In this note, we describe a special class of PNS-problems as set-covering or set-partitioning problems. These problems are well-known to be NP-complete, thus, a PNS-problem is NP-hard. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 309-312 |
| ISSN: | 0324-721X |