Expectation of contract incentives

The application of statistical expectation to risk density functions and fee/incentive-element relationships is shown to be useful in structuring contract incentives. A mathematical procedure for calculating the expected value of fee for a given risk/incentive arrangement is described along with cost examples and related sensitivity analyses. The structuring of equivalent incentives is demonstrated by the use of the contracting procedure used for procuring the C-5A aircraft.     

Minimal disconnecting sets in directed multi-commodity networks

The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network.     

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.     

On the equivalence between the Node-ARC and ARC-Chain formulations for the multi-commodity maximal flow problem

The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence.     

Vector processing approach to constrained network problems

Modification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large-scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problems.     

An infiltration game on k arcs

An infiltrator, starting at a safe base, tries to pass, undetected by a guard and within a time limit, along one of k nonintersecting arcs to a safe destination. Optimal strategies and the value are obtained for this discrete zero-sum search-evasion game.     

Multilateral Counter-Insurgency Networks

Postmodern terrorism presents a significant challenge to global security and law enforcement institutions. Non-state actors operating across international borders, engaged in an apparent global insurgency of extremism that transects the traditional boundaries of crime and war, pose significant challenges to both intelligence and law enforcement agencies. These networked global insurgents blend political and religious fanaticism with criminal enterprises to challenge the rule of law and pose an epochal shift in the structures and relations among states. Negotiating this epochal shift requires traditional organs of national security (the diplomatic, military and intelligence services) to forge new partnerships with police and public safety organizations at the state and local (sub-national), as well as transnational levels. Significant operational, policy and cultural challenges must be overcome to forge an effective multi-lateral global network to counter global terrorism and insurgency.     

Brothers in arms,yet again? Twenty-first century Sino-Russian strategic collaboration in the realm of defence and security

2014–2015 were years of turmoil for strategic relations, with Sino-Russian relations emerging as a particularly interesting set of ties to observe. This article asks whether recurrent Sino-Russian exhortations of friendship are mirrored by their strategic alignment in the defence and security realm, half a century after the end of the Sino-Soviet pact during the communist era. We examine the arms trade between the two countries and with regional partners, but also the recent pattern of bilateral and multilateral military exercises, as a combined test of the security and defence relationship. We are able to show that the image of friendship that both Moscow and Beijing like to promote, while apparent at the UN Security Council and within the BRICS group, remains constrained by rivalry in high-tech segments of the arms industry and by lingering concerns about the prospects of peer interference in their shared regional vicinity.