scientific article; zbMATH DE number 1159493
In the study of optimal scheduling and pole assignment of discrete event dynamic systems, there exists a problem: how to find the simplest form for the following formula \[ z=\bigoplus_{j=1}^{q} \beta_{j}\prod_{i=1}^{n} \alpha_{ij}^{M_{i}}, \] where \(\alpha_{ij}\) and \(\beta_{j}\) are constant and \(M_{i}\) are variable. Noting \(a\oplus b=\max (a,b)\) and \(a\cdot b=a+b\) in a max-algebra, the formula (1) can be written as \[ z=\max_{1\leq j\leq q} \{\sum_{i=1}^{n} \alpha_{ij} M_{i}+\beta_{j}\}. \] When \(n=1\), the above problem is to find the top boundary of the polygon formed by the \(q\) semi-linear. When \(n>1\), the author presents an algorithm for solving the above problem.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391902)
