Abstract
Accurate nonlinear dynamic models of process operations such as start-ups and shut-downs include state-dependent events that trigger discrete changes to the describing equations, and are best analyzed within a hybrid systems framework. The automated design of an optimal process operation can thus be formulated as a dynamic optimization problem with a hybrid system embedded. This paper describes recent progress on the development of suitable deterministic algorithms for the global solution of these problems. A method for constructing convex relaxations of general nonconvex nonlinear programming (NLP) problems with linear dynamic systems embedded is presented. These convex relaxations are then extended to multistage problems with model switches between the stages. Finally, integer variables are introduced to represent alternative sequences of model switches. The ability to construct convex relaxations enables existing nonconvex mixed nonlinear programming (MINLP) algorithms to be applied to find the global solution of the resulting mixed integer dynamic optimization (MIDO) problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
