Related papers: An algebraic approach to multidimensional minimax …
Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is…
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…
We consider location problems to find the optimal sites of placement of a new facility, which minimize the maximum weighted Chebyshev or rectilinear distance to existing facilities under constraints on a feasible location domain. We examine…
We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian…
We present a multidimensional optimization problem that is formulated and solved in the tropical mathematics setting. The problem consists of minimizing a nonlinear objective function defined on vectors over an idempotent semifield by means…
A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…
Linear vector equations and inequalities are considered defined in terms of idempotent mathematics. To solve the equations, we apply an approach that is based on the analysis of distances between vectors in idempotent vector spaces. The…
An approach to schedule development in project management is developed within the framework of idempotent algebra. The approach offers a way to represent precedence relationships among activities in projects as linear vector equations in…
In many scientific applications the solution of non-linear differential equations are obtained through the set-up and solution of a number of successive eigenproblems. These eigenproblems can be regarded as a sequence whenever the solution…
Finding the distance to singularity for a matrix is a ubiquitous problem in numerical linear algebra, and is elegantly solved by the Eckart-Young-Mirsky theorem. Its structured variant naturally emerges when one considers structured…
We consider multicriteria problems of evaluating absolute ratings (scores, priorities, weights) of given alternatives for making decisions, which are compared in pairs under several criteria. Given matrices of pairwise comparisons of…
Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…
We study some convergence issues for a recent approach to the problem of transparent boundary conditions for the Helmholtz equation in unbounded domains. The approach is based on the minimization on an integral functional which arises from…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
In traditional facility location problems, a set of points is provided, and the objective is to determine the best location for a new facility based on criteria such as minimizing cost, time, and distances between clients and facilities.…
We solve by Chebyshev spectral collocation some genuinely nonlinear Liouville-Bratu-Gelfand type, 1D and a 2D boundary value problems. The problems are formulated on the square domain $[-1, 1]\times[-1, 1]$ and the boundary condition…
This paper deals with a bilevel approach of the location-allocation problem with dimensional facilities. We present a general model that allows us to consider very general shapes of domains for the dimensional facilities and we prove the…
The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility…
We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…