z-logo
Premium
On reducing the number of decision variables for dynamic optimization
Author(s) -
Rodrigues Diogo,
Bonvin Dominique
Publication year - 2019
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.2543
Subject(s) - sensitivity (control systems) , sequence (biology) , mathematical optimization , mathematics , set (abstract data type) , optimal control , finite set , optimization problem , distillation , arc (geometry) , fractionating column , control theory (sociology) , computer science , control (management) , engineering , artificial intelligence , mathematical analysis , chemistry , genetics , geometry , organic chemistry , electronic engineering , biology , programming language
Summary This paper presents an input parameterization for dynamic optimization that allows reducing the number of decision variables compared to traditional direct methods. A small number of decision variables is likely to be beneficial for various applications such as global optimization and real‐time optimization in the presence of plant‐model mismatch. The procedure consists of three steps: (i) adjoint‐free optimal control laws are computed for all arc types that may be present in the solution, and a finite set of plausible arc sequences is postulated; (ii) the sensitivity‐seeking arcs are either described by analytical control laws or approximated by cubic splines, which results in a parsimonious input parameterization that represents the optimal inputs using only a few parameters, namely, switching times and initial conditions for the sensitivity‐seeking arcs; and (iii) for each arc sequence, optimal parameter values are computed via numerical optimization, and the sequence with the best cost is optimal. The procedure is illustrated via the simulated examples of a semibatch reactor and a distillation column.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here