Chapter Six - Synthesis of Mass-Exchange Networks: A Mathematical Programming Approach
暂无分享,去创建一个
This chapter illustrates how mathematical programming (or optimization) techniques enable the designer to simultaneously screen all mass-separating agents (MSAs) even when there are no process MSAs; determine the minimum operating cost (MOC) solution and locate the mass-exchange pinch point; determine the best outlet composition for each MSA; and construct a network of mass exchangers which has the least number of units that realize the MOC solution. The target compositions are only upper bounds on the outlet compositions. Therefore, it may be necessary to optimize the outlet compositions. A short-cut method of optimizing the outlet composition is the use of “lean substreams.”
[1] Mahmoud M. El-Halwagi,et al. Simultaneous synthesis of mass‐exchange and regeneration networks , 1990 .
[2] V. Manousiouthakis,et al. Automatic synthesis of mass-exchange networks with single-component targets , 1990 .
[3] Mahmoud M. El-Halwagi,et al. Synthesis of mass exchange networks , 1989 .
[4] Mahmoud M. El-Halwagi,et al. SYNTHESIS OF FLEXIBLE MASS-EXCHANGE NETWORKS , 1995 .