We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.

Given a spatial system of clients' demand functions, this paper proposes solution methods to determine the price(s), the number, the locations, the sizes, and the market areas of the plants supplying the clients in order to maximize the profit of the firm. Three alternative spatial price...