Journal article
A subgradient procedure for the solution of minimax location problems
Computers & industrial engineering, Vol.2(1), pp.17-25
1978
DOI: 10.1016/0360-8352(78)90004-9
Abstract
Unconstrained planar minimax location problems are typically convex but not everywhere differentiable, thus precluding their solution by gradient techniques. We employ subgradients, which always exist, to the solution of some planar minimax location problems. A heuristic subgradient algorithm is presented for the solution of minimax location problems involving Euclidean and rectilinear distances. An attractive feature of the method is the ease of implementation on any size computer. We give a computational comparison of the algorithm with existing methods. © 1978.
Details
- Title: Subtitle
- A subgradient procedure for the solution of minimax location problems
- Creators
- Donald Hearn - University of FloridaT. J. Lowe - University of Florida
- Resource Type
- Journal article
- Publication Details
- Computers & industrial engineering, Vol.2(1), pp.17-25
- DOI
- 10.1016/0360-8352(78)90004-9
- ISSN
- 0360-8352
- eISSN
- 1879-0550
- Number of pages
- 9
- Grant note
- ENG74-22159; ENG75-10225a / National Science Foundation (http://data.elsevier.com/vocabulary/SciValFunders/100000001) DAHCO4-75-G-0150 / Army Research Office (http://data.elsevier.com/vocabulary/SciValFunders/100000183)
- Language
- English
- Date published
- 1978
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963204602771
Metrics
1 Record Views