Both unconstrained and constrained minimax single facility location problems are considered in multidimensional space with Chebyshev distance. A new solution approach is proposed within the framework of idempotent algebra to reduce the problems to solving linear vector equations and minimizing functionals defined on some idempotent semimodule. The approach offers a solution in a closed form tha...

Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of ‘Idempotent Mathematics’ with an emphasis on matrix theory, interval analysis over idempotent semirings is developed. The theory is applied to construction of exact interval solutions to the interval discrete stationa...

A categorical equivalence between algebraic contexts with relational morphisms and join-semilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent semirings and allow more efficient computations on finite models because they can be logarithmically smaller than the original semiring. Some example...

Through the matrix rank method, this paper gives necessary and sufficient conditions for a partitioned matrix to have generalized inverses with Banachiewicz-Schur forms. In addition, this paper investigates the idempotency of generalized Schur complements in a partitioned idempotent matrix.

Minimax single facility location problems in multidimensional space with Chebyshev distance are examined within the framework of idempotent algebra. The aim of the study is twofold: first, to give a new algebraic solution to the location problems, and second, to extend the area of application of idempotent algebra. A new algebraic approach based on investigation of extremal properties of eigenv...

New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematic and uses Max-Plus idempotent semiring. Problem of finding longest increasing subsequence is reformulated in a matrix form and solved with linear algebra.

We develop some new topological tools to study maximal subgroups of free idempotent generated semigroups. As an application, we show that the rank 1 component of the free idempotent generated semigroup of the biordered set of a full matrix monoid of size n×n,n > 2 over a division ring Q has maximal subgroup isomorphic to the multiplicative subgroup of Q.

Through the matrix rank method, this paper gives necessary and sufficient conditions for a partitioned matrix to have generalized inverses with Banachiewicz-Schur forms. In addition, this paper investigates the idempotency of generalized Schur complements in a partitioned idempotent matrix.

for a fixed positive integer , we say a ring with identity is n-generalized right principally quasi-baer, if for any principal right ideal of , the right annihilator of is generated by an idempotent. this class of rings includes the right principally quasi-baer rings and hence all prime rings. a certain n-generalized principally quasi-baer subring of the matrix ring are studied, and connections...