Let us consider again the data from the LaRosa tool bin location problem discussed in Section 10.3.
a. Suppose we know the average number of daily trips made to the tool bin from each production station. It seems as though we would want the tool bin closer to those stations with high numbers of average trips. Develop a new unconstrained model that minimizes the sum of the demand-weighted distance defined as the product of the demand (measured in number of trips) and the distance to the station.