Locating a semi-obnoxious facility in the special case of Manhattan distances

DOI10.1007/s00186-019-00671-zzbMath1427.90196OpenAlexW2945554397WikidataQ127866348 ScholiaQ127866348MaRDI QIDQ2009180

Andrea Wagner

Publication date: 27 November 2019

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-019-00671-z

zbMATH Keywords

global optimizationobnoxious facility locationdc problemsprimal and dual algorithms

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
• Duality in nonconvex optimization
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Weber's problem with attraction and repulsion under polyhedral gauges
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
• The vector linear program solver Bensolve -- notes on theoretical background
• DC programming: overview.
• Duality for nonconvex approximation and optimization.
• The Weber Problem On The Plane With Some Negative Weights
• A Maxmin Location Problem
• A Fenchel-Rockafellar type duality theorem for maximization
• Convex analysis and global optimization

This page was built for publication: Locating a semi-obnoxious facility in the special case of Manhattan distances