On the unboundedness of facility layout problems

Zvi Drezner ()

Mathematical Methods of Operations Research, 2010, vol. 72, issue 2, 205-216

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. Copyright Springer-Verlag 2010

Keywords: Facility layout; Quadratic assignment problem; Location analysis; Mathematical programming (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-010-0317-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:72:y:2010:i:2:p:205-216

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-010-0317-2

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().