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

DOI10.1080/07474946.2010.487430zbMath1201.62096arXiv1007.3025OpenAlexW2082441134MaRDI QIDQ4931849

Larry Goldstein, Jay Bartroff, Ester Samuel-Cahn

Publication date: 1 October 2010

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3025

zbMATH Keywords

Poisson processoptimal allocationsequential optimizationammunition rationing

Mathematics Subject Classification ID

Sequential statistical methods (62L99) Sequential statistical design (62L05) Optimal stopping in statistics (62L15) Probabilistic games; gambling (91A60)

Related Items (4)

ABCs of the bomber problem and its relatives ⋮ The fighter problem: optimal allocation of a discrete commodity ⋮ On optimal allocation of a continuous resource using an iterative approach and total positivity ⋮ A Proof of the Bomber Problem's Spend-It-All Conjecture

Cites Work

• On optimal allocation of a continuous resource using an iterative approach and total positivity
• A Proof of the Bomber Problem's Spend-It-All Conjecture
• Some results on the bomber problem
• On some problems in operations research
• On a problem of ammunition rationing

This page was built for publication: The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem