We consider an Approximate Dynamic Programming heuristic to support the selection of defense projects when projects have different values and are originated intermittently but fairly frequently. We show that a simple policy reserving a positive fraction of the available budget for high-value projects not yet originated is superior to a greedy knapsack approach.
BrownGDellRNewmanA. Optimization military capital planning. Interfaces2004; 34: 415–425.
2.
BrownGClemenceRTeufertW. An optimization model for modernizing the Army’s helicopter fleet. Interfaces1991; 12: 39–52.
3.
BrownGCoulterDWashburnA. Sortie optimization and munitions planning. Mil Oper Res1994; 1: 13–18.
4.
BrownGDellRHoltzH. How US Air Force Space Command optimizes long-term investment in space systems. Interfaces2003; 33: 1–14.
5.
HurleyWJSchobelKB. Selecting low expenditure defence projects: an estimate of the value of optimization relative to ad hoc procedures. Mil Oper Res2009; 14: 41–46.
6.
WeingartnerH. Capital budgeting of interrelated projects: survey and synthesis. Manag Sci1966; 12: 485–516.
7.
SenjuSToyodaY. An approach to linear programming with 0–1 variables. Manag Sci1968; 15: B196-B207.
8.
ToyodaY. A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manag Sci1975; 21: 1417–1427.
9.
MartelloSTothP. Knapsack problems: algorithms and computer implementations. New York: John Wiley, 1990.
BuffumR. Workforce planning models for the Naval Air Test Center. MS Thesis, Department of Operations Research, Naval Postgraduate School, Monterey, CA, 1978.
12.
EvansGFairbairnR. Selection and scheduling of advanced missions for NASA using 0–1 integer linear programming. J Oper Res Soc1989; 40: 971–981.
13.
EwingPLTarantinoWParnellGS. Use of decision analysis in the Army Base Realignment and Closure (BRAC) 2005 military value analysis. Decis Anal2006; 3: 33–49.
14.
LoerchAKouryRMaxwellD. Value added analysis for army equipment modernization. Nav Res Logist1999; 46: 233–253.
15.
KleywegtAJPapastavrouJD. The dynamic and stochastic knapsack problem. Oper Res1998; 46: 17–35.
16.
Marchetti-SpaccamelaAVercellisC. Stochastic on-line knapsack problems. Math Program1995; 68: 73–104.
17.
Van SlykeRYoungY. On-line stochastic knapsacks. Technical Report 94–75, Polytechnic University, New York, 1994.
18.
LuekerGS. Average-case analysis of off-line and on-line knapsack problems. In: proceedings of the sixth annual ACM-SIAM SODA, 1995, pp.179–188.
