Paper Info
Title
On the unboundedness of facility layout problems
Abstract
Facility layout problems involve the location of facilities in a planar arrangement such that facilities that are strongly connected to one another are close to each other and facilities that are not connected may be far from one another. Pairs of facilities that have a negative connection should be far from one another. Most solution procedures assume that the optimal arrangement is bounded and thus do not incorporate constraints on the location of facilities. However, especially when some of the coefficients are negative, it is possible that the optimal configuration is unbounded. In this paper we investigate whether the solution to the facility layout problem is bounded or not. The main Theorem is a necessary and sufficient condition for boundedness. Sufficient conditions that prove boundedness or unboundedness are also given.
Year
DOI
Venue
2010
10.1007/s00186-010-0317-2
Math. Meth. of OR
Keywords
Field
DocType
facility layout · quadratic assignment problem · location analysis · mathematical programming,location analysis,mathematical programming,quadratic assignment problem
Discrete mathematics,Mathematical optimization,Quadratic assignment problem,Facility layout problem,Planar,Facility layout,Strongly connected component,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
72
2
1432-2994
Citations 
PageRank 
References 
0
0.34
7
Authors
1
Name
Order
Citations
PageRank
Zvi Drezner11195140.69