Linear Programming Algorithm for Invariant Polyhedral Sets of Discrete-TimeLinear Systems

摘要

In this paper we formulate necessary and sufficient conditions for a polyhedralset to be positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.