An enterprise portfolio approach for defence capability planning

Capability-based planning (CBP) is considered by many defence organisations to be the best practice for enterprise-level planning, analysis and management. This approach, loosely based around investment portfolio theory, is premised on balancing the cost, benefit and risk of capability options across the defence enterprise. However a number of authors have recently noted limitations of its current applications. The authors propose a more general, insurance-based approach, which can support the evolutionary improvement of the current CBP approach. This approach is implemented as hedging-based planning and aims to better reflect the enterprise nature of defence organisations, capturing both force structure and force generation aspects of military systems.     

Can Smart Defense work? A suggested approach to increasing risk- and burden-sharing within NATO

“Smart Defense” is NATO's new approach to risk- and burden-sharing, which has been a chronic problem within the alliance since the 1950s. Numerous solutions have been proposed, but initiatives resulting in more equitable burden-sharing have never been fully implemented. There are two driving forces influencing a county's willingness to support such initiatives – the economic theory of alliances and the risks posed by the implementation of capability sharing. The authors examine each of these and propose that rather than aiming for group consensus on the production of capabilities, NATO should focus on interoperability through support functions. This approach provides the most likely solution for connecting the forces, doctrine, procedures, standards and other factors of joint capability production such that country leaders find the risks of doing so to be politically and militarily acceptable.     

Securing a border under asymmetric information

We study a stochastic interdiction model of Morton et al. IIE Transactions, 39 (2007):3–14 that locates radiation sensors at border crossings to detect and prevent the smuggling of nuclear material. In this model, an interdictor places sensors at customs checkpoints to minimize a potential smuggler's maximum probability of crossing a border undetected. We focus on a model variant in which the interdictor has different, and likely more accurate, perceptions of the system's parameters than the smuggler does. We introduce a model that is tighter and uses fewer constraints than that of Morton et al. We also develop a class of valid inequalities along with a corresponding separation procedure that can be used within a cutting‐plane approach to reduce computational effort. Computational results demonstrate the effectiveness of our approach.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 91–100, 2014     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Determining confidence bounds for highly reliable coherent systems based on a paucity of component failures

A computationally simple method for obtaining confidence bounds for highly reliable coherent systems, based on component tests which experience few or no failures, is given. Binomial and Type I censored exponential failure data are considered. Here unknown component unreliabilities are ordered by weighting factors, which are firstly presumed known then sensitivity of the confidence bounds to these assumed weights is examined and shown to be low.     

The Meaning of the Nuclear Evolution: China's Strategic Modernization and US-China Security Relations

Abstract

Will China's development of a new generation of nuclear weapons impact US-China security relations in important ways? One's answer depends on how one views the following: whether or not Chinese leaders believe that they are only now acquiring a secure second strike capability; the scope of coercive power that secure second strike capability provides to conventionally inferior actors; the meaning of China's ‘No First Use’ Doctrine; and the prospects for escalation control in future crises. Applying Cold War theories and tapping Chinese doctrinal writings this article concludes that China's nuclear modernization program might prove more consequential than is commonly believed.