Dynamic location - allocation systems: some basic planning strategies
The general location - allocation problem is defined. Then various generalizations of the problem are indicated. The dynamic extension of the location-allocation problem is shown to be of especial interest and significance. Two major approaches to the formulation and analysis of this dynamic problem are discussed. The first approach makes no attempt to anticipate future events and thus leads over the long-run to sub-optimal solutions. The second approach attempts fully to anticipate the future, and is formalized as a dynamic program. This second approach guarantees full optimality over the range of definition of the problem. Some numerical examples are presented.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:pio:envira:v:3:y:1971:i:1:p:73-82. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.