.png){kind=icon}
Return
Dynamic optimization with equality path constraints
.png){kind=icon}
PRE
AI
DOI：10.1021/ie9807093.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Iq new method for solving equality path-constrained dynamic optimization problems is proposed that directly solves the associated high-index differential and algebraic equation (DAE) using the dummy derivative method. This method eliminates efficiency and error control problems associated with other numerical methods for; solving these problems. It is proved that equality path constraints can cause the dynamic optimization problem to contain high-index DAEs. Also presented are a set of theorems that use controllability arguments to state when the equality path-constrained dynamic optimization problem is feasible. Results from several numerical examples are discussed, including a large-scale chemical engineering example.
Keywords:
DIFFERENTIAL-ALGEBRAIC EQUATIONS
SYSTEMS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.9
Papers:
4.0W
Citations:
9.6W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveSWAM.png)
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Proceedings of the thirteenth ACM international conference on Information and knowledge managementIF0
PREAI
ShareSaveShareSaveShareSave
View more