2002
DOI: 10.3182/20020721-6-es-1901.00513
|View full text |Cite
|
Sign up to set email alerts
|

Max-Plus-Algebraic Problems and the Extended Linear Complementarity Problem — Algorithmic Aspects

Abstract: Many fundamental problems in the max-plus-algebraic system theory for discrete event systems -among which the minimal state space realization problem -can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (LCP). Our proof results in three possible numerical solution methods for a given ELCP: regular ELCP algorithms, mixed int… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Year Published

2003
2003
2020
2020

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 22 publications
0
5
0
1
Order By: Relevance
“…(k 1 + N p ) ≤ w (i,l) . ( H ist die Prädiktionsmatrix und g ist der Vektor für den Einfluss der Anfangsbedingungen x (i,l) (k 0 ) mit [SHB02] werden H und g folgendermaßen definiert.…”
Section: Der Betrachtungsraum Als Regelkreisunclassified
“…(k 1 + N p ) ≤ w (i,l) . ( H ist die Prädiktionsmatrix und g ist der Vektor für den Einfluss der Anfangsbedingungen x (i,l) (k 0 ) mit [SHB02] werden H und g folgendermaßen definiert.…”
Section: Der Betrachtungsraum Als Regelkreisunclassified
“…Constraints of the second type mean that a i +x i ≥ α for at least one i, and this can be written as a i + x i + (1 − w i )M ≥ α, where w i ∈ {0, 1} and i w i = 1, with M a sufficiently large number. One can see that this reduction to MILP also applies to the constraints in (6). Combining these techniques with the general Dempe-Franke algorithm is a matter of ongoing research.…”
Section: The Min-min and Max-min Problemmentioning
confidence: 99%
“…An option here is to use reduction of the constraints defining a tropical polyhedron to MILP constraints. Such reduction was suggested, e.g., in De Schutter, Heemels and Bemporad [6] based on [5]. More precisely, we need to consider constraints of the following two kinds: 1) a T x ≤ α and 2) a T x ≥ α.…”
Section: The Min-min and Max-min Problemmentioning
confidence: 99%
“…In some research papers, sometimes the set of real numbers is augmented with −∞ and in some cases also added with ∞ . Some researchers called tropical algebra max-plus algebra specifically for the case of algebraic structures of real numbers added with −∞ equipped with addition and maximum as the binary operations [13].…”
Section: Preliminariesmentioning
confidence: 99%