Afghanistan after the Soviets: From jihad to tribalism

In 1989 the Soviet Union withdrew its forces from Afghanistan leaving the embattled Afghan Communist government of President Mohammad Najibullah to fight against an emboldened mujahideen insurgency. Most experts expected a quick mujahideen victory once the Soviets were no longer directly involved in counterinsurgency operations in support of the Afghan government. But in the spring of 1989 the Afghan Communists beat the odds and defeated a mujahideen rebel offensive designed to capture the eastern city of Jalalabad. This proved to be a turning point, and for the next three years the Najibullah regime held out against the mujahideen ‘freedom fighters’. In fact the Afghan Communist regime actually outlasted its sponsor the Soviet Union. The reasons for this remarkable achievement can be traced, in part, to ethnic–tribal divisions among the quarreling mujahideen parties and the Afghan government's ability to exploit them. This largely untold story has obvious implications for understanding the future of post-Karzai Afghanistan, tribalism, ethnicity, and foreign sponsorship in post-US Afghanistan. This article will explore the reasons for the resilience of the Najibullah Communist government and then assess possible implications for a post-2014 Afghan government.     

Concavity and monotonicity properties in a groundwater management model

We consider a discrete‐time groundwater model in which the cost of pumping takes a slightly different form to that which has been traditional in the research literature to date. This enables us to prove that (a) the optimal pumping quantity is nondecreasing in the ground water stock, (b) the stock level remaining after each period's pumping is also nondecreasing in the groundwater stock, (c) the optimal decision is determined by maximizing a concave function, and finally (d) the optimal pumping quantity is nonincreasing in the number of periods to go. We show that (a)–(c), while intuitive, do not hold under traditional modeling assumptions. We also explain the connections between our results and similar ones for some classic problems of operations research. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2011     

A single-machine replacement model with learning

The replacement or upgrade of productive resources over time is an important decision for a manufacturing organization. The type of technology used in the productive resources determines how effectively the manufacturing operations can support the product and marketing strategy of the organization. Increasing operating costs (cost of maintenance, labor, and depreciation) over time force manufacturing organizations to periodically consider replacement or upgrade of their existing productive resources. We assume that there is a setup cost associated with the replacement of a machine, and that the setup cost is a nonincreasing function of the number of replacements made so far due to learning in setups. The operating cost of a newer machine is assumed to be lower than the operating cost of an older machine in any given period, except perhaps in the first period of operation of the new machine when the cost could be unusually high due to higher initial depreciation. A forward dynamic programming algorithm is developed which can be used to solve finite-horizon problems. We develop procedures to find decision and forecast horizons such that choices made during the decision horizon based only on information over the forecast horizon are also optimal for any longer horizon problem. Thus, we are able to obtain optimal results for what is effectively an infinite-horizon problem while only requiring data over a finite period of time. We present a numerical example to illustrate the decision/forecast horizon procedure, as well as a study of the effects of considering learning in making a series of machine replacement decisions. © 1993 John Wiley & Sons. Inc.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

Building the Somali National Army: Anatomy of a failure, 2008–2018

ABSTRACT

Over a decade of security force assistance (SFA) initiatives to build an effective Somali National Army (SNA) failed because of the interrelated effects of political, contextual and operational challenges. The key political challenges were interest asymmetry between international actors and Somali elites, insufficient focus on institution-building and a lack of donor coordination. The principal contextual challenges in Somalia were the legacies of two decades of state collapse and the negative effects of clan dynamics. The main operational challenges were building an army while simultaneously fighting a war, the complexities of military integration, and the severe capability gaps afflicting the SNA.     

The Enfield Lock Barrel Mill of 1815 and Moves to Replace Musket Barrel Grinding by Turning c1780 to c1840

In 1841 Henry Wilkinson in his book Engines of War and William Greener in The Science of Gunnery describe a range of methods then in use for shaping the outside of gun barrels after the barrel forging process, ranging from manual off-hand grinding to the use of precision machines. In the same year G. & J. Rennie published the design of their state-of-the-art lathe that was capable of turning complex and dished barrel forms. This built upon the earlier work of both Henry Nock and John Jones. In the early years of the 19th century both Britain, at Enfield and other locations, and the USA, at Harpers Ferry and Springfield, began to introduce barrel-turning technology. This paper uses measurements taken from a significant number of military barrels made by several makers, and also newly exposed information about Henry Nock and the Enfield Factory of 1815, to understand better the technologies that were applied to military flintlock barrel finishing from the 1780s to the 1840s, and particularly during the major wars of 1793–1815, when high output was paramount. Measurements both of barrel form and out-of-roundness are presented. These allow the interpretation of the techniques being used by different makers at different locations, and raise questions about the purpose and achievement of the complex dished barrel forms found on British military flintlock muskets. This approach also allows us to better describe the earliest factory on the Enfield site, one of the most significant sites in the wider history of UK manufacturing.