The fighter problem: optimal allocation of a discrete commodity

DOI10.1239/AAP/1300198515zbMath1250.90106arXiv1107.5066OpenAlexW2162255256MaRDI QIDQ2996572

Ester Samuel-Cahn, Jay Bartroff

Publication date: 3 May 2011

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

concavityfighter problemcontinuous ammunitiondiscrete ammunitionoptimal allocation problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (4)

Concavity and monotonicity properties in a groundwater management model ⋮ Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset ⋮ ABCs of the bomber problem and its relatives ⋮ 41 counterexamples to property (B) of the discrete time bomber problem

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem
• On some problems in operations research
• On a problem of ammunition rationing

This page was built for publication: The fighter problem: optimal allocation of a discrete commodity