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.