“…The above linear constraints constitute a probabilistically guaranteed approximation of the actual constraint observed online. In particular, it was shown in [23] that if, for given probabilistic parameters α , β , γ ∈ (0, 0.14), and δ ∈ (0, 1), the samples are drawn such that N x ≥Ñ (n + m, , δ), N u ≥Ñ (n + m, β , δ), N T ≥Ñ (n + T m, γ , δ), withÑ (·, ·, ·) given in [16]. The linear constraints (12), (13), (14), possibly after constraint reduction, can be summarized in the following linear constraint set…”