id: 04029277
dt: j
an: 04029277
au: Drezner, Zvi
ti: On the complexity of the exchange algorithm for minimax optimization
    problems.
so: Math. Program. 38, 219-222 (1987).
py: 1987
pu: Springer-Verlag, Berlin
la: EN
cc: 
ut: location; minimax optimization; convex functions
ci: 
li: doi:10.1007/BF02604643
ab: We present an exchange algorithm for the solution of minimax optimization
    problems involving convex functions. For a certain class of functions,
    the complexity of this algorithm is shown to be either linear in the
    number of functions, or at least squared in that number.
rv: