Suppression of enemy air defenses (SEAD) as an information duel

Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046     

Homeland Security and Intelligence: Can Oil Mix with Water in an Open Society?

The newest US Cabinet department is Homeland Security (DHS). One of the most controversial aspects in the process of developing this entity is the role of intelligence in providing information on the increasing terrorist threat. This article examines the intelligence challenges for homeland security. In doing so, it explores the problems of merging disparate cultures - law enforcement vs intelligence, civil entities vs military, federal vs state and local jurisdictions, and domestic focus vs international perspective. Given the nature of the globalized, asymmetric threat, the need for more and better intelligence sharing is obvious. Terrorists and other criminals do not respect international boundaries; in fact, they exploit them in an effort to prevent effective and timely countermeasures. This demands that robust multinational collaboration and interagency coordination be practiced.     

A new polynomial algorithm for maximum value flow with an efficient parallel implementation

A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc.     

Jointly constrained order quantities with all-units discounts

In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc.     

Multiechelon inventory systems with lateral supply

We develop approximations to estimate the expected backorders in a multiechelon system in which lateral supply actions between bases are allowed when a backorder occurs. These approximations are easy to compute, and the average absolute error over a wide range of parameter values is less than 4% when items are depot repairable, even when bases are dissimilar. With lateral supply, backorder reductions of 30-50% are not uncommon, and a 72% reduction was observed in two cases. Lateral supply becomes more important with low demand rates. A similar approach was unsuccessful for base-repairable items. However, lateral supply has a beneficial effect only when the lateral supply time is very short, 1/4 or less of the average base repair time. Even in such cases lateral supply is unlikely to be important in an actual application, because base management can expedite repair of critical items.     

Scheduling with earliness and tardiness penalties

We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous.     

Optimality of control limit policies in replacement models

We study a class of replacement models for systems subject to deterioration. The objective is to determine an optimal replacement policy that minimizes the average operating costs of the system. We use a parametric analysis to establish sufficient conditions for the optimality of control limit policies. This work generalizes several existing results for optimal replacement models in the literature. © 1992 John Wiley & Sons, Inc.