On optimality of one‐bug‐look‐ahead policies for a software testing model

The optimality of the One‐Bug‐Look‐Ahead (OLA) software release policy proposed by Morali and Soyer ( 15 ) is re‐examined in this paper. A counterexample is constructed to show that OLA is not optimal in general. The optimal stopping approach is then called upon to prove that OLA possesses weaker sense of optimality under conditional monotonicity and the strong sense of optimality holds under a more restrictive sample‐wise monotonicity condition. The NTDS data are analyzed for illustration, and OLA is shown to be robust with respect to model parameters. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Estimation for a weibull accelerated life testing model

It is sometimes reasonable to assume that the lifetime distribution of an item belongs to a certain parametric family, and that actual parameter values depend upon the testing environment of the item. In the two-parameter Weibull family setting, suppose both the shape and scale parameters are expressible as functions of the testing environment. For various models of functional dependency on environment, maximum likelihood methods are used to estimate characteristics of interest at specified environmental levels. The methodology presented handles exact, censored, and grouped data. A detailed accelerated life testing analysis of stress-rupture data for Kevlar/epoxy composites is given.     

Simulation of nonhomogeneous poisson processes by thinning

A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates.     

Duality for quasi-concave programs with application to economics

A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices.     

Computational results with a branch-and-bound algorithm for the general knapsack problem

In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.     

Differential-game examination of optimal time-sequential fire-support strategies

Optimal time-sequential fire-support strategies are studied through a two-person zero-sum deterministic differential game with closed-loop (or feedback) strategies. Lanchester-type equations of warfare are used in this work. In addition to the max-min principle, the theory of singular extremals is required to solve this prescribed-duration combat problem. The combat is between two heterogeneous forces, each composed of infantry and a supporting weapon system (artillery). In contrast to previous work reported in the literature, the attrition structure of the problem at hand leads to force-level-dependent optimal fire-support strategies with the attacker's optimal fire-support strategy requiring him to sometimes split his artillery fire between enemy infantry and artillery (counterbattery fire). A solution phenomnon not previously encountered in Lanchester-type differential games is that the adjoint variables may be discontinuous across a manifold of discontinuity for both players' strategies. This makes the synthesis of optimal strategies particularly difficult. Numerical examples are given.     

The optimum design of multivariate acceptance sampling plans

A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example.     

Force-annihilation conditions for variable-coefficient lanchester-type equations of modern warfare

This paper develops a mathematical theory for predicting force annihilation from initial conditions without explicitly computing force-level trajectories for deterministic Lanchester-type “square-law” áttrition equations for combat between two homogeneous forces with temporal variations in fire effectivenesses (as expressed by the Lanchester attrition-rate coefficients). It introduces a canonical auxiliary parity-condition problem for the determination of a single parity-condition parameter (“the enemy force equivalent of a friendly force of unit strength”) and new exponential-like general Lanchester functions. Prediction of force annihilation within a fixed finite time would involve the use of tabulations of the quotient of two Lanchester functions. These force-annihilation results provide further information on the mathematical properties of hyperbolic-like general Lanchester functions: in particular, the parity-condition parameter is related to the range of the quotient of two such hyperbolic-like general Lanchester functions. Different parity-condition parameter results and different new exponential-like general Lanchester functions arise from different mathematical forms for the attrition-rate coefficients. This theory is applied to general power attrition-rate coefficients: exact force-annihilation results are obtained when the so-called offset parameter is equal to zero; while upper and lower bounds for the parity-condition parameter are obtained when the offset parameter is positive.     

The cyclic separation scheduling problem

This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given.     

Optimizing submarine berthing with a persistence incentive

Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997.