This paper develops a mathematical programming model for obtaining a best set of sites for planned facilities. The model is concerned with those situations where resource constraints are present. The specific setting for the paper involves the selection of sites for a set of retail outlets, wherein the ratio of aggregate outputs to inputs for the selected set is maximal among all possible sets that could be chosen. At the same time, the model guarantees that the only sets of stores allowable are those for which the available resources are used to the maximum extent possible.