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

AA TENDAM; JW NIEUWENHUIS

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

AA TENDAM^*
, JW NIEUWENHUIS

^*Corresponding author voor dit werk

Onderzoeksoutput › Academic › peer review

24 Citaten (Scopus)

Samenvatting

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 included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.

Originele taal-2	English
Pagina's (van-tot)	337-341
Aantal pagina's	5
Tijdschrift	Systems & Control Letters
Volume	25
Nummer van het tijdschrift	5
Status	Published - 8-aug.-1995

Handle.net

Permanente koppeling

Citeer dit

@article{87874d0b8dd940b2b906bdbe2c3c660f,

title = "A LINEAR-PROGRAMMING ALGORITHM FOR INVARIANT POLYHEDRAL-SETS OF DISCRETE-TIME LINEAR-SYSTEMS",

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 included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.",

keywords = "INVARIANT SETS, LINEAR DISCRETE-TIME SYSTEMS, LINEAR PROGRAMMING, POLYHEDRAL SETS, POSITIVE INVARIANCE",

author = "AA TENDAM and JW NIEUWENHUIS",

year = "1995",

month = aug,

day = "8",

language = "English",

volume = "25",

pages = "337--341",

journal = "Systems \& Control Letters",

issn = "0167-6911",

publisher = "ELSEVIER SCIENCE BV",

number = "5",

}

TY - JOUR

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

AU - TENDAM, AA

AU - NIEUWENHUIS, JW

PY - 1995/8/8

Y1 - 1995/8/8

N2 - 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 included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.

AB - 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 included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.

KW - INVARIANT SETS

KW - LINEAR DISCRETE-TIME SYSTEMS

KW - LINEAR PROGRAMMING

KW - POLYHEDRAL SETS, POSITIVE INVARIANCE

M3 - Article

SN - 0167-6911

VL - 25

SP - 337

EP - 341

JO - Systems & Control Letters

JF - Systems & Control Letters

IS - 5

ER -

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

Samenvatting

Handle.net

Vingerafdruk

Citeer dit