Abstract

The location-allocation problem in its basic form assumes that the number of new facilities to be located is known and the capacities are unlimited. When the locations of the facilities and demand points (or customers) are restricted to the real line, the basic model may be solved efficiently by dynamic programming. In this note, we show that when the number of facilities and their capacities are included in the decision process, the problem may actually be easier to solve.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call