We are aware of an issue with certificate availability and are working diligently with the vendor to resolve. The vendor has indicated that, while users are unable to directly access their certificates, results are still being stored. Certificates will be available once the issue is resolved. Thank you for your patience.

(643a) Mimimum Volume for a Network of Reactor with a Known RTD

Manousiouthakis, V. I., Chemical Engineering Department, University of California at Los Angeles

The minimum volume problem is investigated, within the IDEAS framework, for a network of reactor with known RTD and isothermal reactor networks. The resulting mathematical formulation is an infinite dimensional program with linear constraints and a separable concave objective function to be minimized. The global optimum of this infinite program is approximated through global solution of a series of finite dimensional programs with concave separable objective functions and linear feasible regions. A branch and bound algorithm is used to solve globally each of these finite programs. The proposed methodology is illustrated with a reactor network synthesis case study aiming at reactor volume minimization.