Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Book reviews

The Political Economy of Defense, Ross A. L. (ed), Greenwood Press, 1991, New York. pp. ix, 229; ISBN 0–313–26462–7, Price $47.95

Economie Politique de la Defense, Jacques Aben, (Paris: Editions Cujas, 1992, 170 pages, 120 French Francs, ISBN: 2–254–92723‐X)     

Institutional Analysis and Irregular Warfare: A Case Study of the French Army in Algeria 1954–1960

This article proposes a case study to illustrate the usefulness of sociological institutional analysis as a method to uncover ‘blue force’ challenges to deal with irregular warfare. The French Army's adaptation to revolutionary warfare in Algeria, starting in 1954, is used to illustrate both the application of the methodology and how institutional forces can hinder as well as overwhelm transformation for irregular warfare. The analysis emphasizes three key dimensions of the French Army's institutional adaptation: the regulative, normative and cognitive. These empirical elements are used to show how they interacted and influenced the institutional implementation of the French COIN structures.     

Scheduling with earliest start and due date constraints on multiple machines

We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times a_i, a_i, ? 0, require d_i time units for processing and must be completed by times b_i for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed.     

On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem

Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/F_max) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness.     

(0, 1) hyperbolic programming problems

In the first part of this paper we study the unconstrained {0, 1} hyperbolic programming problem treated in [1]. We describe a new algorithm for this problem which produces an optimal solution by scanning just once the set of fractions to be analysed. This algorithm shows better computing performance than the one described in [1]. In the second part we study the {0, 1} hyperbolic programming problem with constraints given by inequalities on nondeereasing pseudo-boolean functions. We describe a “branch and bound” type algorithm for this problem.     

Detection of a Markovian target with optimization of the search efforts under generalized linear constraints

This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009     

THE REAL STORY BEHIND THE MAKING OF THE FRENCH HYDROGEN BOMB

Based on the first-person account of coauthor Pierre Billaud, a prominent French participant, this article describes for the first time in such detail the history of the development of the French hydrogen bomb in the 1960s and the organization of military nuclear research in France. The authors illustrate the extent to which French defense and governmental authorities did not support research on thermonuclear weapons until 1966. Billaud, a project insider, relates the historical episodes that led to France's successful 1968 thermonuclear test, including the names of the individuals involved and how a timely tip from a foreign source hastened the success of the first H-bomb test.     

South Africa and Peace Support Operations: Limitations,Options and Challenges

Abstract

Malawi's political transition from single-party rule to multiparty democracy in June 1994 raised expectations for sustainable peace in the country by, among others, passing a new legal framework that provided for conflict resolution mechanisms and good governance. However, political conflicts that have posed challenges to the foundations of peace and political stability have been a characteristic of the multiparty dispensation, leading to interventions by indigenous institutions whose aim is to build peace. This paper, which is based on field research, analyses the major political conflicts that have occurred on Malawi's political scene since the 1990s. Using the Public Affairs Committee as a case study, the paper illustrates the challenges facing the indigenous conflict resolution mechanisms. It also shows that despite the political transition, the socio-political environment still exhibits political behaviour and norms formed during the 30 years of single-party rule. There is a need for capacity-building and deliberate policy to enhance the indigenous-based mechanisms in order to promote sustainable peace in the country.