Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional

In this paper, a branch and bound algorithm for a special class of warehouse location problems when the objective function is fractional, is developed. The branching decision rules help us to decide which warehouse has to be opened or closed from any node of branching tree. We propose the revised version of the algorithm suggested by Basheer M. Khumawala. It is illustrated with the help of a numerical example.