A characterization of efficient points in constrained location problems with regional demand

DOI10.1016/0167-6377(96)00005-3zbMath0866.90101MaRDI QIDQ2564626

Emilio Carrizosa, Frank Plastria

Publication date: 15 January 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107465

zbMATH Keywords

efficiency; convex analysis; strictly convex norms; convex locational constraint

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

Efficiency in constrained continuous location, Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets, Weber problems with mixed distances and regional demand

Cites Work

• Unnamed Item
• Unnamed Item
• Geometrical properties of the Fermat-Weber problem
• Sets of efficient points in a normed space
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Finding efficient solutions for rectilinear distance location problems efficiently
• Efficiency in constrained continuous location
• Efficiency in Euclidean constrained location problems
• Geometrical characterization of weakly efficient points
• On Efficient Solutions to Multiple Objective Mathematical Programs
• Some Properties of Location Problems with Block and Round Norms
• An Algorithm for a Constrained Weber Problem
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Location Theory, Dominance, and Convexity