Optimal deployment of logistic units in dynamic combat conditions

One of the problems facing the commander of support units during a combat situation is how to plan the deployment of the units under his command. This paper deals with the tactical problem of how to deploy the support units in order to achieve maximum effectiveness, given the decision of which fighting units will receive support. The problem is formulated as a dynamic decision problem that has some of the characteristics of a dynamic warehouse location problem. A branch and bound technique to reduce the state space of the d.p. formulation is applied in the solution of this model.