Abstract

Following on the popularity of dynamic simulation for process systems, dynamic optimization has been identified as an important task for key process applications. In this study, we present an improved algorithm for simultaneous strategies for dynamic optimization. This approach addresses two important issues for dynamic optimization. First, an improved nonlinear programming strategy is developed based on interior point methods. This approach incorporates a novel filter-based line search method as well as preconditioned conjugate gradient method for computing search directions for control variables. This leads to a significant gain in algorithmic performance. On a dynamic optimization case study, we show that nonlinear programs (NLPs) with over 800,000 variables can be solved in less than 67 CPU minutes. Second, we address the problem of moving finite elements through an extension of the interior point strategy. With this strategy we develop a reliable and efficient algorithm to adjust elements to track optimal control profile breakpoints and to ensure accurate state and control profiles. This is demonstrated on a dynamic optimization for two distillation columns. Finally, these algorithmic improvements allow us to consider a broader set of problem formulations that require dynamic optimization methods. These topics and future trends are outlined in the last section.

Full Text
Paper version not known

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 call

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