• search hit 17 of 23
Back to Result List

Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints

  • We consider mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times. We analyze a lifting and decomposition approach into a mixed-integer optimal control problem without combinatorial constraints and a mixed-integer problem for the combinatorial constraints in the control space. Both problems can be solved very efficiently with existing methods such as outer convexification with sum-up-rounding strategies and mixed-integer linear programming techniques. The coupling is handled using a penalty-approach. We provide an exactness result for the penalty which yields a solution approach that convergences to partial minima. We compare the quality of these dedicated points with those of other heuristics amongst an academic example and also for the optimization of electric transmission lines with switching of the network topology for flow reallocation in order to satisfy demands.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Simone Göttlich, Falk Hante, Andreas Potschka, Lars Schewe
Parent Title (German):Mathematical Programming
Document Type:Article
Language:English
Date of Publication (online):2019/05/31
Date of first Publication:2019/05/31
Release Date:2019/05/31
Institutes:Friedrich-Alexander-Universität Erlangen-Nürnberg
Humboldt-Universität zu Berlin
Subprojects:A03
B07
Licence (German):License LogoCreative Commons - CC BY - Namensnennung 4.0 International