Technical Note—Solving Constrained Multi-Facility Location Problems Involving l p Distances Using Convex Programming

Robert F. Love and James G. Morris
Additional contact information
Robert F. Love: University of Wisconsin, Madison, Wisconsin
James G. Morris: Kent State University, Kent, Ohio

Operations Research, 1975, vol. 23, issue 3, 581-587

Abstract: A method is described for approximating nondifferentiable convex minimization problems occurring in location theory by differentiable problems. Distances are generalized to l p distances that include rectangular and Euclidean distances as special cases. Any number of linear and/or nonlinear constraints can be accommodated. The method utilizes a hyperbolic distance function that is uniformly convergent to each l p distance. Computational results are reported.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.3.581 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:3:p:581-587

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().