General models in min-max planar location: Checking optimality conditions

DOI10.1007/BF02192641zbMath0866.90085OpenAlexW2147426450MaRDI QIDQ2564175

J. B. G. Frenk, Joaquim A. S. Gromicho, Shu-Zhong Zhang

Publication date: 7 January 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionsNewton-Raphson methodcomputational geometrypolynomial-time algorithmsplanar single-facility min-max location

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Unnamed Item, On the planar piecewise quadratic 1-center problem, Robustness in the Pareto-solutions for the multi-criteria minisum location problem, General models in min-max continuous location: Theory and solution techniques, Location problems with different norms for different points

Uses Software

• Isolde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A destination optimality in asymmetric distance Fermat-Weber problems
• Localization in single facility location
• Small-dimensional linear programming and convex hulls made easy
• Geometric algorithms and combinatorial optimization
• General models in min-max continuous location: Theory and solution techniques
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear Programming in Linear Time When the Dimension Is Fixed