Multinational rapid response mechanisms: Past promises and future prospects

Military rapid response mechanisms are generally understood as troops that are on standby, ready to be deployed to a crisis within a short time frame. Yet, the overall track record of the existing multinational rapid response mechanisms within the European Union, the African Union, and North Atlantic Treaty Organization remains disappointing, and the United Nations does not even have a rapidly deployable capacity anymore. Meanwhile, despite that calls for the further development of these mechanisms are still being voiced politically, scholarly literature remains fragmented. This is problematic as many of the obstacles faced by these organizations are similar. This forum uniquely compares experiences from the four aforementioned organizations. Drawing on these insights, this introductory article identifies some key factors that hamper or enable the development and deployment of multinational rapid response mechanisms.     

The US NATO and military burden sharing: post-Cold War accomplishments and future prospects

NATO burden sharing has become an especially timely issue in the past several years as a result of a number of factors, including Russian annexation of Crimea and destabilization of eastern Ukraine in 2014. This article argues that alliance unity among the great democracies of Europe and North America is indispensable to peace and stability on the Eurasian continent. A fractured NATO, and especially, a large divide in purposes or commitments as between the United States and its European security partners, invites aggression and the possibility of inadvertent escalation. Past successes and failures in US-involved multinational peace and stability operations, within and outside of Europe, show that mission accomplishment requires give and take, including the occasional acceptance of unequal costs and benefits among the members, in order to achieve peace and security objectives.     

Transient analysis of multiple-unit reliability systems

A general Markovian model representing several multiple-unit redundant repairable systems is proposed and its transient behavior is studied. Specifically, for multiple-unit reliability system the reliability and availability functions are derived in an explicit form for the transient case. The stationary availability and mean time to system failure are deduced from the main results as special cases.     

Single-machine scheduling with early and tardy completion costs

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc.     

Cost allocation and communication

This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc.     

Striking a deal on the F-35: multinational politics and US defence acquisition

Why does joint defence production of advanced weapons systems, which appears like a logical choice at first, become harder for both the primary production state and its allies to manage and justify as the acquisition process runs its course? To answer this question, we analyze the multinational politics of the F-35 JSF with a focus on how secondary states who have bought into the program are affected by domestic politics within the primary production state. We find that US congressional and bureaucratic politics, cuts to US defence spending, and a desire to retain tight control over the program has locked allies into a program with which they have little leverage. Potentially losing the ability to fight along side the US if they don’t follow through, coupled with inter-Alliance pressures, leaves secondary states who are involved with the F-35 program, vulnerable to the whims of US domestic politics.     

Why do they serve? Changes and differences in motives of Danish soldiers deployed to peace-keeping and peace-enforcing missions

This paper investigates what motivates young people to volunteer for peace-keeping or peace-enforcing missions and how their motives change between pre- and post-deployment. Data include information about social and military background, and motives for more than 600 soldiers, 444 of whom answered the survey both before and after deployment. Soldiers are deployed to different missions under the same circumstances. To conceptualize motives among soldiers, we use factor analysis and find three factors: challenge, self-benefit, and fidelity. Challenge represents an occupational orientation; fidelity, an institutional orientation; and self-benefit, a desire for adventure. Exploiting the within-subject design of our data, we find that pre- and post-deployment motives vary significantly according to the type of mission and soldiers’ previous experiences (first-timers or experienced soldiers). Our results suggest that after the mission, peace-keepers are generally more disappointed than peace-enforcers. Our results also show that self-benefit motives are important for younger soldiers with only a high school education, and that this group usually serves as peace-enforcers during their gap year.     

Herdsmen militancy and humanitarian crisis in Nigeria: A theoretical briefing

This article explores the phenomenon of herdsmen militancy as a new trajectory for the farmer–herder crisis in Nigeria, with reference to its humanitarian implications. Relying on a systematic analysis of secondary data and aligning with the analytical anchorage of liberal political ecology theory, the article posits that herdsmen militancy depicts a contradiction in agrarian relations in the context of a national security crisis which has been complicated by salient socio-ecological factors such as climate change, armed violence, and identity politics. In view of the dire humanitarian consequences of this situation, the article submits that herdsmen militancy constitutes a major threat to human and national security in Nigeria. It makes a case for a pragmatic policy capable of mitigating the myriad socio-ecological factors that tend to trigger herdsmen militancy, with prohibition on open grazing in critical hotbeds of herder–farmer conflict as a strategic measure.     

New purification algorithms for linear programming

Two new algorithms are presented for solving linear programs which employ the opposite-sign property defined for a set of vectors in m space. The first algorithm begins with a strictly positive feasible solution and purifies it to a basic feasible solution having objective function value no less under maximization. If this solution is not optimal, then it is drawn back into the interior with the same objective function value, and a restart begins. The second algorithm can begin with any arbitrary feasible point. If necessary this point is purified to a basic feasible solution by dual-feasibility–seeking directions. Should dual feasibility be attained, then a duality value interval is available for estimating the unknown objective function value. If at this juncture the working basis is not primal feasible, then further purification steps are taken tending to increase the current objective function value, while simultaneously seeking another dual feasible solution. Both algorithms terminate with an optimal basic solution in a finite number of steps.