Country survey VI: Australia

Australia is a geographically large country, with the world's longest national coastline to defend, but a relatively small economy of some 17.5 million people. Since World War II, Australia has faced the dilemma of how to structure defence policy in the absence of an identifiable threat. Its policy of self‐reliance aims to permit Australia to conduct defensive operations in the event of low/medium level threats without depending immediately on its allies. This is to be achieved through the technological sophistication of defence equipment, a highly professional but small defence force and local industry support.

The burden of defence, measured as the share of defence outlay in GDP declined from about 3% in 1971–72 to about 2.3% in 1993–94. It has been the Government's policy to encourage the development of local defence‐related industry, in particular in areas such as: electronics/optics; communications and information technology; aerospace; shipbuilding and repair, munitions; and land vehicles. However, defence procurement has a small impact on the Australian economy as a whole.     

Country survey XVIII: The two Koreas' defence economy

In this paper we change the structure of the basic conflict model. This makes it possible to found an economic theory of war and peace. Apart from few exceptions there exist no peace equilibria in the related literature of conflict theory. The aim of the paper is to fill this gap, because most parts of the world live in peace. Further we show that negotiations are possible to avoid a war. The main result is that war breaks out only if the distribution of resources and/or the effectiveness of weapons is sufficiently unequal.     

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.     

Conjectures for framing cyberwarfare

Cyberspace has emerged as a potentially new (and unconventional) domain for warfare. Much debate has focused on understanding cyber conflict. The ability to critically analyse this phenomenon is important; however, the nascent nature of cyberwarfare and the complexity of the systems involved create challenges not met by conventional approaches. As a first step, this requires an analytical construct to frame discussions in a way that highlights distinct characteristics of the cyber domain. An approach proposed is one of the postulating conjectures for debate as a way to achieve this and to demonstrate its use, both at the strategic and operational levels. It is suggested that such an approach provides one component of a mature analytical framework for the analysis of cyber across a range of warfare domains.     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Cultural Conflict within Civil-Military Cooperation: A Case Study in Bosnia

In peace-support operations, employees of international humanitarian organisations often clash with those of the military. A lack of familiarity with each other's practices and values, embedded in their respective organisational cultures, is often seen as the culprit. This article presents and illustrates a road map to manage such cultural differences between cooperating organisations. We found that the military culture, in our Bosnian case study, was seen to operate as a hierarchical culture (characterised by formalisation, stability, predictability and efficiency). The culture of international humanitarian organisations, on the other hand, was depicted as clan-type (characterised by teamwork, participation and consensus). To facilitate the creation of cultural awareness as well as respect for, and reconciliation of, cultural differences we recommend several concrete actions that could improve civil-military cooperation.     

On some stochastic inequalities involving minimum of random variables

Let X_i be independent IFR random variables and let Y_i be independent exponential random variables such that E[X_i]=E[Y_i] for all i=1, 2, ? n. Then it is well known that E[min (X_i)] ≥E[min (X_i)]. Nevertheless, for 1≤i≤n exponentially distributed X_i's and for a decreasing convex function ?(.). it is shown that .     

The many-product cargo loading problem

An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided.