Abstract
We show that certain resource optimization problems relative to timed event-graphs reduce to linear programs. The auxiliary variables which allow this reduction can be interpreted in terms of eigenvectors in the (min, +) algebra.
| Original language | English |
|---|---|
| Pages (from-to) | 1931-1934 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 40 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 1 Jan 1995 |