Realigning the U.S. Navy Recruiting Command
Schwartz, Garry S.
Rosenthal, Roland E.
MetadataShow full item record
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 should remain open and how many recruiters should be assigned to each open station? The second problem is to decide how many recruiters and stations each district should have. The first problem is formulated as a nonlinear mixed integer programming problem. To obtain a solution with readily available software, the problem is decomposed into four subproblems that are solved sequentially. This decomposition approach is empirically shown to yield near optimal solutions for problems of varied sizes. The second problem is formulated as a nonlinear resource allocation problem in which the objective function is not expressible in closed form. To efficiently solve this problem, the function is approximated in a piecewise linear fashion using the results from the first problem. To illustrate the applications of these optimization models, solutions were obtained for Navy Recruiting District Boston and Navy Recruiting Area 1, which consists of Albany, Boston, Buffalo, New York, Harrisburg, Philadelphia, Pittsburgh and New Jersey districts.
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.
Optimization models for placing nurse recruiters 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 ...
An optimal allocation of Army recruiting stations with active and reserve recruiters Teague, Michael J. (Monterey, California. Naval Postgraduate School, 1994-06);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 ...
Optimal recruiting strategy to minimize U.S. Navy Delayed Entry Program (DEP) attrition Simpson, Paul Glenn (Monterey, California. Naval Postgraduate School, 1997-12);This thesis develops an optimization based model to assist the Navy Recruiting Command in placing Nuclear Power Field recruits in the Delayed Entry Program (DEP). After signing enlistment contracts, individuals are enrolled ...