Subject510 Mathematics 600 Technology Gemischt-ganzzahlige OptimierungSteuerungProblemNP-hartes Problem
MetadataShow full item record
Efficient Solution of Distributed MIP in Control of Networked Systems
Certain classes of optimization‐based control problems stated for networked systems involving hybrid dynamics and logical constraints can be cast into Mixed‐Integer Programming (MIP) problems. Since these belong to the complexity class NP‐hard, the motivation arises to find approximations of the optimal solution by distributed solution efficiently. For the cases that the cost functional is linear or quadratic and the constraints are linear, this paper proposes an alternative to the standard centralized schemes, by employing dual decomposition into a set of local problems of moderate size which can be solved in parallel. Numerical examples demonstrate that the scheme can efficiently approximate the global solution.
CitationIn: Proceedings in applied mathematics and mechanics (PAMM) Volume 20 / Issue 1 (2021-01-25) EISSN 1617-7061
SponsorshipGefördert im Rahmen des Projekts DEAL
CollectionsPublikationen (Artikel im Open Access gefördert durch die UB)
The following license files are associated with this item: