An iterative method for solving the Weber problem in Rˆ2 with l-1 and l-2 norms, based on linear programming

An iterative method for solving the Weber problem in Rˆ2 with l-1 and l-2 norms, based on linear programming

0.00 Avg rating0 Votes
Article ID: iaor200971937
Country: Belgium
Volume: 14
Issue: 1
Start Page Number: 137
End Page Number: 152
Publication Date: Jun 2000
Journal: Studies in Locational Analysis
Authors: , ,
Keywords: Weber problem
Abstract:

In this paper, a new approximation between round norms and block norms, characterized by the unit polytope in Rˆ2, permits the development of an iterative procedure in order to give an approximate solution to the generalized Weber problem through linear programming.

Reviews

Required fields are marked *. Your email address will not be published.