Please use this identifier to cite or link to this item:
|Title:||Bounding methods for facilities location algorithms|
|Authors:||Dowling, Douglas Paul|
Love, Robert F.
McMaster University, Faculty of Business
|Series/Report no.:||Research and working paper series (McMaster University, Faculty of Business)|
|Abstract:||<p>Single and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have been proven to converge, in practice it is desirable to be able to compute a· lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a pre-specified tolerance of the optimum value. In this paper· we generalize a new bounding method to include multi-facility problems with eP distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods.</p>|
|Description:||<p>22, 7 p. ; Includes bibliographical references (p. 21-22). ; "March, 1984".</p>|
|Appears in Collections:||DeGroote School of Business Working Paper Series|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.