On the unboundedness of facility layout problems

On the unboundedness of facility layout problems

0.00 Avg rating0 Votes
Article ID: iaor20107707
Volume: 72
Issue: 2
Start Page Number: 205
End Page Number: 216
Publication Date: Oct 2010
Journal: Mathematical Methods of Operations Research
Authors:
Keywords: location
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.

Reviews

Required fields are marked *. Your email address will not be published.