An optimal allocation of Army recruiting stations with active and reserve recruiters
Teague, Michael J.
MetadataShow full item record
This thesis addresses the problem of how to locate and staff recruiting stations with Active and Reserve recruiters in order to maximize the annual number of recruits. The problem is formulated as a nonlinear integer programming problem. The objective function for the problem, also referred to as the production function, describes the number of recruits obtainable from each zip code and can be estimated via Poisson regression. The resulting nonlinear integer programming problem is heuristically solved by decomposing decision variables into two sets: one to locate stations and the other to staff them with recruiters. Comparisons are made between problems with production functions derived from all zip codes and those derived from only zip codes belonging to efficient stations as defined in Data Envelopment Analysis.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Schwartz, Garry S. (Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ...
Olson, Allen S. (Monterey, California. Naval Postgraduate School, 1998-09);The U.S. National Security Agency wishes to predict the routing of messages over various communications networks. Before routing predictions can be made in a public switch telephone network (PSTN), the hierarchical level ...
Matuszewski, Douglas F. (Monterey, California. Naval Postgraduate School, 1994-09);This thesis addresses the problem of placing active duty nurse recruiters at recruiting stations for the United States Army Recruiting Command (USAREC). The problem can be formulated as an integer programming problem which ...