Determination of Selective Reenlistment Bonus Multipliers in the United States Marine Corps.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
Selective Reenlistment Bonuses SRBs are offered to improve retention in designated military occupational specialties MOSs for specified years-of-service intervals zones. The amount of the bonus is set by assigning an SRB Multiplier for each MOS and zone combination cell. Determination of multipliers is modeled as a nonlinear knapsack problem which is then linearized to a generalized assignment problem. The objective is to minimize the sum over all cells of a weighted squared deviation from the reenlistment target in each cell. Lagrangian relaxation provides lower bounds and feasible solutions. The best feasible solution is improved using a greedy heuristic to apportion unexpended funds. A FORTRAN 77 computer program implements the procedure. Data for FY86 yields a 0-1 integer program with 4795 binary variables and 980 constraints. A solution within .01 of optimality is obtained on an IBM 3033AP in 1.7 seconds and on an IBM PC in about four minutes. Keywords Math programming Integer programming Knapsack problem Selective reenlistment bonus Lagrangian relaxation Generalized assignment problem Theses.
- Administration and Management
- Personnel Management and Labor Relations