A linear programming algorithm for invariant polyhedral sets of discrete-time linear systems

DOI10.1016/0167-6911(94)00096-EzbMath0877.93071OpenAlexW2054021167MaRDI QIDQ672439

A. A. ten Dam, Johannes W. Nieuwenhuis

Publication date: 28 February 1997

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(94)00096-e

zbMATH Keywords

Linear programmingInvariant setsLinear discrete-time systemsPolyhedral setsPositive invariance

Mathematics Subject Classification ID

Related Items (5)

Unnamed Item ⋮ Dual optimization approach to set invariance conditions for discrete-time dynamic systems ⋮ Positive invariance, monotonicity and comparison of nonlinear systems ⋮ Constrained predictive control of linear distributed parameter systems ⋮ Constrained regulation of continuous Petri nets

Cites Work

• On the positive invariance of polyhedral sets for discrete-time systems
• Geometric state-space theory in linear multivariable control: A status report
• Feedback control of linear discrete-time systems under state and control constraints
• Positively invariant polyhedral sets of discrete-time linear systems
• On invariant polyhedra of continuous-time linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear programming algorithm for invariant polyhedral sets of discrete-time linear systems