Abstract
In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of the stationary points, we propose a simple central and deep-cut ellipsoid algorithm to solve these problems for the quasiconvex case. Moreover, an elementary convergence proof of this algorithm and some computational results are presented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 39-63 |
| Number of pages | 25 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 89 |
| Issue number | 1 |
| DOIs | |
| State | Published - Apr 1996 |
Keywords
- Ellipsoid algorithm
- Location theory
- Min-max programming
- Quasiconvexity
Fingerprint
Dive into the research topics of 'General models in min-max continuous location: Theory and solution techniques'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS