A new algebraic solution to multidimensional minimax location problems with Chebyshev distance

Publication date 17 October 2012

Numerical mathematical programming methods (65K05) Semifields (12K10) Max-plus and related algebras (15A80) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Continuous location (90B85)

Abstract: 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 that actually involves performing matrix-vector multiplications in terms of idempotent algebra for appropriate matrices and vectors. To illustrate the solution procedures, numerical and graphical examples of two-dimensional problems are given.

This page was built for publication: A new algebraic solution to multidimensional minimax location problems with Chebyshev distance

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