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


Presented at:
AIChE Annual Meeting, Austin, TX, November 7-12, 2004
Year:
2004
Keywords:
Laboratories:




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


Rate this document:

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