Abstract
This paper presents a mathematical formulation for the dynamic optimisation of hybrid processes described by general state-transition networks. In each state, the system behaviour is described by a set of differential and algebraic equations (DAEs). Transitions occur from one state to another whenever certain logical conditions are satisfied. The time horizon of interest is divided into a number of periods of variable duration, with the system potentially being in a different state in each period. Neither the initial nor the final state of the system, nor indeed any of its intermediate states, need to be known a priori. The resulting dynamic optimisation problem involves both continuous and discrete variables and is solved using a complete discretisation approach. Two examples of the application of the proposed methodology are presented.
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.
