W.J. Hurley  Jack Brimberg  Brent Fisher 《Defence and Peace Economics》2014,25(4):401-413

In most western countries, there is a strong incentive for defence department budget-holders to expend all of the funds they are authorized to spend in a fiscal year. In this paper, we question whether this emphasis makes sense. We develop a model of a defence department’s operating expenditure assuming a fixed level of funding for a year and uncertain costs. The results of the model suggest that the incentive for departmental managers to expend all authorized funds is inefficient. We explore the implications of the model for the Department of National Defence (DND) in Canada in light of the recent criticism of DND lapsed funding by the Auditor-General of Canada.  相似文献   

    

T.W. Archibald  K.I.M. McKinnon  L.C. Thomas 《海军后勤学研究》2006,53(3):217-225

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

    

Brendan Simms  Bruce Hoffman  Daniel W. Fitz‐Simons  Robert H. Dorff  Jennifer Morrison Taw  Gabriel Marcella 《Small Wars & Insurgencies》2013,24(1):127-139

Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2.

Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1.

Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7.

Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5

Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The

Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9.

Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5.  相似文献   

    

W. J. Hurley 《Defence and Peace Economics》2013,24(6):463-465

  相似文献   

    

Hadi W. Purnomo  Jonathan F. Bard 《海军后勤学研究》2007,54(2):200-220

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   

    

P. M. Ghare  D. C. Montgomery  W. C. Turner 《海军后勤学研究》1971,18(1):37-45

This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided.  相似文献   

    

W. F. Lucas 《海军后勤学研究》1967,14(1):15-21

A unique polyhedral solution is given for most n-person games in partition function form when only partitions into coalitions with 1, n-1, and n players have large payoffs.  相似文献   

    

Clifford W. Marshall 《海军后勤学研究》1969,16(4):531-541

This paper presents a quantitative index of the level of risk assumed by a contractor in various contract type situations. The definition includes expression of real world uncertainty and contractor's utility for money. Examples are given for the major contract types and special applications are discussed.  相似文献   

    

W. L. Wilkinson 《海军后勤学研究》1973,20(3):505-516

This paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal are flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria.  相似文献   

    

Thomas W. Reiland  Morgan A. Hanson 《海军后勤学研究》1980,27(4):573-588

A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example.  相似文献