Meilleure approximation en norme vectorielle et théorie de la localisation

DOI10.1051/m2an/1987210406051zbMath0649.41019OpenAlexW2469085451MaRDI QIDQ3794670

Roland Durier

Publication date: 1987

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193516

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (1)

On Pareto optima, the Fermat-Weber problem, and polyhedral gauges

Cites Work

• Unnamed Item
• Unnamed Item
• Geometrical properties of the Fermat-Weber problem
• Sets of efficient points in a normed space
• Weighting factor results in vector optimization
• Finding efficient solutions for rectilinear distance location problems efficiently
• 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
• On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives
• Some Properties of Location Problems with Block and Round Norms
• Meilleure approximation en norme vectorielle et minima de Pareto
• Structure of the Efficient Point Set
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Convex Analysis
• Location Theory, Dominance, and Convexity

This page was built for publication: Meilleure approximation en norme vectorielle et théorie de la localisation