Abstract

In chemical manufacturing processes, optimization problems with differential-algebraic constraints are frequently encountered. In general, these problems are difficult to solve and solution approaches are usually based on discretization schemes. This paper proposes an alternative method to determine optimal setpoint trajectories for a class of dynamic systems with differential-algebraic constraints. The method exploits di ff erential flatness to explicitly eliminate the differential state equations. The resulting optimization problem is an algebraic, nonlinearly constrained optimization problem, and can be solved by nonlinear programming. The proposed approach has the potential to reduce the amount of on-line computation required to solve a specific class of these problems in real-time.

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.