Technical report bds : 01 - 15 Max - plus - algebraic problems and the extended linear complementarity problem – Algorithmic aspects ∗
نویسنده
چکیده
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.
منابع مشابه
Max-plus-algebraic Problems and the Extended Linear Complementarity Problem - Algorithmic Aspects
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 (L...
متن کاملApplications of the Extended Linear Complementarity Problem in the Max-plus Algebra
The max-plus algebra is one of the frameworks that can be used to model discrete event systems. We show that many fundamental problems in the maxplus algebra can be reformulated as a mathematical programming problem: the Extended Linear Complementarity Problem.
متن کاملThe singular value decomposition in the extended max algebra is an extended linear complementarity problem ∗
We show that the problem of finding a singular value decomposition of a matrix in the extended max algebra can be reformulated as an Extended Linear Complementarity Problem. This allows us to compute all the max-algebraic singular value decompositions of a matrix. This technique can also be used to calculate many other max-algebraic matrix decompositions.
متن کاملThe Extended Linear Complementarity Problem Andits Applications in the Max - plus Algebra
In this paper we give a survey of our research on the Extended Linear Complemen-tarity Problem (ELCP). First we discuss the link between the ELCP and other generalizations of the Linear Complementarity Problem, and we present an algorithm to nd all the solutions of an ELCP. Next we introduce the max-plus algebra and show how it can be used to model a certain class of discrete event systems. Fin...
متن کاملbds : 01 - 13 Properties of MPC for max - plus - linear systems ∗
Model predictive control (MPC) is a very popular controller design method in the process industry. One of the main advantages of MPC is that it can handle constraints on the inputs and outputs. Usually MPC uses linear discrete-time models. Recently we have extended this framework to max-plus-linear discrete event systems. In this paper we further explore this topic. More specifically, we focus ...
متن کامل