A simplex-like method to compute the eigenvalue of an irreducible \((\max,+)\)-system
An alternative method to compute the eigenvalue of an irreducible \((\text{max},+)\) system is presented. The method resembles the simplex method in linear programming in the sense that the eigenvalue and a corresponding eigenvector are obtained by going along the boundary of a polygon-like set, while increasing the number of equalities in some eigenvalue-eigenvector expression, until only equalities are left over.
scientific article; zbMATH DE number 1623822