Determination of efficient points in multiple-objective location problems

This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm.     

A duality model for a generalized minmax program

We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved.     

Optimal control policies in service systems with limited information on the downstream stage

Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information.     

Northern Ireland and minimum force: the refutation of a concept?

The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces.     

Conflict and fiscal capacity

We examine the role of war in retarding state fiscal capacity in developing countries, measured by tax revenue ratios to GDP. We build a simple theoretical model of a factionalized state, where patronage substitutes for common interest public goods, along with violent contestation over a rent or prize. Our dynamic panel empirical analysis applied to 79 developing countries, during 1980–2010, indicates that war, especially civil war, retards fiscal capacity, along with imperfect democracy, political repression, poor governance, and dependence on oil and macroeconomic mismanagement. High intensity conflict is particularly destructive of state capacity. In countries experiencing low intensity wars, other institutional factors may matter more than war. The diminution of fiscal capacity due to war appears less pronounced after the end of the cold war.     

Rebellion and African Ethics

In this paper I draw on Thaddeus Metz’s pioneering work in African ethics, and particularly his account of the concept described by the terms ubuntu (Nguni languages), botho (Sotho-Tswana), hunhu (Shona) or utu (Swahili), to sketch an African normative understanding of the act of rebellion against the authority of the state. Most commonly articulated in the phrase “a person is a person through other persons”, ubuntu is interpreted by Metz as a unique communitarian moral principle which can be described in its essence as the claim that “actions are right, or confer ubuntu (humanness) on a person, insofar as they prize communal relationships, ones in which people identify with each other, or share a way of life, and exhibit solidarity toward one another, or care about each other’s quality of life”. On the face of it, this principle appears at odds with rebellions against state authority. Following Metz, I argue, however, that a deeper grasp of this principle does, in fact, provide a justification for instances of civilian rebellion against state authority, under appropriate circumstances.     

Scheduling customer arrivals to a stochastic service system

An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999     

Decomposition algorithms for the maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998     

Automated air load planning

We describe the development of a heuristic algorithm for determining efficient 2-dimensional packings in cargo aircraft where cargo placement constraints are critically important in determining the feasibility of packing locations. We review the performance of a new algorithm versus some traditional ones for aircraft loading. The algorithm is also tested in a more generalized setting where there exist no additional constraints on items, to suggest applicability in other environments. The new algorithm has been used worldwide in the Automated Air Load Planning System (AALPS) for cargo aircraft loading, with much success. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 751–768, 1998