Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
From MaRDI portal
Publication:1890946
DOI10.1007/BF01106606zbMath0834.90076OpenAlexW1969858788WikidataQ58217370 ScholiaQ58217370MaRDI QIDQ1890946
Justo Puerto, Emilio Carrizosa, Eduardo Conde, Manuel Munoz-Marquez
Publication date: 28 May 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01106606
Related Items (11)
Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ A steepest descent method for vector optimization ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ Efficiency in constrained continuous location ⋮ Unnamed Item ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
Cites Work
- Unnamed Item
- Localization in single facility location
- Sets of efficient points in a normed space
- Hull properties in location problems
- Efficiency in Euclidean constrained location problems
- An Algorithm for a Constrained Weber Problem
- Determination of efficient points in multiple-objective location problems
- Location Theory, Dominance, and Convexity
This page was built for publication: Planar point-objecitve location problems with nonconvex constraints: A geometrical construction