On the computation of viable polytopes for linear systems

We develop a procedure for computing viable (also known as controlled invariant) polytopes of a given subset of the state space under linear dynamics. The advantage of the proposed algorithm is that at every step it maintains a polytope that is itself viable. Therefore, even if the algorithm is stopped before termination it will still return a viable polytope, that can be subsequently used for controller design.