eprintid: 587
rev_number: 12
eprint_status: archive
userid: 7
dir: disk0/00/00/05/87
datestamp: 2011-07-27 09:07:50
lastmod: 2011-08-08 08:09:47
status_changed: 2011-07-27 09:07:50
type: book_section
metadata_visibility: show
contact_email: alberto.bemporad@imtlucca.it
item_issues_count: 0
creators_name: De Schutter, Bart
creators_name: Heemels, W.P.M.H.
creators_name: Bemporad, Alberto
creators_id: 
creators_id: 
creators_id: alberto.bemporad@imtlucca.it
title: Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects
ispublished: pub
subjects: QA
subjects: TJ
divisions: CSA
full_text_status: none
keywords: Discrete event dynamic systems; Optimization problems; Complementarity problems; Algorithms; Mathematical programming
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 integer linear programming algorithms, and regular LCP algorithms. We also apply these three methods to a basic max-plus-algebraic benchmark problem.
date: 2002
date_type: published
publication: Proc. IFAC World Congress
volume: 15
publisher: IFAC
pages: 6
event_dates: Barcelona
id_number: 10.3182/20020721-6-ES-1901.00513
refereed: TRUE
isbn: 978-3-902661-74-6
book_title: 15th IFAC World Congress
official_url: http://www.ifac-papersonline.net/Detailed/26144.html
citation:   De Schutter, Bart and Heemels, W.P.M.H. and Bemporad, Alberto  Max-plus-algebraic problems and the extended linear complementarity problem - algorithmic aspects.   In:  15th IFAC World Congress.   IFAC.  ISBN 978-3-902661-74-6      (2002)