Approximation of solutions for location problems

DOI10.1007/BF00938529zbMath0616.90036OpenAlexW2039335371MaRDI QIDQ1821683

Pierre Loridan, H. Idrissi, Christian Michelot

Publication date: 1988

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

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

zbMATH Keywords

locationpolyhedral normsnonconvex and non- differentiable programmingpiecewise convex functionstrict local maxima

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Related Items (15)

Un algorithme pour résoudre une famille de problèmes de localisation multisources ⋮ LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION ⋮ A d.c. optimization method for single facility location problems ⋮ On approximate efficiency in multiobjective programming ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ DC programming: overview. ⋮ ∊-Variational inequalities in partially ordered spaces ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ The complementary convex structure in global optimization ⋮ Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ εVariational inequalities for vector approximation problems ⋮ Weber problems with alternative transportation systems ⋮ General models in min-max continuous location: Theory and solution techniques

Cites Work

• Geometrical properties of the Fermat-Weber problem
• Some Properties of Location Problems with Block and Round Norms
• Using Block Norms for Location Modeling
• Location-Allocation Problems
• Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• Heuristic Methods for Location-Allocation Problems
• Convex Analysis
• Location Theory, Dominance, and Convexity

This page was built for publication: Approximation of solutions for location problems