A proportional defense model

This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed.     

Bounds on the availability function

This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given.     

An algorithm for separable piecewise convex programming problems

We present a branch and bound algorithm to solve mathematical programming problems of the form: Find x =|(x₁,…x_n) to minimize Σ?_i0(x₁) subject to x?G, l≦x≦L and Σ?_i0(x₁)≦0, j=1,…,m. With l=(l₁,…,l_n) and L=(L₁,…,L_n), each ?_ij is assumed to be lower aemicontinuous and piecewise convex on the finite interval [l_i.L_i]. G is assumed to be a closed convex set. The algorithm solves a finite sequence of convex programming problems; these correspond to successive partitions of the set C={x|l ≦ x ≦L} on the bahis of the piecewise convexity of the problem functions ?_ij. Computational considerations are discussed, and an illustrative example is presented.     

Scheduling to minimize the weighted sum of completion times with secondary criteria

A result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented. Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems.     

The bilinear programming problem

The paper deals with bilinear programming problems and develops a finite algorithm using the “piecewise strategy” for large-scale systems. It consists of systematically generating a sequence of expanding polytopes with the global optimum within each polytope being known. The procedure then stops when the final polytope contains the feasible region.     

Stationary (s,s) policies for a finite horizon

In the finite-horizon stochastic (s, S) inventory model with periodic review the parameters of the optimal policy generally vary with the length of the horizon. A stationary policy, however, is easier to implement and may be easier to calculate. This paper studies optimal stationary policies for a finite horizon and relates them to optimal policies through their relation to optimal stationary policies for an infinite horizon.     

Systems analysis and planning-programming-budgeting systems (PPBS) for defense decision making

Systems analysis office titles have permeated both government and business organization charts in recent years. Systems analysis as a discipline, however, even though increasingly accepted, has eluded precise definition. For the most part, it has been loosely described as “quantitative common sense” and “the general application of the scientific method.” Emphasis is placed upon the application of eclectic disciplines to a wide variety of problems. Concepts and techniques have been drawn heavily from economics, mathematics, and political science. In the Department of Defense, systems analysis has been used extensively in the evaluation of weapon systems during the last 9 years. During the 1960's, it provided the underlying concepts for the control system PPBS (Planning-Programming-Budgeting System). This article traces the origins of systems analysis within the Department of Defense and describes and analyzes the application of the technique. Although there always exists disagreement, it is generally accepted that the origin of systems analysis coincided with the inception of R. S. McNamara's administration of the Department of Defense. McNamara organized the Systems Analysis office under Mr. Charles Hitch, who had previously developed many basic systems analysis concepts at project RAND. From Hitch's basic concepts, the approach became increasingly sophisticated in evaluating complex weapons systems. Coincidently, the organizational procedures for implementing systems analysis also evolved. Under the current Department of Defense administration, the new organizational procedures emerging are contrasted with the old.     

Search techniques for a nonlinear multiprocessor scheduling problem

The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph.     

An alternative proof of the IFRA property of some shock models

Let , where A (t)/t is nondecreasing in t, {P(k)^1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models.     

On a class of nash-solvable bimatrix games and some related nash subsets

This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory.