Chachuat, BenoitSinger, Adam B.Barton, Paul2007-09-212007-09-21200510.1016/S1570-7946(05)80144-0https://infoscience.epfl.ch/handle/20.500.14299/12338This paper presents a decomposition approach for a quite general class of mixed-integer dynamic optimization problems that is capable of guaranteeing a global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case study is presented in connection to the optimal subproblems. A case study is presented in connection to the optimal design and operation of a batch process consisting of a series reaction followed by a separation with no intermediate storage. The developed algorithms demonstrate efficiency and applicability in solving this problem.mixed-integer dynamic optimizationglobal optimizationbatch process design and operationtext::conference output::conference proceedings::conference paper