Reachability of a Set of Facets for Linear Affine Systems With n-1 Inputs

This note provides new necessary and sufficient conditions for an n-dimensional linear affine system with n-1 inputs to reach an exit facet (or set of exit facets) of a simplex. The conditions reduce the original NP-hard necessary and sufficient conditions to a set of at most n LP problems