“…The last q constraints in (MPSC) force G l (x) or H l (x) to be zero for all l ∈ Q, which gives rise to the terminology "switching constraints". Switching structures appear frequently in the context of optimal control, see Clason et al [2017], Gugat [2008], Hante and Sager [2013], Liberzon [2003], Seidman [2013], Wang and Yan [2015], Zuazua [2011], and the references therein, or as a reformulation of so-called either-or constraints, see [Mehlitz, 2018, Section 7]. Naturally, (MPSC) is related to other problem classes from disjunctive programming such as mathematical programs with complementarity constraints, MPCCs for short, see Luo et al [1996], Outrata et al [1998], or mathematical programs with vanishing constraints, MPVCs for short, see Achtziger and Kanzow [2008], Hoheisel and Kanzow [2008].…”