Locating a semi-obnoxious facility with repelling polygonal regions

Jose Gordillo (jgordillous.es)
Frank Plastria (Frank.Plastriavub.ac.be)
Emilio Carrizosa (ecarrizosaus.es)

Abstract: In this work, a semi-obnoxious facility must be located in the Euclidean plane to give service to a group of customers. Simultaneously, a set of populated areas, with shapes approximated via polygons, must be protected from the negative effects derived from that facility. The problem is formulated as a margin maximization model, following a strategy successfully used in Support Vector Machines. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm.

Keywords: Continuous Location, Computational Geometry, Semi-Obnoxious Facilities,

Category 1: Applications -- OR and Management Sciences

Citation: Technical Report MOSI/20, MOSI Department, Vrije Universiteit Brussel, October 2006

Download: [PDF]

Entry Submitted: 04/30/2007
Entry Accepted: 04/30/2007
Entry Last Modified: 11/05/2007

Modify/Update this entry