Numerical analysis of generalised max-plus eigenvalue problems

摘要

This paper is concerned with the deterministic discrete-time infinite horizon optimisation problem on a compact metric space with an average cost criterion involving two functions K (the “cost”) and T (the “time”). Firstly, we collect the different characterisations of the value λ in terms of generalised max-plus eigenvalue problem and in terms of linear programming. Secondly, we prove an error bound on λ when the space is discretised.