“…Let a feasible solution to P ′ (N,r) be given by the tuple (P, c, Q , d,δ N ). Then, a corresponding feasible solution to P ′ (N, r) is given by the tuple (P, c, Q , d, δ N ), where δ N =δ N ∨ γ , for any γ ∈ {0, 1} N such that ∥δ N ∥ 1 = r. This is evident from the fact that a more restrictive blocking structure withr blocks can always be relaxed (Shekhar & Maciejowski, 2012b) to a less restrictive structure with r >r blocks, whilst still admitting Q and d as part of the feasible solution. In other words, reducing the number of blocks always introduces more restrictive equality constraints on (41b)-(41c).…”