AbstractThis paper examines the dependence of the structure of optimal time‐sequential fire‐support policies on the quantification of military objectives by considering four specific problems, each corresponding to a different quantification of objectives (i.e. criterion functional). We consider the optimal time‐sequential allocation of supporting fires during the “approach to contact” of friendly infantry against enemy defensive positions. The combat dynamics are modelled by deterministic Lanchester‐type equations of warfare, and the optimal fire‐support policy for each one‐sided combat optimization problem is developed via optimal control theory. The problems are all nonconvex, and local optima are a particular difficulty in one of them. For the same combat dynamics, the splitting of supporting fires between two enemy forces in any optimal policy (i.e. the optimality of singular subarcs) is shown to depend only on whether the terminal payoff reflects the objective of attaining an “overall” military advantage or a “local” one. Additionally, switching times for changes in the ranking of target priorities are shown to be different (sometimes significantly) when the decision criterion is the difference and the ratio of the military worths (computed according to linear utilities) of total infantry survivors and also the difference and the ratio of the military worths (computed according to linear utilities) of total infantry survivors and also the difference and the ratio of the military worths of the combatants' total infantry losses. Thus, the optimal fire‐support policy for this attack scenario is shown to be significantly influenced by the quantification of military objectives.