2007
DOI: 10.1016/j.cep.2006.06.021
|View full text |Cite
|
Sign up to set email alerts
|

An overview of simultaneous strategies for dynamic optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
285
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 452 publications
(286 citation statements)
references
References 62 publications
1
285
0
Order By: Relevance
“…Even when a solution could be found, an increase around 2-3 orders of magnitude in computation time was required. This is so because very good initial values of the decision variables are normally required for the efficient solution of dynamic optimization problems using the simultaneous approach as described in [13]. In all cases the optimal solutions using either approach were the same with the computational load being the main difference between both solution methods.…”
Section: Mido Solution Strategymentioning
confidence: 81%
See 1 more Smart Citation
“…Even when a solution could be found, an increase around 2-3 orders of magnitude in computation time was required. This is so because very good initial values of the decision variables are normally required for the efficient solution of dynamic optimization problems using the simultaneous approach as described in [13]. In all cases the optimal solutions using either approach were the same with the computational load being the main difference between both solution methods.…”
Section: Mido Solution Strategymentioning
confidence: 81%
“…However, we do not expect additional computational problems because of the unstable nature of the steady-states. This desired feature of our MIDO approach has to do with using the simultaneous approach for solving dynamic optimization problems [13]. Table 6: Simultaneous scheduling and control results for the non-isothermal adiabatic tubular reactor case study.…”
Section: Non-isothermal Adiabatic Tubular Reactor With Recycle and MImentioning
confidence: 99%
“…From this discretization and the (algorithm specific) parameterization of the differential states results a highly structured NLP that is usually solved by either an interior point or an active set based algorithm. For details on an efficient implementation and further references see, e.g., [24,4].…”
Section: Direct Approach To Optimal Controlmentioning
confidence: 99%
“…To model the pure scheduling optimization problem we use the parallel lines scheduling formulation proposed in [2], whereas for addressing the optimal control calculations we use the simultaneous approach described in [3]. We again propose to solve both problems simultaneously, rather than sequentially, because of the aforementioned reasons.…”
Section: Introductionmentioning
confidence: 99%