On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP

This paper considers a class of feasible set fixed-charge depot location problems which have been formulated as mixed-integer programmes. Computational results are reported to show that linear programming often produces integer solutions to uncapacitated problems as required. It is suggested that this represents a practical solution approach. Computational evidence suggests this convenient property does not extend to capacitated problems. Discussion of reducing infinite set problems to such feasible set problems is included.