Vessel allocation by linear programming

This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel.     

The rules of engagement in Somalia – a judge advocate's primer 1

Scholars disagree on the prevailing focus on insurgent ideology. Some claim that the dominant Marxist ideology of the Cold War era has been supplanted by a new focus on ethnic and national identity. Others claim that many insurgencies were always focused on identity, but the Cold War and superpower antipathies distorted perceptions of insurgencies as politically-economically focused. Yet the heart of the matter is that analysts are not faced with an ‘either/or’ proposition.     

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Civil Wars,International Conflicts and Other Determinants of Paramilitary Strength in Sub-Saharan Africa

Previous research on African military spending suggests the existence of civil strife as the best predictor of high levels of military spending. However, little is known about why some African nations maintain strong ‘auxiliary’ or paramilitary organizations while others do not. This study finds that the presence of civil or interstate war does not strengthen reserve or irregular forces. Civilian governments promote strong paramilitary organizations to counter any threat the regular military might pose to regime survivability as a form of clientelist politics.     

Performance measurement in military operations: information versus incentives

We explore the impact of strategic assessment efforts on military organizations at war. To do so, we construct a model to explore the impact of a principal’s choice among imperfect performance metrics for a military operation. In doing so, the principal must consider both the incentivizing and informational properties of the metric. We show the conditions under which uncertainty regarding the nature of the agent, as well as uncertainty regarding the operational environment, drives a metric choice that induces pathological behavior from the agent. More specifically, a poor metric choice can create an overly optimistic assessment and end up prolonging the conflict. We illustrate the model’s insights in the cases of World War II and the Vietnam War.     

Branch and bound methods for a search problem

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch and Bound methods, with emphasis on the tradeoff between the accuracy of the bound employed and the time required to compute it. A variety of bounds are investigated, some of which are new. In most cases the best bounds turn out to be imprecise, but very easy to compute. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 243–257, 1998