Global Solution of Mixed-Integer Dynamic Optimization Problems

This 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.


Published in:
European Symposium on Computer Aided Process Engineering-15, 133-138
Presented at:
15th European Symposium on Computer Aided Process Engineering (ESCAPE'15), Barcelona, Spain, May 29-June 1, 2005
Year:
2005
Publisher:
Elsevier
Keywords:
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2007-09-21, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)