Abstract
The facility location problem is one of the most widely studied discrete location problems, whose applications arise in a variety of settings, such as routers or servers in a communication network, warehouses or distribution centres in a supply chain, hospitals or airports in a public service system. The problem involves locating a number of facilities to minimize the sum of the fixed setup costs and the variable costs of serving the market demand from these facilities. First a dual problem is developed for the facility location problem. Then general optimality conditions are also obtained, which generate sequences globally converging to a primal and dual solutions, respectively.
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
References
Aardal, K.: Capacitated facility location: separation algorithms and computational experience. Math. Program. 81, 149–175 (1998)
Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf. Process. Lett. 72, 161–167 (1999)
Ageev, A.A.: Improved approximation algorithms for multilevel facility location problems. Oper. Res. Lett. 30, 327–332 (2002)
Ageev, A., Ye, Y., Zhang, J.: Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J. Discrete Math. 18, 207–217 (2005)
Balinski, M.L.: Integer programming: methods, uses, computation. Manag. Sci. 12, 253–313 (1965)
Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1–25 (2003)
Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 1991, 280–297 (1991)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31, 228–248 (1999)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor revealing LP. J. ACM 50, 795–824 (2003)
Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274–296 (2001)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33, 544–562 (2004)
Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146–188 (2000)
Gao, D.Y.: Duality Principles in Nonconvex Systems: Theory, Methods and Applications. Kluwer Academic, Dordrecht (2000)
Acknowledgements
Dr. Ning Ruan was supported by a funding from the Australian Government under the Collaborative Research Networks (CRN) program.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ruan, N. (2015). Solving Facility Location Problem Based on Duality Approach. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-08377-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08376-6
Online ISBN: 978-3-319-08377-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)