Locally uniformly non- Orlicz spaces
Given the probability measure over the given region , we consider the optimal location of a set composed by points in in order to minimize the average distance (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...
Given the probability measure ν over the given region , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...
Let be a non-negative matrix. Denote by the supremum of those that satisfy the inequality where and and also is an increasing, non-negative sequence of real numbers. If , we use instead of . In this paper we obtain a Hardy type formula for , where is a Hausdorff matrix and . Another purpose of this paper is to establish a lower bound for , where is the Nörlund matrix associated with the sequence and . Our results generalize some works of Bennett, Jameson and present authors....