An optimal allocation of Army recruiting stations with active and reserve recruiters
Loading...
Authors
Teague, Michael J.
Subjects
NA
Advisors
Lawphongpanich, Siriphong
Date of Issue
1994-06
Date
June 1994
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
68 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This 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.