2014
DOI: 10.1016/j.jprocont.2014.05.013
|View full text |Cite
|
Sign up to set email alerts
|

A Dantzig–Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 27 publications
0
10
0
Order By: Relevance
“…The maintenance scheduling and routing problem of offshore wind farms has been formulated as a VRP with side constraints by Irawan et al (2017) and solved efficiently using Dantzig-Wolfe decomposition. Dantzig-Wolfe decomposition has been used by Edlund et al (2011) and Sokoler et al (2014) for distributed implementation of the MPC optimization problem, which is an LP problem. Applications of Dantzig-Wolfe decomposition to MILP-MPC are relatively few.…”
Section: Mpc and Distributed Milpmentioning
confidence: 99%
See 1 more Smart Citation
“…The maintenance scheduling and routing problem of offshore wind farms has been formulated as a VRP with side constraints by Irawan et al (2017) and solved efficiently using Dantzig-Wolfe decomposition. Dantzig-Wolfe decomposition has been used by Edlund et al (2011) and Sokoler et al (2014) for distributed implementation of the MPC optimization problem, which is an LP problem. Applications of Dantzig-Wolfe decomposition to MILP-MPC are relatively few.…”
Section: Mpc and Distributed Milpmentioning
confidence: 99%
“…Typical remedies for the erratic behaviour of the dual bounds include warm start e.g. (Sokoler et al, 2014), which provides a good dual bound at the beginning of the iteration, and stabilization techniques (Rousseau et al, 2007;Gschwind and Irnich, 2016), which add penalizing terms to (53) to avoid drastic change in the Lagrangian dual bounds. Another improvement of the standard column generation algorithm is the primal-dual column generation technique developed by Gondzio et al (2013), which uses suboptimal primal and dual solutions of the restricted master problem to improve the stability of the iteration.…”
Section: Upper and Lower Boundsmentioning
confidence: 99%
“…The discretized OCP is an MILP. To get well-behaved closedloop solutions, the OCP objective function can be augmented by 1 -and 2 -penalty terms on the input-rate [54]. For 2regularization, the OCP becomes an MIQP.…”
Section: A Standard Formmentioning
confidence: 99%
“…Remark 2: Provided that φ (u, x, z) is a convex function and that U is a convex set, u * CE can often be obtained efficiently by special-purpose optimization algorithms [24], [25].…”
Section: Certainty Equivalence Economic Model Predictive Controlmentioning
confidence: 99%