Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects

B. Schutter, de, W.P.M.H. Heemels, A. Bemporad

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelProceedings of the 15th Triennial World Congress of the International Federation of Automatic Control(IFAC202), 21-26 June 2002, Barcelona, Spain
Aantal pagina's6
StatusGepubliceerd - 2002
Evenement15th World Congress of the International Federation of Automatic Control, 2002 - Barcelona, Spanje
Duur: 21 jul 200226 jul 2002
Congresnummer: 15

Congres

Congres15th World Congress of the International Federation of Automatic Control, 2002
Verkorte titelIFAC 2002
LandSpanje
StadBarcelona
Periode21/07/0226/07/02
AnderIFAC 15th Triennial World Congress, Barcelona, Spain

Vingerafdruk Duik in de onderzoeksthema's van 'Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects'. Samen vormen ze een unieke vingerafdruk.

Citeer dit