General models in min-max continuous location: Theory and solution techniques

J. B.G. Frenk; J. Gromicho; S. Zhang

doi:10.1007/BF02192640

General models in min-max continuous location: Theory and solution techniques

J. B.G. Frenk, J. Gromicho, S. Zhang

Industrial and Systems Engineering

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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	https://doi.org/10.1007/BF02192640
State	Published - Apr 1996

Keywords

Ellipsoid algorithm
Location theory
Min-max programming
Quasiconvexity

Access

10.1007/BF02192640

OpenUrl availability

Full text

Cite this

@article{d86960037baf4950b498a187d87a5954,

title = "General models in min-max continuous location: Theory and solution techniques",

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.",

keywords = "Ellipsoid algorithm, Location theory, Min-max programming, Quasiconvexity",

author = "Frenk, {J. B.G.} and J. Gromicho and S. Zhang",

year = "1996",

month = apr,

doi = "10.1007/BF02192640",

language = "English (US)",

volume = "89",

pages = "39--63",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - General models in min-max continuous location

T2 - Theory and solution techniques

AU - Frenk, J. B.G.

AU - Gromicho, J.

AU - Zhang, S.

PY - 1996/4

Y1 - 1996/4

N2 - 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.

AB - 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.

KW - Ellipsoid algorithm

KW - Location theory

KW - Min-max programming

KW - Quasiconvexity

UR - http://www.scopus.com/inward/record.url?scp=0030539473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030539473&partnerID=8YFLogxK

U2 - 10.1007/BF02192640

DO - 10.1007/BF02192640

M3 - Article

AN - SCOPUS:0030539473

SN - 0022-3239

VL - 89

SP - 39

EP - 63

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

IS - 1

ER -

General models in min-max continuous location: Theory and solution techniques

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this