Premium
Process network synthesis: Problem definition
Author(s) -
Friedler F.,
Fan L. T.,
Imreh B.
Publication year - 1998
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199803)31:2<119::aid-net6>3.0.co;2-k
Subject(s) - computer science , bipartite graph , class (philosophy) , mathematical optimization , network planning and design , process (computing) , network structure , theoretical computer science , graph , nonlinear system , mathematics , artificial intelligence , operating system , computer network , physics , quantum mechanics
Analyses of network problems have yielded mathematically and practically significant results. Naturally, it should be of substantial interest to extend such results to a general class of network problems where the structure of any system can be represented by a directed bipartite graph containing two types of vertices; the model for one of them is nonlinear. This class of problems is frequently encountered in the design of process systems for carrying out transformation of chemical or material species through physical, chemical, or biological means. General‐purpose mathematical programming methods have failed so far to solve large‐scale network problems involved in the design of such systems. This paper is intended to define this class of network problems, i.e., the problems of process network synthesis, and to elucidate the unique features of these problems. © 1998 John Wiley & Sons, Inc. Networks 31:119–124, 1998