Exact expected values of variance estimators for simulation

We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Initiatives in Africa

Since the 1st oil crisis in 1973, the economies of sub-Saharan Africa have barely kept pace with their burgeoning populations. Women in Sub-Saharan Africa give birth more often than women in any other region of the world, with an average of more than 6.5 live births each. The region's natural increase average 2.5% a year in the 1960s, 2.7% in the 1970s, and in the mid-1980s, it is 3.1% per annum--a rate that will double the regions population in 22 years. National leaders in Sub-Saharan Africa were slow to consider population policy as a key component of the social and economic development effort. The neglect of population issues is reflected in the limited scope of public or private family planning programs in the sub-continent. Donor countries and institutions play an important role in developing the information base by providing technical training to government staff, supporting research, and disseminating information to a broad spectrum of political actors. Some examples of policy reconsiderations in Nigeria, Zambia, Liberia, and Niger are given. These countries are starting to give active consideration to population policies to reduce fertility and high rates of population growth by expanding family planning services, raising the age of marriage, improving the status of women, providing family-life education, and incorporating economic incentives for smaller families into the provision of social services. The highly centralized nature of African governments dictates that the acquiescence of the governmental elite must be obtained before any policy can take hold. Overall, high population growth rates in combination with a stagnating social and economic development effort throughout the region have provided the catalyst for a new look at Sub-Saharan Africa population policy. The ability of African nations to implement policies that reduce fertility is more open to question; no African nation has as yet done so, and the socioeconomics factors contributing to high fertility remain strong.     

Book Reviews

National Security Concepts of States: New Zealand. By Kennedy Graham. Taylor & Francis, London (1989), ISBN 0-8448-1614-0, £27.00

Power and Prestige in the British Army. By R.G. L. von Zugbach. Gower, Aldershot (1988), ISBN 0-566-05561-9, £22.50

The American Civil War and the Origins of Modern Warfare—Ideas, Organization, and Field Command. By Edward Hagerman. Indiana University Press, Bloomington, IN (1988), ISBN 0-253-30546-2, $37.50 (£23.29)

British Seapower and Procurement between the Wars: a Reappraisal of Rearmament. By G. A. H. Gordon. Macmillan, London (1988), ISBN 0-333-42332-1. £29.50

Armies in Low-intensity Conflict: a Comparative Analysis. Edited by David A. Charters and Maurice Tugwell. Brassey's Defence Publishers, London (1989), ISBN 0-08-036253-2, £25.00 ($45.00); Deadly Paradigms: the Failure of U.S. Counterinsurgency Policy. By Michael Shafer, Leicester University Press, Leicester (1988), ISBN 0-7185-1311-8, £28.00

British Defence Policy Striking the Right Balance. By J. Baylis. Macmillan, London (1989), ISBN 0-333-49133-5, £29.50 or £9.99     

A note on a model for evasive vehicle movement along a fixed path

A model for a vehicle moving evasively along a fixed path is defined in terms of a two- state semi-Markov process. An important feature of this model is the continuous movement of the vehicle as a function of time. One potential application of this model is the development of a strategy for the deployment of long-range missiles on long underground tracks.     

Impact of an all volunteer force upon the navy in the 1972-1973 timeframe

This paper develops estimates of true volunteer levels for 1972 and 1973, based on experience gained through 1970 draft lottery data. The paper also formulates estimates of the qualitative characteristics of a 1972-1973 Navy volunteer force, and establishes a relationship between rate of volunteerism and military pay. Utilizing estimates generated in the paper, Navy military personnel budget requirements for FY '72 and '73 are presented.     

A technique which combines modified pattern search methods with composite designs and polynomial constraints to solve constrained optimization problems

This paper presents a method of selecting design parameters which optimizes a specific measure (aircraft design example: minimum weight, maximum mission effectiveness) and guarantees designated levels of response in specified areas (such as combal ceiling, acceleration time). The method employs direct search optimization applied to a nonlinear functional constrained by nonlinear surfaces. The composite design technique is combined with regression methods to determine adequate surface representations with a minimum of required data points. A sensitivity analysis is conducted at the optimum set of design parameters to test for uniqueness.     

On computing the expected discounted return in a markov chain

The discounted return associated with a finite state Markov chain X₁, X₂… is given by g(X₁)+ αg(X₂) + α²g(X₃) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere. Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well-known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono-tonely to the solution. Hence, the method is relatively free of error control problems. Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N², than to N³.