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

Soviet Nuclear Strategy from Stalin to Gorbachev: a Revolution in Soviet Military and Political Thinking. By Honore M. Catudal. Mansell, London (1988), ISBN 0–7201–2000–4, £25.00

The Military: More Than Just a Job? Edited by Charles C. Moskos and Frank R. Wood. Pergamon‐Brassey's, London (1988), ISBN 0–08–034321‐X, £17.00 ($30.00)

Douglas Haig, 1861–1928. By Gerard J. de Groot. Unwin Hyman, London (1988), ISBN 004 4401922, £20.00

Defence Policy Making. A Comparative Analysis. Edited by G. M. Dillon. Leicester University Press, Leicester (1988), ISBN 0–715–1268–5, £10.95

The Future of U.K. Air Power. Edited by P. Sabin. Brassey's, London (1988), ISBN 0–08–035825‐X (hardcover), 0–08–036256–7 (flexicover), hardcover £18.95 ($34.00), flexicover £9.95 ($17.95)     

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.     

Theoretical analysis of the general linear model for lanchester - type combat between two homogeneous forces

This paper studies Lanchester-type combat between two homogeneous forces modeled by the so-called general linear model with continuous replacements/withdrawals. It demonstrates that this model can be transformed into a simpler canonical form, which is also shown to arise from fixed-force-level-breakpoint battles modeled by Lanchester-type equations for modern warfare. Analytical expressions for the force levels for the general variable coefficient linear model with continuous replacements/withdrawals are constructed out of so-called general Lanchester functions for the model without replacements/withdrawals, for which all solutions are shown to be nonoscillatory in the strict sense. These force-level results are unfortunately so complicated and opaque that the constant-coefficient version of the model must be studied before any insights into the dynamics of combat may be analytically obtained. Thus, fairly complete results are given for the general linear model with constant attrition-rate coefficients and constant rates of replacement/withdrawal. However, the expressions for the force levels are still so complicated that we have not been able to develop battle-outcome prediction conditions directly from them alone but have had to establish general results on the qualitative behavior of solutions. A significant result (and one that greatly complicates the prediction of battle outcome) is that all solutions to the model with replacements/withdrawals are no longer necessarily nonoscillatory in the strict sense, i.e., both sides force levels can take on negative values if the force-on-force attrition equations are not “turned off” at the right time. Thus, this paper shows that the addition of continuous replacements/withdrawals to a Lanchester-type model may significantly change the qualitative behavior of the force-level trajectories. Battle-outcome prediction conditions are nevertheless given, and important insights into the dynamics of combat are briefly indicated.     

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 squared-variable transformation approach to nonlinear programming optimality conditions

We show that the well-known necessary and sufficient conditions for a relative maximum of a nonlinear differentiable objective function with nonnegative variables constrained by nonlinear differentiable inequalities may be derived using the classical theory of equality constrained optimization problems with unrestricted variables. To do this we transform the original inequality-constrained problem to an equivalent equality-constrained problem by means of a well-known squared-variable transformation. Our major result is to show that second order conditions must be used to obtain the Kuhn-Tucker conditions by this approach. Our nonlinear programming results are motivated by the development of some well-known linear programming results by this approach.     

Some experiments in global optimization

When applied to a problem which has more than one local optimal solution, most nonlinear programming algorithms will terminate with the first local solution found. Several methods have been suggested for extending the search to find the global optimum of such a nonlinear program. In this report we present the results of some numerical experiments designed to compare the performance of various strategies for finding the global solution.