Solution of the multisource Weber and conditional Weber problems by D.-C. programming

Operations Research

Volumn 46, Issue 4, 1998, Pages 548-562

  Chen, Pey Chun ^a   Hansen, Pierre ^b   Jaumard, Brigitte ^c   Tuy, Hoang ^d  

^a AT AND T LABS RESEARCH   (United States)

^b HEC MONTRÉAL   (Canada)

^c GERAD   (Canada)

^d INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Facilities equipment planning: continuous location theory; Linear programming: vertex enumeration; Nonlinear programming: d. c. programming, concave minimization, algorithm, application

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; FUNCTIONS; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; STRATEGIC PLANNING; WORLD WIDE WEB;

CONCAVE MINIMIZATION; CONTINUOUS LOCATION THEORY; EQUIPMENT PLANNING; VERTEX ENUMERATION;

OPERATIONS RESEARCH;

EID: 0032114729     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.4.548     Document Type: Article

References (71)

1. AHO, A. V., J. E. HOPCROFT, AND J. D. ULLMAN. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. Avis, D. AND K. FUKUDA. 1992. A Pivoting Algorithm for Convex Hulls and Vertex Enumeration Arrangements and Polyhedra. Discrete and Computational Geometry, 8, 295-313.
3. AVRIEL, M. 1976. Nonlinear Programming: Analysis and Methods. Prentice-Hall, Englewood Cliffs, NJ.
4. BAXTER, J. 1981. Local Optima Avoidance in Depot Location. J. Operational Res. Soc. (U.K.), 32, 815-819.
5. BRANDEAU, M. L. AND S. S. CHIU. 1989. An Overview of Representative Problems in Location Research. Mgmt. Sci. 35, 645-674.
6. CALAMAI, P. H. AND A. R. CONN. 1980. A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances. SIAM J. Sci. Statist. Comput. 1, 512-525.
7. CHARALAMBOUS, C. AND J. W. BANDLER. 1976. Non-linear Optimization as a Sequence of Least p-th Optimization with Finite Values of p. Internat. J. Systems Sci. 7, 377-391.
8. CHEN, P.-C., P. HANSEN, AND B. JAUMARD. 1991. On-line and Off-line Vertex Enumeration by Adjacency Lists. O.R. Letts. 10, 403-409.
9. CHEN, P.-C., P. HANSEN, AND B. JAUMARD. 1992a. Partial Pivoting in Vertex Enumeration. RUTCOR Research Report No. 10-92, RUTCOR, Rutgers University, New Brunswick, NJ.
10. CHEN, P.-C., P. HANSEN, B. JAUMARD, AND H. TUY. 1992b. Weber's Problem with Attraction and Repulsion. J. Regional Sci., 32, 467-486.
11. CHEN, R. 1983. Solution of Minisum and Minimax Location-Allocation Problems with Euclidean Distances. Naval Res. Logist. Q., 30, 449-459.
12. CHEN, R. 1988. Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space. Trans. Sci., 22, 157-160.
13. CHENEY, W. E. AND A. A. GOLDSTEIN. 1959. Newton's Method for Convex Programming and Tchebycheff Approximation. Numer. Math. 1, 253-268.
14. CHIU, S. S. 1987. The Minisum Location Problem on an Undirected Network with Continuous Link Demands. Comput. Oper. Res. 14, 369-383.
15. COOPER, L. 1963. Location-Allocation Problems. Opns. Res. 11, 301-343.
16. COOPER, L. 1964. Heuristic Methods for Location-Allocation Problems. SIAM Rev. 6, 37-53.
17. COOPER, L. 1967. Solutions of Generalized Locational Equilibrium Models. j. Regional Sci. 7, 1-18.
18. DOMSCHKE, W. AND A. DREXL. 1985. Location and Layout Planning: An International Bibliography. Lecture Notes in Economics and Mathematical Systems, No. 238. Springer, New York.
19. DOWLING, P. D. AND R. F. LOVE. 1986. Bounding Methods for Facility Location Algorithms. Naval Res. Logist. Q. 33, 775-787.
20. DREZNER, Z. 1984. The Planar Two-Center and Two-Median Problems. Trans. Sci. 18, 351-361.
21. DREZNER, Z. AND G. O. WESOLOWSKY. 1990. The Weber Problem on the Plane with Some Negative Weights. INFOR, 29, 87-99.
22. DREZNER, Z., A. MEHREZ, AND G. O. WESOLOWSKY. 1991. The Facility Location Problem with Limited Distances. Trans. Sci. 25, 183-187.
23. DREZNER, Z. 1995. Facility Location: A Survey of Applications and Methods. Springer, New York.
24. DYER, M. E. 1983. The Complexity of Vertex Enumeration Methods. Math. O.R. 8, 381-402.
25. EAVES, B. C. AND W. I. ZANGWILL. 1971. Generalized Cutting Plane Algorithms. SIAM J. Control 9, 529-542.
26. EILON, S., C. WATSON-GANDY, AND N. CHRISTOFIDES. 1971. Distribution Management: Mathematical Modeling and Practical Analysis. Griffin, London.
27. FALK, J. E. AND K. L. HOFFMAN. 1976. A Successive Underestimation Method for Concave Minimization Problems. Math. O.R. 1, 251-259.
28. FALK, J. E. AND K. L. HOFFMAN. 1986. Concave Minimization via Collapsing Polytopes. Opns. Res. 34, 919-929.
29. HANSEN, P., J. PERREUR, AND J.-F. THISSE. 1980. Location Theory, Dominance, and Convexity: Some Further Results. Opns. Res. 28, 1241-1250.
30. HANSEN, P., D. PEETERS, D. RICHARD, AND J.-F. THISSE. 1985. The Minisum and Minimax Location Problems Revisited. Opns. Res. 33, 1251-1265.
31. HANSEN, P., M. LABBÉ, D. PEETERS, J.-F. THISSE, AND J. V. HENDERSON. 1987. Systems of Cities and Facility Location. Harwood Academic Publishers, Chur, Switzerland.
32. HOFFMAN, K. L. 1981. A Method for Globally Minimizing Concave Functions Over Convex Sets. Math. Programming, 20, 22-32.
33. HORST, R. 1984. On the Global Minimization of Concave Functions: Introduction and Survey. Opns. Res. Spektrum, 6, 195-205.
34. HORST, R., N. V. THOAI, AND H. TUY. 1987. Outer Approximation by Polyhedral Convex Sets. Opns. Res. Spektrum, 9, 153-159.
35. HORST, R. AND N. V. THOAI. 1989. Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems. Computing, 42, 271-289.
36. HORST, R., N. V. THOAI, AND H. P. BENSON. 1991. Concave Minimization via Conical Partitions and Polyhedral Outer Approximation. Math. Programming, 50, 259-274.
37. HORST, R. AND H. TUY. 1993. Global Optimization: Deterministic Approaches. 2nd Edition. Springer-Verlag, New York.
38. KELLEY, J. E. 1960. The Cutting-Plane Method for Solving Convex Programs. J. SIAM, 8, 703-712.
39. KUENNE, R. E. AND R. M. SOLAND. 1971. The Multisource Weber Problem: Exact Solutions by Branch-and-bound. Institute for Defense Analyses, Economic Series.
40. KUENNE, R. E. AND R. M. SOLAND. 1972. Exact and Approximate Solutions to the Multisource Weber Problem. Math. Programming, 3, 193-209.
41. LABBÉ, M. 1992. The Median Location Problem with Continuous Demand. Cahiers du CERO, 34, 103-115.
42. LIN, C. C. 1975. A Note About the New Emergency Facility Insertion in an Undirected Connected Graph. In Sixth Annual Pittsburgh Conference on Modeling Simulation. Pittsburgh, Pennsylvania.
43. LOVE, R. F. AND H. JUEL. 1982. Properties and Solution Methods for Large Location-allocation Problems. J. Opnl. Res. Soc. (U.K.), 33, 443-452.
44. LOVE, R. F., J. G. MORRIS, AND G. O. WESOLOWSKY. 1988. Facilities Location: Models and Methods. North-Holland, New York.
45. LOVE, R. F. AND P. D. DOWLING. 1989. A Generalized Bounding Method for Multifacility Location Models. Opns. Res. 37, 653-657.
46. MATTHEIS, T. H. AND D. S. RUBIN. 1980. A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets. Math. O.R. 5, 167-185.
47. MEGIDDO, N. AND K. J. SUPOWIT. 1984. On the Complexity of Some Common Geometric Location Problems. SIAM J. Comp. 13, 182-196.
48. MIEHLE, W. 1958. Link-length Minimization in Networks. Opns. Res. 6, 232-243.
49. MINIEKA, E. 1980. Conditional Centers and Medians on a Graph. Networks, 10, 265-272.
50. OSTRESH, L. M., JR. 1973a. TWAIN - Exact Solutions to the Two Source Location-Allocation Problem. In Computer Programs for Location-Allocation Problems. G. Rushton, M. F. Goodchild and L. M. Ostresh Jr. (eds.). Monograph 6. Department of Geography, University of Iowa, Iowa City, IA. 15-28.
51. OSTRESH, L. M., JR. 1973b. MULTI - Exact Solutions to the M-Center Location-Allocation Problem. In Computer Programs for Location-Allocation Problems. G. Rushton, M. F. Goodchild, and L. M. Ostresh Jr. (eds.). Monograph 6. Department of Geography, University of Iowa, Iowa City, IA. 29-53.
52. OSTRESH, L. M., JR. 1973c. An Investigation of the Multiple Location-Allocation Problem. Unpublished Ph.D. Thesis, The University of Iowa, Iowa City, IA.
53. OSTRESH, L. M., JR. 1975. An Efficient Algorithm for Solving the Two Center Location-Allocation Problem. J. Regional Sci. 15, 209-216.
54. OVERTON, M. L. 1983. A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms. Math. Programming, 27, 34-63.
55. PARDALOS, P. M. AND J. B. ROSEN. 1986. Methods for Global Concave Minimization: A Bibliographic Survey. SIAM Review, 28, 367-379.
56. ROCKAFELLAR, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
57. ROSEN, J. B. AND G.-L. XUE. 1991. Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem. ORSA J. Computing, 3, 207-212.
58. ROSING, K. E. 1992. An Optimal Method for Solving the (Generalized) Multi-Weber Problem. Eur. J. Opnl. Res. 58, 414-426.
59. SCOTT, A. J. 1970. Location-Allocation Systems: A Review. Geographical Analysis, 2, 95-119.
60. SULLIVAN, P. J. AND N. PETERS. 1980. A Flexible User Oriented Location Allocation Algorithm. J. Environmental Mgmt. 10, 181-193.
61. TELLIER, L.-N. AND B. POLANSKI. 1989. The Weber Problem: Frequency of Different Solution Types and Extension to Repulsive Forces and Dynamic Processes. J. Regional Sci. 29, 387-405.
62. THACH, P. T. 1988. The Design Centering Problem as a D.C. Programming Problem. Math. Programming, 41, 229-248.
63. THIEU, T. V., B. T. TAM, AND V. T. BAN. 1983. An Outer Approximation Method for Globally Minimizing a Concave Function Over a Compact Convex Set. Acta Mathematica Vietnamica, 8, 21-40.
64. THIEU, T. V. 1985. Implementation of Some Algorithms for Nonconvex Optimization Problems. Lecture Notes of Mathematics, 1405, Springer Verlag, 159-170.
65. TUY, H. 1983. On Outer Approximation Methods for Solving Concave Minimization Problems. Acta Mathematica Vietnamica, 8, 3-34.
66. TUY, H. 1985. A General Deterministic Approach to Global Optimization via D.-C. Programming. In Fermat Days 1985: Mathematics for Optimization. J. B. Hiriart-Urruty (ed.). North-Holland, Amsterdam. 137-162.
67. TUY, H. 1987. Global Minimization of a Difference of Two Convex Functions. Math. Prog. Study, 30, 150-182.
68. VEINOTT, A. F. 1967. The Supporting Hyperplane Method for Unimodal Programming. Opns. Res. 15, 147-152.
69. WEBER, A. 1909. Über den Standort der Industrien. Tübingen. Translated as Alfred Weber's Theory of the Location of Industries. University of Chicago, Chicago, IL.
70. WEISZFELD, E. 1937. Sur le Point Pour Lequel la Somme des Distances de n Points Donnés est Minimum. Tôhoku Mathematical J. 43, 355-386.
71. XUE, G. L., J. B. ROSEN, AND P. M. PARDALOS. 1992. A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. In Integer Programming and Combinatorial Optimization. E. Balas, G. Cornuejols and R. Kannan (eds.). Carnegie-Mellon University Press, Pittsburgh, PA. 227-236.