Linear Programming Applied to a Facility Location Problem

1996 ◽  
Vol 12 (1) ◽  
pp. 105-110 ◽  
Author(s):  
E. Brown ◽  
Y. Fathi ◽  
R. Sowell
Keyword(s):  
Linear Programming ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem

scholarly journals Application of linear programming on the overhaul facility location problem

2014 ◽  
Vol 40 (4) ◽  
pp. 27-36
Author(s):  
N. Dedović ◽  
Snežana Matić-Kekić ◽  
M. Tomić ◽  
L. Savin ◽  
M. Simikić
Keyword(s):  
Linear Programming ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem

scholarly journals Solving k-obnoxious facility location problem on a plane

2018 ◽  
Vol 1 (2) ◽  
Author(s):  
Utpal Kumar Bhattacharya
Keyword(s):  
Linear Programming ◽  
Facility Location ◽  
Upper Bound ◽  
Location Problem ◽  
Distance Measure ◽  
Optimal Solution ◽  
Facility Location Problem ◽  
Problem Area ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility

 In this paper k-obnoxious facility location problem has been modeled as a pure planner location problem.  Area restriction concept has been incorporated by inducting a convex polygon in the constraints set. A linear programming iterative algorithm for k- obnoxious facility locations has been developed. An upper bound has been incorporated in the algorithm to get the  optimal solution. Also the concept of upper bound has reduced  the number of linear programming problems to solved in the algorithm. Rectilinear distance norm has been considered as the distance measure as it is more appropriate to the various realistic situations. 

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.

Fuzzy facility location problem with preference of candidate sites

2007 ◽  
Vol 158 (17) ◽  
pp. 1922-1930 ◽  
Author(s):  
Hiroaki Ishii ◽  
Yung Lung Lee ◽  
Kuang Yih Yeh
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem
Sign in / Sign up

Export Citation Format

Share Document