Determination of Selective reenlistment Bonus multipliers in the United States Marine Corps.
Loading...
Authors
DeWolfe, Dean D.
Subjects
Math programming
Integer Programming
Knapsack Problem
Selective Reenlistment bonus
Lagrangian Relaxation
Generalized Assignment Problem
Integer Programming
Knapsack Problem
Selective Reenlistment bonus
Lagrangian Relaxation
Generalized Assignment Problem
Advisors
Wood, Kevin R.
Date of Issue
1986
Date
March 1986
Publisher
Language
en_US
Abstract
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 4895 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.
Type
Thesis
Description
Series/Report No
Department
Department of Operations Research
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funding
Format
49 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.