On the positive invariance of polyhedral sets for discrete-time systems
Necessary and sufficient conditions for a polyhedral set to be a positively invariant set of a linear discrete-time system are established. A main ingredient in the proof is the duality theorem of linear programming. Parts of the results can also be stated in terms of a non-quadratic Lyapunov-function.
scientific article; zbMATH DE number 4081414
scientific article