Abstract
In the paper we consider following bilevel mixed integer problem. The upper problem (level one) is a simple plant location problem with additional condition for product distribution. The lower problem (level two) is a knapsack problem with continuous variables. It is shown that initial problem can be reduced to series of simple plant location problems. The reduction allows to get lower bound for objective function and design exact and approximate algorithms. Computational results and further research directions are discussed.
This work was supported by the grant 95-01-00989 of the Russian Foundation of Fundamental Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Krarup, P.Pruzan, Simple plant location problem, survey and synthesis,European J. of Operational Research, 12(1983), 36–81.
O.Ben-Ayed, Bilevel linear programming,Computers and Operations Research, 20(1993), 485–501.
P.Hansen, B.Jaumard and G.Savard, New branch-and-bound rules for linear bilevel programming,SIAM J. of Scientific and Statistical Computing, 13(1992), 1194–1217.
D.Erlenkotter, A dual-based procedure for uncapacitated facility location,Operations Research, 26(1978), 992–1009.
O.Bilde, J. Krarup Sharp lower bounds and efficient algorithms for the simple plant location problem,Annals of Discrete Mathematics, 1(1977), 79–97.
V.Beresnev, E.Gimadi and V.Dement’yev, Standardization extremal problems, Novosibirsk, Nauka, 1978, (in Russian).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kochetov, Y., Alexandrov, D. (1997). Simple plant location problem with partial external finance: lower bound, heuristic and exact solution. In: Operations Research Proceedings 1996. Operations Research Proceedings, vol 1996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60744-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-60744-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62630-5
Online ISBN: 978-3-642-60744-8
eBook Packages: Springer Book Archive