Loading...
conference presentation
Global Solution of Mixed-Integer Dynamic Optimization Problems
2004
This paper presents a decomposition approach for a quite general class of mixed- integer dynamic optimization problems that is capable of guaranteeing the global solution despite the nonconvexities inherent to the dynamic optimization 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.
Type
conference presentation
Authors
Publication date
2004
EPFL units
Event name | Event place | Event date |
Austin, TX | November 7-12, 2004 | |
Available on Infoscience
September 21, 2007
Use this identifier to reference this record