A multi-facility minimax location method for Euclidean distances
- 1 January 1973
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 11 (1) , 37-45
- https://doi.org/10.1080/00207547308929944
Abstract
The problem of optimally locating any number of new facilities in relation to any number of existing facilities is considered where the minimax criterion is to be satisfied. Costs in the system are proportional to the Euclidean distances between all pairs of new facilities and all pairs of new and existing facilities. A new non-linear programming solution method is presented and three numerical examples are given with computation results.Keywords
This publication has 8 references indexed in Scilit:
- An Extended Theorem for Location on a NetworkJournal of the Operational Research Society, 1967
- Letter to the Editor—Some Aspects of a Minimax Location ProblemOperations Research, 1967
- The Convex Simplex MethodManagement Science, 1967
- A NOTE ON THE CONVEXITY OF THE PROBLEM OF SITING DEPOTSInternational Journal of Production Research, 1967
- Optimum Locations on a Graph with Probabilistic DemandsOperations Research, 1966
- Minimax Detection Station PlacementOperations Research, 1965
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964