On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
From MaRDI portal
Publication:918867
DOI10.1007/BF01580853zbMath0706.90066OpenAlexW1969420517MaRDI QIDQ918867
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580853
Related Items (20)
A generalized Weber problem with different gauges for different regions ⋮ Unnamed Item ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ Comparison principles for second-order elliptic/parabolic equations with discontinuities in the gradient compatible with Finsler norms ⋮ Hamilton-Jacobi scaling limits of Pareto peeling in 2D ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ ∊-Variational inequalities in partially ordered spaces ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Optimal locations and inner products ⋮ εVariational inequalities for vector approximation problems ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ Efficiency in constrained continuous location ⋮ Location problems with different norms for different points ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ Duality for optimal control-approximation problems with gauges
Cites Work
- Geometrical properties of the Fermat-Weber problem
- Images of connected sets by semicontinuous multifunctions
- Sets of efficient points in a normed space
- Weighting factor results in vector optimization
- Finding efficient solutions for rectilinear distance location problems efficiently
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- The structure of admissible points with respect to cone dominance
- Proper efficiency and the theory of vector maximization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Some Properties of Location Problems with Block and Round Norms
- Meilleure approximation en norme vectorielle et théorie de la localisation
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Polyhedral extensions of some theorems of linear programming
- Proper Efficient Points for Maximizations with Respect to Cones
- Convex Analysis
- A note on Fermat's problem
- Location Theory, Dominance, and Convexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
