The least upper bound of content for realizable matrices on lattice \([0,1]\)
This paper was first presented in BUSEFAL 43, 26-31 (1990). It deals with the max-min decomposition \(B=AA^T\) of a symmetric matrix \(B\) over the semiring \(([0,1],\max,\min)\) [cf. \textit{W. J. Liu}, The realizable problem for an \(F\)-symmetric matrix, Fuzzy Math. (China) 1, 69-75 (1982)]. The author improves recent estimations of the content of a decomposable matrix [cf. e.g. \textit{X. Y. Xue}, BUSEFAL 26, 67-74 (1986; Zbl 0606.15009)] and presents an algorithm for the extremal decomposition. Further results on the decompositions of symmetric matrices were presented by \textit{H. X. Wang} [J. Fuzzy Math. 2, No. 3, 477-494 (1994; Zbl 0819.15013)].
scientific article; zbMATH DE number 1022518