The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 5561 – 5580 of 13227

Showing per page

Long-term planning versus short-term planning in the asymptotical location problem

Alessio Brancolini, Giuseppe Buttazzo, Filippo Santambrogio, Eugene Stepanov (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Given the probability measure ν over the given region Ω n , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance Σ Ω dist ( x , Σ ) d ν (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...

Long-term planning versus short-term planning in the asymptotical location problem

Alessio Brancolini, Giuseppe Buttazzo, Filippo Santambrogio, Eugene Stepanov (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Given the probability measure ν over the given region Ω n , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance Σ Ω dist ( x , Σ ) d ν (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...

Lower bound and upper bound of operators on block weighted sequence spaces

Rahmatollah Lashkaripour, Gholomraza Talebi (2012)

Czechoslovak Mathematical Journal

Let A = ( a n , k ) n , k 1 be a non-negative matrix. Denote by L v , p , q , F ( A ) the supremum of those L that satisfy the inequality A x v , q , F L x v , p , F , where x 0 and x l p ( v , F ) and also v = ( v n ) n = 1 is an increasing, non-negative sequence of real numbers. If p = q , we use L v , p , F ( A ) instead of L v , p , p , F ( A ) . In this paper we obtain a Hardy type formula for L v , p , q , F ( H μ ) , where H μ is a Hausdorff matrix and 0 < q p 1 . Another purpose of this paper is to establish a lower bound for A W N M v , p , F , where A W N M is the Nörlund matrix associated with the sequence W = { w n } n = 1 and 1 < p < . Our results generalize some works of Bennett, Jameson and present authors....

Currently displaying 5561 – 5580 of 13227