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)
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.3182/20020721-6-ES-1901.00513 |
| Uncontrolled Keywords: | Discrete event dynamic systems; Optimization problems; Complementarity problems; Algorithms; Mathematical programming |
| Subjects: | Q Science > QA Mathematics T Technology > TJ Mechanical engineering and machinery |
| Research Area: | Computer Science and Applications |
| Depositing User: | Professor Alberto Bemporad |
| Date Deposited: | 27 Jul 2011 09:07 |
| Last Modified: | 08 Aug 2011 08:09 |
| URI: | http://eprints.imtlucca.it/id/eprint/587 |
Actions (login required)
 |
Edit Item |
