Since many important firms operate several plants, the problem of the choice of an optimal pattern of locations for these plants is of interest. In this paper, multiplant location without interaction is studied. It is shown that it is sufficient to consider a finite number of particular sites to obtain an optimal pattern of plants. The distribution network of the output is then analysed, taking into account the technologies of the plants. Finally, a numerical method of resolution for the multiplant location problem, with increasing returns to scale in the production, is proposed.
Get full access to this article
View all access options for this article.
References
1.
BalinskiM L, 1964“On finding integer solutions to linear programs”IBM Data Processing Division225–248
2.
BeckensteinA R, 1975“Scale economies in the multiplant firm: theory and empirical evidence”The Bell Journal of Economics6644–657
3.
CooperL, 1967“Solutions of generalized locational equilibrium problems”Journal of Regional Science71–18
DearingD MFrancisR L, 1974“A minimax location problem on a network”Transportation Science8333–343
6.
EfroymsonM ARayT L, 1966“A branch-and-bound algorithm for plant location”Operations Research14361–368
7.
GeoffrionA MGravesG W, 1974“Multicommodity distribution system design by Benders decomposition”Management Science20822–844
8.
HananMKurtzbergJ M, 1972“A review of the placement and quadratic assignment problem”SIAM Review14324–342
9.
HansenP, 1972“Two algorithms for the simple plant location problem using additive penalties”paper presented at the European Meeting of the Econometric Society, Budapest, Hungary
10.
HansenPKaufmanL, 1972“Comparaison d'algorithmes pour le problème de la localisation des entrepôts” in Operational Research in Industrial Systems Ed. BrennanJ (English Universities Press, London) pp 281–294
11.
KaufmanLVan den EedeMHansenP, 1977Operational Research Quarterly forthcoming
12.
KhumawalaB M, 1972“An efficient branch-and-bound algorithm for the warehouse location problem”Management Science18 B-718-B-733
13.
KoopmansT CBeckmannM, 1957“Assignment problems and the location of economic activities”Econometrica2553–76
14.
KuenneR ESolandR M, 1972“Exact and approximate solutions to the multi-source Weber problem”Mathematical Programming3193–209
15.
LantnerR, 1973“Un modèle de localisation de la firme au sein de la branche d'activité” thèse complémentaire, University of Dijon, Dijon, France
16.
LawlerE L, 1975“The quadratic assignment problem: a brief review” in Combinatorial Programming: Methods and Applications Ed. RoyB (Reidel, Dordrecht—Holland) pp 351–360
17.
LevyJ, 1967“An extended theorem for location on a network”Operational Research Quarterly18433–443
18.
ManneA S, 1964“Plant location under economies of scale-decentralization and computation”Management Science11213–235
19.
ManneA S, Ed., 1967Investments For Capacity Expansion: Size, Location and Time Phasing (MIT Press, Cambridge, Mass)
20.
PierceJ FCrowstonW, 1971“Tree-search algorithms for quadratic assignment problems”Naval Research Logistics Quarterly181–36
21.
ScottA J, 1971“Operational analysis of nodal hierarchies in network systems”Operational Research Quarterly2225–37
22.
SpielbergK, 1969a“Algorithms for the simple plant location problem with some side-conditions”Operations Research1785–111
23.
SpielbergK, 1969b“Plant location with generalized search origin”Management Science16165–178
24.
SpielbergK, 1970“On solving plant location problems” in Applications of Mathematical Programming Ed. BealeE M L (English Universities Press, London) pp 216–234
25.
TeitzM, 1968“Locational strategies for competitive systems”Journal of Regional Science8135–148
26.
ThisseJ, 1975Contribution à la Théorie Microéconomique SpatialePhD thesis, University of Liège, Liège, Belgium
27.
ThisseJPerreurJ, 1977“Relations between the point of maximum profit and the point of minimum total transportation cost: a restatement”Journal of Regional Science forthcoming
28.
WagnerJ LFalksonL M, 1975“The optimal nodal location of public facilities with price-sensitive demand”Geographical Analysis769–83
29.
WendellR EHurterA P, 1973“Optimal locations on a network”Transportation Science718–33
30.
ZimmermanR, 1967“A branch and bound algorithm for depot location”Metra6661–674
