On the complexity of the exchange algorithm for minimax optimization problems

DOI10.1007/BF02604643zbMath0632.90064OpenAlexW2069154731MaRDI QIDQ3770292

Zvi Drezner

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02604643

zbMATH Keywords

minimax optimizationconvex functionslocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Related Items (1)

On solving large-scale finite minimax problems using exponential smoothing

Cites Work

• On minimax optimization problems
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Single Facility $l_p $-Distance Minimax Location
• Unnamed Item

This page was built for publication: On the complexity of the exchange algorithm for minimax optimization problems