Sets of efficient points in a normed space (Q1084331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Points minimaux et ensembles optimaux dans les espaces de Banach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best <i>n</i> -Dimensional Approximation to Sets of Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical properties of the Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5574527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computation procedure for the exact solution of location-allocation problems with rectangular distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Efficient Solutions to Multiple Objective Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3036086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Sets and Nearest Points. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory, Dominance, and Convexity / rank
 
Normal rank

Latest revision as of 16:30, 17 June 2024

scientific article
Language Label Description Also known as
English
Sets of efficient points in a normed space
scientific article

    Statements

    Sets of efficient points in a normed space (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The paper deals with efficient solutions of a multiobjective programming problem in a normed space; the objective functions to be minimized are distances to every point of a compact subset. We give a geometrical description of the sets of strictly efficient, efficient and weakly efficient points which looks like a description of the convex hull. It makes use of a family of cones, which play the role of halfspaces in the Euclidean case. Topological properties of these cones are developed. The above description leads to hull and closure properties of sets of efficiency. In addition the two-dimensional case is emphasized in connection with location theory where more precise results are obtained. In particular, when the space is strictly convex or polyhedral, the description of the sets of efficiency provides a geometrical construction of these sets.
    0 references
    hull and closure properties
    0 references
    sets of efficiency
    0 references
    location theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references