TY  - CHAP
AV  - none
SN  - 978-3-902661-74-6
EP  - 6
ID  - eprints587
N2  - 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 integer linear programming algorithms, and regular LCP algorithms. We also apply these three methods to a basic max-plus-algebraic benchmark problem.
TI  - Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects
Y1  - 2002///
M1  - 15
UR  - http://www.ifac-papersonline.net/Detailed/26144.html
A1  - De Schutter, Bart
A1  - Heemels, W.P.M.H.
A1  - Bemporad, Alberto
PB  - IFAC
T2  - 15th IFAC World Congress
KW  - Discrete event dynamic systems; Optimization problems; Complementarity problems; Algorithms; Mathematical programming
ER  -