Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm

We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial constraints such as, e.g., an upper bound on the total numbe...

Full description