Characterization and algorithm for max-plus supereigenvector problem by parametric programming

From MaRDI portal





This paper considers a supereigenvector problem in max-plus algebra, which focuses on the theoretical and computational aspects of minimum total difference supereigenvectors (MTDSEVs) of max-plus square matrices. The set of all MTDSEVs is identical to the set of all finite vectors satisfying a certain max-plus linear system. This system is easily solved by reducing it to the max-plus eigenvalue problem. Moreover, by modifying Gassner-Klinz algorithm for the parametric assignment problem, the authors compute MTDSEVs with respect to all possible values \(\lambda\).



Cites work









This page was built for publication: Characterization and algorithm for max-plus supereigenvector problem by parametric programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885526)