A LINEAR-PROGRAMMING ALGORITHM FOR INVARIANT POLYHEDRAL-SETS OF DISCRETE-TIME LINEAR-SYSTEMS

Authors
TENDAM AA NIEUWENHUIS JW
Citation
Aa. Tendam et Jw. Nieuwenhuis, A LINEAR-PROGRAMMING ALGORITHM FOR INVARIANT POLYHEDRAL-SETS OF DISCRETE-TIME LINEAR-SYSTEMS, Systems & control letters, 25(5), 1995, pp. 337-341
Citations number
12
Categorie Soggetti
Controlo Theory & Cybernetics","System Science","Operatione Research & Management Science
Journal title
Systems & control letters → ACNP
ISSN journal
01676911
Volume
25
Issue
5
Year of publication
1995
Pages
337 - 341
Database
ISI
SICI code
0167-6911(1995)25:5<337:ALAFIP>2.0.ZU;2-T
Abstract
In this paper we formulate necessary and sufficient conditions for an arbitrary polyhedral set to be a positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are includ ed in the analysis. A linear programming algorithm is presented that e nables practical application of the results stated in this paper.