General models in min-max continous location
April 1996
Article
volume 89 pp 39-63.
| Related Files |
|---|
View PDF Version
(General_Models_MinMax_Continious.pdf, 1.1MB) |
In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of th 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.
Keywords
Automatically Extracted Terms
- 0.0
- function
- 0.0000
- problem
- algorithm
- point
- lipschitz
- ellipsoid
- result
- location
- april
- 2.1
- 0.1
- theorem
- ellipsoid algorithm
- 3.0
- 1.1
- 1.5
- operations research
- 1.9
