A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem

G. O. Wesolowsky and R. F. Love
Additional contact information
G. O. Wesolowsky: McMaster University, Hamilton, Ontario
R. F. Love: University of Wisconsin, Madison

Management Science, 1972, vol. 18, issue 11, 656-663

Abstract: This paper provides a method for approximating optimal location in a multi-facility Weber problem where rectangular distances apply. Optimality is achieved when the sum of weighted distances is minimized. Two upper bounds on the error incurred by using the approximation are developed. The formulation can be used in convex programming to solve some nonlinearly constrained problems.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.11.656 (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:ormnsc:v:18:y:1972:i:11:p:656-663

Access Statistics for this article

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