Setting Military Reenlistment Bonuses
Wood, R. Kevin
MetadataShow full item record
The United States military frequently has difficulty retaining enlisted personnel beyond their initial enlistment. A bonus program within each service, called a Selective Reenlistment Bonus (SRB) program, seeds to enhance reenlistments and thus reduce personnel shortages in critical military occupational specialties (MOSs). The amount of bonus is set by assigning “SRB multipliers” to each MOS. We develop a nonlinear integer program to select multipliers which minimize a function of deviations from desired reenlistment targets. A Lagrangian relaxation of a linearized version of the integer program is used to obtain lower bounds and feasible solutions. The best feasible solution, discovered in a coordinate search of the Lagrangian function, is heuristically improved by apportioning unexpended funds. For large problems, a heuristic variable reduction is employed to speed model solution. U.S. Army data and requirements for FY87 yield a 0-1 integer program with 12,992 binary variables and 273 constraints, which is solved within 0.00002% of optimality on an IBM 3033AP in less than 1.7 seconds. More general models with up to 463,000 binary variables are solved, on average, to within 0.009% of optimality in less than 1.8 minutes. The U.S. Marine Corps has used a simpler version of this model since 1986.
Naval Research Logistics, 40, pp. 143-160.
Rightsdefined 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.
Hall, Andrew O. (Monterey, California. Naval Postgraduate School, 1999-06);This implementation of a Legendre-Gauss-Lobatto Pseudospectral (LGLP) algorithm takes advantage of the MATLAB Graphical User Interface (GUI) and the Optimization Toolbox to allow an efficient implementation of a direct ...
Smith, Douglas R. (Monterey, California. Naval Postgraduate School, 1980-02); NPS-52-80-004This paper investigates the conditions under which a discrete optimization problem can be formulated as a dynamic program. Following the terminology of (Karp and Held 1967), a discrete optimization problem is formalized ...
Yorio, Paul R. (Monterey, California : Naval Postgraduate School, 1988);The U.S. Marine Corps deploys Marine Air-Ground Task Forces (MAGTFs) by airlift or sealift to participate in numerous short-term exercises. These exercises are of such duration that resupply of the MAGTF by strategic airlift ...