Show simple item record

dc.contributor.authorAnderson, C. O.
dc.contributor.authorSchoeffel, P. van R.
dc.date.accessioned2012-08-29T23:28:58Z
dc.date.available2012-08-29T23:28:58Z
dc.date.issued1964
dc.identifier.urihttp://hdl.handle.net/10945/11671
dc.description.abstractThe 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.en_US
dc.description.urihttp://www.archive.org/details/applicationoflin00ande
dc.language.isoen_US
dc.publisherMonterey, California: U.S. Naval Postgraduate Schoolen_US
dc.titleAn application of linear programming to recruit transportationen_US
dc.typeThesisen_US
dc.contributor.corporateNaval Postgraduate School
dc.contributor.schoolNaval Postgraduate School
dc.contributor.departmentOperations Research
dc.description.serviceLieutenant Commander, United States Navyen_US
etd.thesisdegree.nameM.S. in Operations Researchen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineOperations Researchen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record