Iteration algorithm for solving Ax = b in max–min algebra

摘要

For solving the linear system A ⊗ x = b we introduce some iteration algorithms, where A = (aij) and b = bi a given matrix and a column vector with elements from a Brouwerian lattice, and ⊗ is a max–min composite operation.