An Optimal Allocation of Army Recruiting Stations With Active and Reserve Recruiters.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 14, 1994
Accession Number
ADA291570

Entities

People

  • Michael J. Teague

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies
  • Human Systems
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Data Analysis
  • Enlisted Personnel
  • Goodness Of Fit Tests
  • Information Science
  • Integer Programming
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Organizational Structure
  • Production
  • Recruiting
  • Recruits
  • Statistical Analysis
  • Training
  • United States

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Military Leadership and Professional Education.
  • Operations Research