Setting military reenlistment bonuses

Setting military reenlistment bonuses

0.00 Avg rating0 Votes
Article ID: iaor19931832
Country: United States
Volume: 40
Issue: 2
Start Page Number: 143
End Page Number: 160
Publication Date: Mar 1993
Journal: Naval Research Logistics
Authors: , ,
Keywords: programming: integer
Abstract:

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, seeks 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. The authors 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 unexpected 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.

Reviews

Required fields are marked *. Your email address will not be published.