z-logo
Premium
Dynamic real‐time optimization with closed‐loop prediction
Author(s) -
Jamaludin Mohammad Zamry,
Swartz Christopher L. E.
Publication year - 2017
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.15752
Subject(s) - mathematical optimization , control theory (sociology) , optimization problem , model predictive control , nonlinear system , computer science , complementarity (molecular biology) , process (computing) , convex optimization , regular polygon , control (management) , mathematics , physics , geometry , quantum mechanics , artificial intelligence , biology , genetics , operating system
Process plants are operating in an increasingly global and dynamic environment, motivating the development of dynamic real‐time optimization (DRTO) systems to account for transient behavior in the determination of economically optimal operating policies. This article considers optimization of closed‐loop response dynamics at the DRTO level in a two‐layer architecture, with constrained model predictive control (MPC) applied at the regulatory control level. A simultaneous solution approach is applied to the multilevel DRTO optimization problem, in which the convex MPC optimization subproblems are replaced by their necessary and sufficient Karush–Kuhn–Tucker optimality conditions, resulting in a single‐level mathematical program with complementarity constraints. The performance of the closed‐loop DRTO strategy is compared to that of the open‐loop prediction counterpart through a multi‐part case study that considers linear dynamic systems with different characteristics. The performance of the proposed strategy is further demonstrated through application to a nonlinear polymerization reactor grade transition problem. © 2017 American Institute of Chemical Engineers AIChE J , 63: 3896–3911, 2017

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here