A service station must be selected from four feasible sites because the unconstrained optimum is unavailable. One-way trips per day go to cells at (0, 0), (10, 0), and (10, 10), with respective trip counts 20, 50, and 30. Travel follows rectilinear aisles. Candidate sites are A (0, 0), B (8, 0), C (10, 10), and D (5, 5). Which site has the lowest daily load-distance sum, calculated as trips times one-way rectilinear distance?
- ASite B, with a load-distance sum of 620 trip-distance units/day
- BSite A, with a load-distance sum of 1,100 trip-distance units/day
- CSite C, with a load-distance sum of 900 trip-distance units/day
- DSite D, with a load-distance sum of 1,000 trip-distance units/day