Brute
An exact, dependency-free redundancy checker for a continuous polytope based on Fourier–Motzkin elimination. A half-space a · x <= b is redundant with respect to others when the system others ∧ (a · x > b) is infeasible. Strict violation is approximated by the closed system others ∧ (-a · x <= -b - tolerance); if that system has no real solution, the target adds nothing and is redundant.
Fourier–Motzkin elimination is exact for the continuous relaxation but can grow the number of constraints combinatorially as variables are eliminated. To keep the check bounded, maxRows caps the intermediate constraint count: if the cap is exceeded the checker fails open — it reports the target as not redundant (conservative: keep the constraint). This never removes a constraint that might bind; at worst the RMD sampler carries a few extra inactive half-spaces.
Parameters
the slack used both to detect a strict violation and to declare an eliminated row infeasible; defaults to HalfSpace.defaultTolerance
the maximum number of intermediate rows tolerated during elimination before the check fails open; defaults to DEFAULT_MAX_ROWS