%I IFAC
%V 15
%T Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects
%R 10.3182/20020721-6-ES-1901.00513
%J Proc. IFAC World Congress
%B 15th IFAC World Congress
%X 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.
%L eprints587
%D 2002
%A Bart De Schutter
%A W.P.M.H. Heemels
%A Alberto Bemporad
%K Discrete event dynamic systems; Optimization problems; Complementarity problems; Algorithms; Mathematical programming