Optimal interdiction of a supply network

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.     

A two product dynamic economic lot size production model with either-or production constraints

This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.     

Hyperbolic integer programming

The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given.     

“No boots on the ground”: the effectiveness of US drones against Al Qaeda in the Arabian Peninsula

The number of US drone strikes against Al Qaeda in the Arabian Peninsula (AQAP) in Yemen has increased significantly since 2010, but received limited academic attention. This article examines the effectiveness of this drone campaign using an existing theoretical framework. Crucially, we contribute to the framework by adding a fourth intervening variable, namely target correspondence. Through a single case study, it is found that drones have only enjoyed limited success in degrading AQAP's hierarchical structure, qualified human resources and access to key material resources, and in some cases – owing to our target correspondence analysis – this limited success has come at a price. It is found that drones have temporarily disrupted AQAP by successfully eliminating senior leaders involved in coordinating and overseeing external operations. Overall, AQAP's ability to hit Western targets remains significant.     

A dynamic general linear model for inference from accelerated life tests

We present a new approach for inference from accelerated life tests. Our approach is based on a dynamic general linear model setup which arises naturally from the accelerated life-testing problem and uses linear Bayesian methods for inference. The advantage of the procedure is that it does not require large numbers of items to be tested and that it can deal with both censored and uncensored data. We illustrate the use of our approach with some actual accelerated life-test data. © 1992 John Wiley & Sons, Inc.     

Buy now,pay later: American military intervention and the strategic cost paradox

This paper explores the notion that US efforts to evade the political costs of war paradoxically contribute to the subsequent exacerbation of costs over time. Leaders seek to purchase political capital in the short term by limiting the costs and requirements of military operations, but in doing so cause strategic and political liabilities to mount in the long run. While identification of such behaviour is not new, insufficient attention has been devoted to explaining its causes, dynamics, and manifestations in relation to key decisions on and in war. Evidence derived from studies of recent American discretionary campaigns is analysed to advance an argument with respect to this pattern of self-defeating strategic behaviour.     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001