Generalized reduction constraints for the global optimization of dynamic process networks using topological invariants

We describe a novel framework for the modeling and optimization of dynamic process networks based on network theory. Global optimization of nonlinear systems is investigated for dynamic flow problems. Tellegen's Theorem, a topological invariant of process networks, plays a central role as generalized reduction constraint. In order to improve the computational efficiency of the spatial branch and bound methods for the solution of global optimization problems, we develop a systematic method to generate formulations which lead to tighter convex relaxations and improved numerical characteristics.