Optimal Positioning of Service Stations

Аннотация

An effective new algorithm is presented for positioning service stations for calls which come from a subset of the line. The coordinate of a call is a random quantity which has a distribution density with compact support. The asymptotic second order optimality of this algorithm is found. A necessary optimality condition of positioning stations for a family of optimality criteria is also found.