Abstract
We present the analysis of the steady state backoff problem with state and dynamic constraints of a non-linear chemical process described by almost 3000 differential algebraic equations. The dynamic optimization is carried out using a new approach based on an SQP algorithm for semi-infinite non-linear programming problems. The system equations are integrated with an implicit Runge-Kutta method and 'reduced' gradients are evaluated by adjoint equations. The high performance of the algorithm is analysed and compared to fully non-linear programming proposals in which discretized system equations are treated as general non-linear equality constraints.
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.
