IEEE Transactions on Automatic Control, Vol.52, No.2, 359-364, 2007
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.