The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem

REFERENCES

• Bartroff , J. ( 2010 ). A Proof of the Bomber Problem's Spend-It-All Conjecture, to appear in Sequential Analysis.
   Google Scholar
• Bartroff , J. , Goldstein , L. , Rinott , Y. , and Samuel-Cahn , E. ( 2010 ). On Optimal Allocation of a Continuous Resource Using an Iterative Approach and Total Positivity, to appear in Advances in Applied Probability 42.
   Google Scholar
• Klinger , A. and Brown , T. A. ( 1968 ). Allocating Unreliable Units to Random Demands , in Stochastic Optimization and Control , H. F. Karreman , ed., number 20 in Mathematics Research Center, U.S. Army, at the University of Wisconsin, Madison , pp. 173 – 209 . New York : Wiley .
   Google Scholar
• Samuel , E. ( 1970 ). On Some Problems in Operations Research , Journal of Applied Probability 1 : 157 – 164 .
   Web of Science ®Google Scholar
• Shepp , L. A. , Simons , G. , and Yao , Y.-C. (1991). On a Problem of Ammunition Rationing, Advances in Applied Probability 23: 624–641.
   Web of Science ®Google Scholar
• Simons , G. and Yao , Y.-C. ( 1990 ). Some Results on the Bomber Problem , Advances in Applied Probability 22 : 412 – 132 .
   Web of Science ®Google Scholar
• Weber , R. ( 1985 ). On a Problem of Ammunition Rationing , in Conference Report: Stochastic Dynamic Optimization and Applications in Scheduling and Related Areas , p. 148 . Universität Passau, Fakultät für Mathematik und Informatik. Abstract .
   Google Scholar
• Recommended by A. G. Tartakovsky
   Google Scholar