THE ACRS EXPERIENCE AND ITS RELEVANCE TO THE WMDFZ CONFERENCE

This article examines the arms control logic that was applied to the only regional arms control talks that have taken place in the Middle East to date: the Arms Control and Regional Security (ACRS) working group that was part of the multilateral track of the Madrid peace process in the early 1990s. It highlights both the successes and major constraints of the ACRS talks in an effort to assess what might be relevant to the weapons of mass destruction-free zone conference proposed for later this year. In addition to the basic arms control dilemmas that will continue to challenge this conference—as they did ACRS—the article suggests that current conditions in the Middle East are even less conducive to regional dialogue than they were in the earlier period, due to the internal upheavals in several key Arab states, and the specific challenge of Iran's move to develop a military nuclear capability.     

Are PRTs Supposed to Compete with Terrorists?

This chapter discusses the impact Provincial Reconstruction Teams (PRTs) have on the security situation in Afghanistan, specifically in countering the terrorist threat and in counter-narcotics.

The Afghan people define the lack of security as their country's greatest problem. The terrorist activities of groups opposed to the central government and the political process compounded by violence related to the opium trade are seen as the main sources of insecurity. The authors argue that, currently, PRTs should not assume active counterterrorism as an additional main area of operation. The complexity of Afghanistan's security environment and the pressure to have PRTs involved in the counter-narcotics effort underscore the necessity of local knowledge and experience in the PRTs. Participation of indigenous actors, such as NGOs, in the PRT-organisational structure could provide this required expertise.     

Nature of renyi's entropy and associated divergence function

Nature of Renyi's entropy and associated divergence function is discussed in terms of concave (convex) and pseudoconcave (pseudoconvex) functions.     

A forward network simplex algorithm for solving multiperiod network flow problems

An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic.     

War reserve spares kits supplemented by normal operating assets

In peacetime, base stock levels of spares are determined on the assumption of normal resupply from the depot. In the event of war, however, a unit must be prepared to operate from stock on hand for a period of time without being resupplied from the depot. This paper describes a mathematical model for determining such war reserve spares (WRS) requirements. Specifically, the model solves the following kind of optimization problem: find the least-cost WRS kits that will keep the probability of a stockout after K cannibalizations less than or equal to some target objective α. The user of the model specifies the number of allowable cannibalizations, and the level of protection that the kit is supposed to provide. One interesting feature of this model is that in the probability computation it takes into account the possiblility of utilizing normal base operating assets. Results of a sensitivity analysis indicate that if peacetime levels were explicitly taken into account when designing a WRS kit, a cost saving of nearly 40 percent could be effected without degrading base supply performance in wartime.     

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.