French Arms Exports and Intrastate Conflicts: An Empirical Investigation

The aim of this article is to evaluate how French Major Conventional Weapons (MCW) exports impact on the conflict intensity of recipient countries. The recent increase in French arms exports seems to contradict the French political discourse on the promotion of regional stability. We run zero-inflated ordered probit model in order to analyze the role of the arms trade on the intensity of civil conflicts in 144 countries from 1992 to 2014, using SIPRI and UCDP/PRIO data. Our results suggest that French MCW exports tended not to exacerbate intrastate conflicts during this period. This finding is robust to changes in the empirical framework. We propose two lines of explanations: France seems to be prone to choosing partners that respect human rights and selling more ‘defense-oriented’ MCW than the rest of the world.     

Joining by Number: Military Intervention in Civil Wars

Understanding why and when states militarily intervene in civil wars is crucial. Intervention can increase civil wars’ severity and the strategies employed in civil wars are shaped by the possibility of military intervention. This article argues that potential military interveners react to information revealed about warring parties’ intentions and relative power. Without revealed information, potential military interveners are unlikely to reconsider their initial decision to remain out of the war. Revealed information causes non-belligerent states to update their expectations about the trajectory of the civil war causing them, at times, to change their calculus about the benefits of belligerency and thus intervene. This helps explain why civil wars spread and when they do so. This explanation is tested using generalised estimating equations on a new data-set of unexpected events for the civil wars in the Correlates of War Intrastate War and PRIO Armed Conflict data-sets.     

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time‐sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel‐ and payload‐capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land‐ or water‐based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic pricing and inventory control with learning

Optimal operating policies and corresponding managerial insight are developed for the decision problem of coordinating supply and demand when (i) both supply and demand can be influenced by the decision maker and (ii) learning is pursued. In particular, we determine optimal stocking and pricing policies over time when a given market parameter of the demand process, though fixed, initially is unknown. Because of the initially unknown market parameter, the decision maker begins the problem horizon with a subjective probability distribution associated with demand. Learning occurs as the firm monitors the market's response to its decisions and then updates its characterization of the demand function. Of primary interest is the effect of censored data since a firm's observations often are restricted to sales. We find that the first‐period optimal selling price increases with the length of the problem horizon. However, for a given problem horizon, prices can rise or fall over time, depending on how the scale parameter influences demand. Further results include the characterization of the optimal stocking quantity decision and a computationally viable algorithm. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 303–325, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10013     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

Accreditation Fraud in Brazilian Military Hospitals: Why “Tone at the Top” Matters

This article shows under which circumstances fraudulent accreditation can occur in Brazilian military hospitals, calling attention to the tone at the top as a critical aspect of military fraud deterrence – and hence as a critical aspect of this branch of military ethics. The problems allegedly found in Brazilian military health institutions were revealed through in-depth interviews conducted with 29 professionals who reported to work or have worked in a Brazilian military hospital. These fraud allegations were mostly associated with false documentation and procedures designed to give the appearance that legal requirements for accreditation were met and could be traced back to a weak or corrupt “tone at the top” coming from military higher ranks.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Are police deaths a consequence of flaws in the South African Police Service administration? A SWOT analysis

This article argues that since the advent of democracy, the South African Police Service (SAPS) has been plagued by poor administration. Having inherited a repressive police force, the post-apartheid national police commissioners (NPCs) have found it difficult to transform the organisation. Among the unintended consequences has been a rise in police deaths. Although police deaths can be attributed to numerous factors, this article focuses on fault lines in the SAPS administration through a strengths, weaknesses, opportunities and threats (SWOT) analysis drawing largely on existing scholarly debates. Essential theoretical perspectives have been employed to gain insight into the root causes of the problem. The article concludes that poor administration and a lack of trust, partnership and collaboration between police officers and community members have perpetuated the killing of police officers. These killings are further compounded by the flawed and ill-conceived selection and appointment of NPCs. As a consequence, the article recommends that the appointment of NPCs should be promptly reviewed. It further recommends that each potential candidate should have risen through the ranks and must fully comprehend the challenges facing the organisation.