A Warehouse-Location Problem

William Baumol and Philip Wolfe
Additional contact information
Philip Wolfe: The Rand Corporation, Santa Monica, California

Operations Research, 1958, vol. 6, issue 2, 252-263

Abstract: This paper describes a method for determining a more profitable geographic location pattern for the warehouses that are employed by a firm in delivering known quantities of its finished product to its customers, where the number of warehouses is also permitted to vary. It is shown that this can normally be expected to be a concave minimization problem. Unfortunately, there are usually no practical computational methods for determining the values of the variables that correspond to the absolute minimum of a concave cost function. However, a local optimum can be determined by a method described in the article. The method involves a sequence of transportation computations that are shown to converge to the solution. An illustrative small scale computation is included. An appendix explains in intuitive terms the nature of the computational difficulties that arise in a concave-programming problem.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.2.252 (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:6:y:1958:i:2:p:252-263

Access Statistics for this article

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