The road not taken: Conflict termination and guerrillaism in the American Civil War

Irrespective our views on the rationality of our opponent's continuing to conduct operations against us, unless utterly extirpated, he retains a vote on when and how conflict will end. This is because war is about power — compelling another actor to do something he would not otherwise do, or to cease doing something he would otherwise prefer to do. In planning for conflict termination we should account for the peculiarities of opponents who may decide not to quit when we have beat them fair and square. We do not desire that they cease conventional fighting, but that they cease fighting altogether.     

Encircled by enemies: Stalin's Perceptions of the capitalist world, 1918 – 1941

The article examines Stalin's intelligence on the capitalist world, including materials from military archives, diplomatic archives, and Stalin's private papers. It explores how these materials were collected, interpreted and shaped by Stalin's prejudices. It concludes that, from the end of the Civil War to the Nazi invasion, Stalin and the Soviet leadership believed that the Soviet Union was under a nearly constant threat of invasion from shifting coalitions of capitalist powers. No such threat existed until the late 1930s, but Stalin's perceptions have important implications for our understanding of Soviet foreign and domestic politics in the interwar period.     

The RAF staff college and the evolution of British strategic bombing policy, 1922–1929

This article borrows from the work of Clausewitz to posit two general approaches to the pursuit of limitation in war, one being political and the other technical. The political approach seeks to control escalation via consensual arrangements with the adversary, while the technical approach seeks to forestall escalation by peremptorily destroying the enemy's military capability. It is argued that the 'Revolution in Military Affairs' (RMA) instantiates the second, technical, approach to war limitation. By exploiting advanced technology, the US armed forces hope to limit the costs of war by defeating their adversaries in a rapid, decisive manner. The problems associated with this approach are discussed in relation to the nature of the conflicts that the US is likely to face in the foreseeable future. The article concludes by suggesting that such conflicts will require that more attention be paid to the political sources of limitation in war.     

Zero-sum games with multiple goals

This paper investigates a class of two-person zero-sum multiple payoff games in which each component is deterministic. The problem of minimizing a player's total underachievement of a fixed set of goals is shown to reduce to a linear programming problem. Applications are discussed and illustrative examples are presented.     

Penalty calculations and branching rules in a LAV best subset procedure

Least absolute value (LAV) regression has become a widely accepted alternative to least squares regression. This has come about as the result of advancements in statistical theory and computational procedures to obtain LAV estimates. Computer codes are currently available to solve a wide range of LAV problems including the best subset regression. The purpose of this article is to study the use of penalty calculations and other branching rules in developing the solution tree for the best subset LAV regression.     

A linear programming model for design of communications networks with time varying probabilistic demands

In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method.     

Some results of the queueing system E/M/c

This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.     

A note on duality in homogeneous fractional programming

For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.