Sets of efficient points in a normed space

Sensitivity, stability, parametric optimization (90C31) Optimality conditions for problems in abstract spaces (49K27) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Normed linear spaces and Banach spaces; Banach lattices (46B99)

Cites Work

On Efficient Solutions to Multiple Objective Mathematical Programs
A computation procedure for the exact solution of location-allocation problems with rectangular distances
Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
Location Theory, Dominance, and Convexity
Geometrical properties of the Fermat-Weber problem
Title not available (Why is that?)
Title not available (Why is that?)
Points minimaux et ensembles optimaux dans les espaces de Banach
The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
Best n -Dimensional Approximation to Sets of Functions
Convex Sets and Nearest Points. II

Cited In (34)

PARETO ENVELOPES IN SIMPLE POLYGONS
Hamilton-Jacobi scaling limits of Pareto peeling in 2D
Title not available (Why is that?)
Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
A characterization of efficient points in constrained location problems with regional demand
Multiobjective control approximation problems: duality and optimality.
Bicriteria and restricted 2-facility Weber problems
Meilleure approximation en norme vectorielle et théorie de la localisation
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
Pareto optimization in topological vector spaces
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
Restricted center problems under polyhedral gauges
Dominating sets for convex functions with some applications
On duality in the vectorial control-approximation problem
Some personal views on the current state and the future of locational analysis
Title not available (Why is that?)
Efficiency for continuous facility location problems with attraction and repulsion
Multiple objective programming with piecewise linear functions
Relationships between constrained and unconstrained multi-objective optimization and application in location theory
A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
Localization in multifacility location theory
Hulls and Efficient Sets for the Rectilinear Norm
Determination of efficient solutions for point-objective locational decision problems
Duality in vectorial control approximation problems with inequality restrictions
Efficiency in constrained continuous location
Efficiency in Euclidean constrained location problems
A characterization theorem and an algorithm for a convex hull problem
Weighting factor results in vector optimization
A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
Weber problems with alternative transportation systems
Polyhedral norms in an infinite dimensional space
Planar point-objecitve location problems with nonconvex constraints: A geometrical construction

   Recommendations

El conjunto eficiente en problemas de localizacion con normas mixtas (L p) 👍 👎
Efficiency in constrained continuous location 👍 👎
Efficiency in Euclidean constrained location problems 👍 👎
Title not available (Why is that?) 👍 👎
A polygonal upper bound for the efficient set for single-facility location problems with mixed norms 👍 👎

This page was built for publication: Sets of efficient points in a normed space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084331)