×

zbMATH — the first resource for mathematics

Solving general continuous single facility location problems by cutting planes. (English) Zbl 0608.90022
A unified cutting plane method is proposed to solve a large class of continuous single facility location problems. These include both minisum and minimax problems with mixed norms and convex transportation costs. The method provides an easy stopping rule and permits the post optimal determination of an outer approximation to near optimality regions. Two examples are given which show the power of the method. Extensive computational results in dimension two and higher are reported.

MSC:
90B05 Inventory, storage, reservoirs
90C90 Applications of mathematical programming
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chandrasekaran, R.; Pacca, M.J.A.P., Weighted MIN-MAX location problems: polynomially bounded algorithms, Opsearch, 17, 4, 172-180, (1980) · Zbl 0453.90030
[2] Cheney, E.W.; Goldstein, A.A., Newton’s method of convex programming and Tchebycheff approximation, Numerische Mathematik, 1, 253-268, (1959) · Zbl 0113.10703
[3] Drezner, Z., On minimax optimization problems, Mathematical programming, 22, 227-230, (1982) · Zbl 0473.90067
[4] Dyer, M.E.; Proll, L.G., An improved vertex enumeration algorithm, European journal of operational research, 9, 359-368, (1982) · Zbl 0477.90035
[5] Eilon, S.; Watson-bandy, C.D.T.; Christofides, N., ()
[6] Elzinga, D.J.; Hearn, D.W., The minimum covering sphere problem, Management science, 19, 96-104, (1972) · Zbl 0242.90061
[7] Eyster, J.W.; White, J.A.; Wierwille, W.W., On solving multifacility location problems using a hyperboloid approximation procedure, Transactions of the AIEE, 5, 1-6, (1973)
[8] Francis, R.L.; Goldstein, J.M., Location theory: A selective bibliography, Operations research, 22, 400-410, (1974) · Zbl 0274.90028
[9] Halpern, J., The location of a center-Median convex combination on an undirected tree, Journal of regional science, 16, 237-245, (1976)
[10] Hansen, P.; Peeters, D.; Richard, D.; Tlilsse, J.F., The minisum and minimax location problems revisited, Operations research, 33, 1251-1265, (1985) · Zbl 0582.90027
[11] Himmelblau, D.M., Applied nonlinear programming, () · Zbl 0521.93057
[12] Jacobsen, S.K., An algorithm for the minimax Weber problem, European journal of operational research, 6, 1, 144-148, (1981) · Zbl 0452.90024
[13] Juel, H.; Love, R.F., Fixed point optimality criteria for the Weber problem with arbitrary norms, Journal of the operational research society, 32, 891-897, (1981) · Zbl 0463.90035
[14] Kelley, J.E., The cutting plane method for solving convex programs, Journal of SIAM, 8, 703-712, (1960) · Zbl 0098.12104
[15] Kuhn, H.W., A note on Fermat’s problem, Mathematical programming, 4, 98-107, (1973) · Zbl 0255.90063
[16] Kuhn, H.W.; Kuenne, E., An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economies, Journal of regional science, 4, 21-23, (1962)
[17] Love, R.F.; Yeong, W.Y., A rational stopping rule for facilities location algorithms, AIIE transactions, 13, 357-362, (1981)
[18] Morris, J.G., Convergence on the weiszfeld algorithm for Weber problems using a generalized ‘distance’ function, Operations research, 29, 37-48, (1981) · Zbl 0452.90023
[19] Plastria, F., A vertex-optimality criterion for the Weber problem with mixed norms and convex transportation costs, ()
[20] Plastria, F., Testing whether a cutting plane constraint may be dropped, Revue belge de statistique, d’informatique et de recherche opérationelle, 22, 4, 11-21, (1982) · Zbl 0517.90060
[21] Plastria, F., Lower subdifferentiable functions and their minimization by cutting planes, Journal of optimization theory, and applications, 46, 1, 37-53, (1985) · Zbl 0542.90083
[22] Plastria, F., Localization in single facility location, European journal of operational research, 18, 2, 215-219, (1984) · Zbl 0546.90031
[23] Plastria, F., Continuous location problems and cutting plane algorithms, () · Zbl 0621.90079
[24] Ward, J.E.; Wendell, R.E., Using block norms for location modelling, Operations research, 33, 1074-1090, (1985) · Zbl 0582.90026
[25] Weber, A.; Friedrich, C.J., Über den standort den industrien, “Tübingen 1909”, (), translated as
[26] Weiszfeld, E., Sun le point pour lequel la somme des distances de to points donnés est minimum, Tohoku mathematical journal, 43, 355-386, (1936-1937) · Zbl 0017.18007
[27] Wendell, R.E.; Hurter, A.P., Location theory, dominance and convexity, Operations research, 21, 314-320, (1973) · Zbl 0265.90040
[28] Wolfe, P., Convergence theory in nonlinear programming, (), 1-36
[29] Plastria, F., The minimization of lower subdifferentiable functions under nonlinear constraints: an all feasible cutting plane algorithm, Journal of optimization theory and applications, (1986) · Zbl 0621.90079
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.