An Approach to Determining the Number of Time Intervals for Solving Dynamic Optimization Problems
| Autor: | Evgeny Lazutkin, Pu Li, Abebe Geletu |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Optimization problem Discretization Computer science General Chemical Engineering Time horizon 010103 numerical & computational mathematics 02 engineering and technology General Chemistry Maximization 01 natural sciences Industrial and Manufacturing Engineering Finite element method Model predictive control 020901 industrial engineering & automation Approximation error Limit (mathematics) 0101 mathematics |
| Zdroj: | Industrial & Engineering Chemistry Research. 57:4340-4350 |
| ISSN: | 1520-5045 0888-5885 |
| DOI: | 10.1021/acs.iecr.7b03361 |
| Popis: | To numerically solve a dynamic optimization problem, the model equations need to be discretized over a time horizon. The very first step therefore is to decide the number of time intervals. In principle, the decision is made to achieve a compromise between the numerical accuracy of the discretization and the computation load for solving the discretized optimization problem. However, there have been no comprehensive rules for this purpose. In the context of collocation on finite elements, we propose a novel bilevel approach to evaluate an upper limit of the approximation error by formulating and solving an error maximization problem. In this way, a minimum number of time intervals can be determined a priori, which guarantees a user-defined error tolerance. In addition, the impact of the initial conditions on the maximum approximation error is taken into account so that the determined number of intervals is valid for varying initial conditions and thus can be applied to nonlinear model predictive control. S... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|