Redundant
Strategy for deciding whether a candidate linear constraint is redundant given a set of other linear constraints. A constraint a · x <= b is redundant with respect to a set S of half-spaces when every point satisfying S already satisfies it — i.e. removing it does not change the feasible region. ISC uses this to prune the most-promising-area polytope so the RMD sampler walks only over the constraints that actually bind.