A new approach to co-ordinate distributed, worse-case scenario, linear quadratic optimization problems
Keywords:
worse-case scenario LQ; distributed optimization; decomposition; price-driven co-ordinationAbstract
A new approach for price driven coordination, large-scale, worst-case scenario linear quadratic optimization problems is presented. The approach is based on a reformulation of the dual problem associated
with the centralized robust optimization problem and to modify the co-ordination scheme in order to
incorporate determination of the worst-case scenario. The convergence of the algorithm is proven and
is guaranteed when the uncertainty set, the objective function and the constraints satisfy some specic
properties.
Published
How to Cite
Issue
Section
Copyright (c) 2021 Babacar Seck, Fraser J. Forbes

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This open-access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license.
You are free to: Share — copy and redistribute the material in any medium or format.
Adapt — remix, transform, and build upon the material for any purpose, even commercially. The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms: Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
No additional restrictions: You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.