Book reviews

Encyclopaedia of Modern Air Force Squadrons. By Chris Ashworth. Patrick Stephens, London (1989), ISBN 1-8526-013-6, £19.95

The Future of Sea Power. By Eric Grove. Routledge, London (1990), ISBN 0-415-00482-9, £35.00

Soviet Strategic Interests in the North. By Kirsten Amundsen. Pinter, London (1990), ISBN 0-86187-018-2, £30.00

Soviet Seapower in Northern Waters. Edited by John Skogan and Arne Brundtland. Pinter, London (1990), ISBN 0-86187-038-7, £35.00

Glasnost, Perestroika, and U.S. Defense Spending. By William W. Kaufmann, Brookings Institution, Washington, DC (1990), ISBN 0-8157-4881-7, $8.95

The Educating of Armies. Edited by Michael D. Stephens. Macmillan, London (1989), ISBN 0-333-43447-1, £35.00     

Book Reviews

Strategic Geography. By Hugh Faringdon. Routledge, London (1989), ISBN 0-415-00980-4, £40.00

Field Artillery and Firepower. By J. B. A. Bailey. The Military Press, Oxford (1989), ISBN 0-85066-810-7, £25.00 (hardback), ISBN 0-85066-811-5, £14.50 (paperback)

U.S.-Soviet Security Cooperation. Edited by Alexander L. George, Philip J. Farley and Alexander Dallin. Oxford University Press, New York (1988), ISBN 0-19-505397-4, £30.00 (hardback), $19.95 (paperback)

Non-production by Industry of Chemical-warfare Agents: Technical Verification under a Chemical Weapons Convention. Edited by S. J. Lundin. SIPRI/Oxford University Press, Oxford (1988), ISBN 0-19-829129-9, £19.50

Ireland's Terrorist Trauma: Interdisciplinary Perspectives. Edited by Alan O'Day and Yonah Alexander. Harvester Wheatsheaf, Hemel Hempstead (1989), ISBN 7450-049003, £27.50 ($48.65)

Pilots and Rebels: the Use of Aircraft in Unconventional Warfare 1918-1988. By P. A. Towle. Brassey's (UK), London (1989), ISBN 0-08-036712-7, £29.95 ($53.95)     

Systems defense games: Colonel blotto,command and control

The classical “Colonel Blotto” games of force allocation are generalized to include situations in which there are complementarities among the targets being defended. The complementarities are represented by means of a system “characteristic function,” and a valuation technique from the theory of cooperative games is seen to indicate the optimal allocations of defense and attack forces. Cost trade-offs between systems defense and alternative measures, such as the hardening of targets, are discussed, and a simple example is analyzed in order to indicate the potential of this approach.     

A theoretical and computational comparison of “equivalent” mixed-integer formulations

This paper provides a theoretical and computational comparison of alternative mixed integer programming formulations for optimization problems involving certain types of economy-of-scale functions. Such functions arise in a broad range of applications from such diverse areas as vendor selection and communications network design. A “nonstandard” problem formulation is shown to be superior in several respects to the traditional formulation of problems in this class.     

On convexity proofs in location theory

It is often assumed in the facility location literature that functions of the type ø_i(x_i, y) = β_i[(x_i-x)²+(y_i-y)²]^K/2 are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given.     

A linear programming solution to the generalized rectangular distance weber problem

The Weber Problem generalized to the location of several new points with respect to existing points is formulated as a linear programming problem under the assumption that distances are rectangular. The dual problem is then formulated and subsequently reduced to a problem with substantially fewer variables and constraints than required by an existent alternative linear programming formulation. Flows may exist between new as well as between new and existing points. Linear constraints can be imposed to restrict the location of new points. Pairwise constraints limiting distances between new points and between new and existing points can also be accommodated.     

“simple-approximate” battle-outcome-prediction conditions for variable-coefficient lanchester-type equations of modern warfare

This article considers combat between two homogeneous forces modeled by variable- coefficient Lanchester-type equations of modern warfare and develops new “simple-approximate” battle-outcome-prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed-force-level-breakpoint battles and fixed-force-ratio-breakpoint battles). These battle-outcome-prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force-level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition-rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable-coefficient Lanchester-type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is range dependent) being examined in detail.     

Toward a study of bidding processes part IV - games with unknown costs

This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric.     

Use of completely reduced matrices in solving transportation problems with fixed charges

This paper shows how completely reduced matrices can be used in obtaining exact or approximate solutions to transportation problems with fixed charges. It does not treat methods for obtaining reduced matrices, which are available elsewhere, but it does discuss the problem of obtaining a completely reduced matrix, and then a general parametric solution to the primal problem, from any particular solution. Methods for obtaining particular solutions with determinacies of maximum order (solutions for the constant fixed charges problem) are then presented. The paper terminates with a discussion of methods which are useful in obtaining approximations to solutions of fixed charges problems with charges not constant.