Sets of efficient points in a normed space
From MaRDI portal
Publication:1084331
DOI10.1016/0022-247X(86)90237-4zbMath0605.49020MaRDI QIDQ1084331
Roland Durier, Christian Michelot
Publication date: 1986
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Sensitivity, stability, parametric optimization (90C31) Normed linear spaces and Banach spaces; Banach lattices (46B99) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Optimality conditions for problems in abstract spaces (49K27)
Related Items (31)
On duality in the vectorial control-approximation problem ⋮ Planar point-objecitve location problems with nonconvex constraints: A geometrical construction ⋮ Weighting factor results in vector optimization ⋮ Localization in multifacility location theory ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ Dominating sets for convex functions with some applications ⋮ Hamilton-Jacobi scaling limits of Pareto peeling in 2D ⋮ Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm ⋮ A new algorithm for solving planar multiobjective location problems involving the Manhattan norm ⋮ A primal-dual algorithm for the fermat-weber problem involving mixed gauges ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ Determination of efficient solutions for point-objective locational decision problems ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ Pareto optimization in topological vector spaces ⋮ Multiple objective programming with piecewise linear functions ⋮ Duality in vectorial control approximation problems with inequality restrictions ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ A polygonal upper bound for the efficient set for single-facility location problems with mixed norms ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ Weber problems with alternative transportation systems ⋮ Some personal views on the current state and the future of locational analysis ⋮ Efficiency in constrained continuous location ⋮ Restricted center problems under polyhedral gauges ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ Unnamed Item ⋮ A characterization theorem and an algorithm for a convex hull problem ⋮ Polyhedral norms in an infinite dimensional space
Cites Work
- Unnamed Item
- Unnamed Item
- Geometrical properties of the Fermat-Weber problem
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Points minimaux et ensembles optimaux dans les espaces de Banach
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Convex Sets and Nearest Points. II
- 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
- Best n -Dimensional Approximation to Sets of Functions
- Location Theory, Dominance, and Convexity
This page was built for publication: Sets of efficient points in a normed space
