Under certain conditions, the re‐supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.

ABSTRACT:The use of Pontryagin's Maximum Principle in analyses of deterministic inventory models requires less restrictive assumptions about the nature of order policies than can be allowed when only the differential calculus is used.Two analyses are presented to illustrate this fact.The first involves a periodic review model with no shortages allowed.The production and holding cost functions were kept as general as possible.The second analysis involves a periodic review model with shortages allowed and linear production and inventory costs. As would be expected, the optimal order policies obtained are more general than those obtained in the past.This task was supported

No abstract

No abstract

No abstract