Realigning the U.S. Navy Recruiting Command
Approved for public release; distribution is unlimited. === 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 op...
Main Author: | |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
Monterey, California. Naval Postgraduate School
2014
|
Online Access: | http://hdl.handle.net/10945/39896 |
id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-39896 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-398962015-01-26T15:55:58Z Realigning the U.S. Navy Recruiting Command Schwartz, Garry S. Lawphongpanich, Siriphong Rosenthal, Roland E. Naval Postgraduate School (U.S.) Department of Operations Research Approved for public release; distribution is unlimited. 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. 2014-03-26T23:23:44Z 2014-03-26T23:23:44Z 1993-03 Thesis http://hdl.handle.net/10945/39896 en_US This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, it may not be copyrighted. Monterey, California. Naval Postgraduate School |
collection |
NDLTD |
language |
en_US |
sources |
NDLTD |
description |
Approved for public release; distribution is unlimited. === 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. |
author2 |
Lawphongpanich, Siriphong |
author_facet |
Lawphongpanich, Siriphong Schwartz, Garry S. |
author |
Schwartz, Garry S. |
spellingShingle |
Schwartz, Garry S. Realigning the U.S. Navy Recruiting Command |
author_sort |
Schwartz, Garry S. |
title |
Realigning the U.S. Navy Recruiting Command |
title_short |
Realigning the U.S. Navy Recruiting Command |
title_full |
Realigning the U.S. Navy Recruiting Command |
title_fullStr |
Realigning the U.S. Navy Recruiting Command |
title_full_unstemmed |
Realigning the U.S. Navy Recruiting Command |
title_sort |
realigning the u.s. navy recruiting command |
publisher |
Monterey, California. Naval Postgraduate School |
publishDate |
2014 |
url |
http://hdl.handle.net/10945/39896 |
work_keys_str_mv |
AT schwartzgarrys realigningtheusnavyrecruitingcommand |
_version_ |
1716728780875104256 |