An application of linear programming to recruit transportation

Abstract

The problem of transporting recruits from Navy Recruiting Stations to Recruit Training Centers in such a way as to minimize total cost is subjected to solution by standard linear programming methods. A sensitivity analysis of the variation of total cost for different modes of transportation, as influenced by the variation of the proportion of recruits going to each of the two Recruit Training Centers, is carried out. A probabilistic model of the occurrence of a given number of enlistments, up to a fixed quota, at each Recruiting Station is formula ted and a simulation of the transportation problem arising is carried out. A rationale is developed for the derivation of a realistic estimator for planning, and some of the difficulties of determining a best estimator are discussed. A computer program for approximating the expected loss for any estimator is presented. Some other types of approach to the problem are indicated.