Abstract
Current strategies for optimization of dynamic systems usually require repeated solution of the differential equation model and may therefore be inefficient. This note explores the use of orthogonal collocation to reduce the dynamic optimization problem to an equality constrained nonlinear program (NLP). The NLP is then solved using a strategy that simultaneously converges and optimizes the algebraic model. Using a small example for comparison, significant reductions in computational effort are observed.
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.
