Determining optimal growth paths in logistics operations

This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated.     

An operator theory of parametric programming for the transportation problem-I

This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved.     

Identifying the spoilers in the security sector reform – disarmament demobilisation and reintegration process in the Congo

The Congolese security sector reform – disarmament demobilisation and reintegration (SSR-DDR) process has suffered from setbacks in its military sector during the last 10 years, such as insufficient funding, lack of coordination and domestic reluctance to major changes, with as a result, a very fragile and disjointed Army. These problems have deepened as officers have defected from the Army and caused new instability in the East of the Congo. This article aims to analyse the recent mutinies and the reaction by the Congolese government by applying a capabilities-based approach in combination with a typology of spoilers. The objective is to identify and classify the spoilers and answer the questions of why they emerge now and how they are dealt with on a national level. From the analysis, the author suggests that there are several spoilers involved in the current situation – the most powerful being the Congolese and the Rwandan governments, prompting the question of whether an international involvement is necessary to solve the problem.     

DECIDING NOT TO JOIN THE NUCLEAR CLUB

Nonproliferation Norms: Why States Choose Nuclear Restraint, by Maria Rost Rublee. University of Georgia Press, 2009. 296 pages, $22.95.     

Algorithms for minimizing total cost,bottleneck time and bottleneck shipment in transportation problems

We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors.     

Multiperiod capacity expansion and shipment planning with linear costs

In this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non-decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided.     

Learning to Fight and Fighting to Learn: Practitioners and the Role of Unit Publications in VIII Fighter Command 1943–1944

A military cannot hope to improve in wartime if it cannot learn. Ideally, in wartime, formal learning ceases and the application of knowledge begins. But this is optimistic. In 1942, USAAF Eighth Air Force assumed it had the means necessary for victory. In reality, its technique and technology were only potentially – rather than actually – effective. What remained was to create the practice of daylight bombing – to learn. This article (1) recovers a wartime learning process that created new knowledge, (2) tests existing tacit hypotheses in military adaptation research, and (3) offers additional theoretical foundation to explain how knowledge is created in wartime     

Nuclear Weapons and the Vietnam War

This article analyzes why US leaders did not use nuclear weapons during the Vietnam War. To date, there has been no systematic study of US decision-making on nuclear weapons during this war. This article offers an initial analysis, focusing on the Johnson and Nixon administrations. Although US leaders did not come close to using nuclear weapons in the conflict, nuclear options received more attention than has previously been appreciated. Johnson's advisers raised the issue of nuclear weapons and threats on several occasions, and Henry Kissinger, Nixon's national security adviser, looked into nuclear options to bring the war to an end. Ultimately, however, both administrations privately rejected such options. The conventional explanation for the non-use of nuclear weapons during the Cold War – deterrence – is insufficient to explain the Vietnam case. This article analyzes the role of military, political and normative considerations in restraining US use of nuclear weapons in the Vietnam War. It argues that while military and political considerations, including escalation concerns, are part of the explanation, a taboo against the use of nuclear weapons played a critical role.     

THE ROLE OF LEGITIMACY IN STRENGTHENING THE NUCLEAR NONPROLIFERATION REGIME

The nuclear nonproliferation regime and its essential foundation, the Treaty on the Non-Proliferation of Nuclear Weapons (NPT), are currently under grave stress. The challenges that have plagued the regime since its inception–universal adherence and the pace of disarmament–persist. But new threats raise questions about the effectiveness of the treaty in preventing the spread of nuclear weapons. These include: clandestine pursuit of nuclear weapons by some NPT parties without the knowledge of the international community and the International Atomic Energy Agency in violation of their obligations; the role of non-state actors in proliferation; and renewed interest in the full nuclear fuel cycle, technology necessary to create fissile material for weapons. This article considers recent prominent proposals to address these three threats and assesses them according to their ability to gain legitimacy, a crucial element in strengthening a regime's overall effectiveness.     

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relationships among pairs of jobs (whenever possible) and eliminates the first and the last few jobs in an optimal sequence. The remaining jobs are then ordered by incorporating the precedence relationships in a dynamic programming framework. Propositions are proved which considerably reduce the total computation involved in the dynamic programming phase. Computational results indicate that the solution time goes up less than linearly with the size (n) of the problem. The median solution time for solving 50 job problems was 0.36 second on UNIVAC 1108 computer.