Approximation of solutions for location problems (Q1821683)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation of solutions for location problems
scientific article

    Statements

    Approximation of solutions for location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    This paper is devoted to a class of location problems with polyhedral norms. The objective function is shown to be a piecewise convex function which has to be maximized. We prove that the optimal locations belong to a finite set of intersection points, and we present an efficient method operating upon this finite set and providing a strict local maximum with few computational effort.
    0 references
    0 references
    0 references
    0 references
    0 references
    location
    0 references
    polyhedral norms
    0 references
    piecewise convex function
    0 references
    nonconvex and non- differentiable programming
    0 references
    strict local maxima
    0 references
    0 references