Solving linear equations over maxmin-ω systems

Maxmin-ω dynamical systems were previously introduced as an “all-in-one package” that can yield a solely min-plus, a solely max-plus, or a max-min-plus dynamical system by varying a parameter ω ∈ ( 0 , 1 ] . With such systems in mind, it is natural to introduce and consider maxmin-ω linear systems of equations of the type A ⊗ ω x = b . However, to our knowledge, such maxmin-ω linear systems have not been studied before and in this paper we present an approach to solve them. We show that the problem can be simplified by performing normalization and then generating a “canonical” matrix which we call the principal order matrix. Instead of directly trying to find the solutions, we search the possible solution indices which can be identified using the principal order matrix and the parameter ω. The fully active solutions are then immediately obtained from these solution indices. With the fully active solutions at hand, we then present the method to find other solutions by applying a relaxation, i.e., increasing or decreasing some components of fully active solutions. This approach can be seen as a generalization of an approach that could be applied to solve max-plus or min-plus linear systems. Our results also shed more light on an unusual feature of maxmin-ω linear systems, which, unlike in the usual linear algebra, can have a finite number of solutions in the case where their solution is non-unique.