Year: 2006
Journal of Computational Mathematics, Vol. 24 (2006), Iss. 4 : pp. 527–538
Abstract
This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under $l_1,l_2$ and $l_\infty$-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2006-JCM-8772
Journal of Computational Mathematics, Vol. 24 (2006), Iss. 4 : pp. 527–538
Published online: 2006-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12
Keywords: Linear variational inequality Various Weber problems Projection-type method Slack technique.