A. W. Kemp 《海军后勤学研究》1987,34(6):853-858

The article examines ways of computing cumulative probabilities for a constrained Poissonian binomial distribution arising from a model of a weapon defense system.  相似文献   

    

Paul A. Rubin  W. C. Benton 《海军后勤学研究》1993,40(2):255-278

In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc.  相似文献   

    

J. D. Esary  W. J. Hayne 《海军后勤学研究》1975,22(1):41-53

The calculation of the exact reliability of complex systems is a difficult and tedious task. Consequently simple approximating techniques have great practical value. The hazard transform of a system is an invertible transformation of its reliability function which is convenient and useful in both applied and theoretical reliability work. A simple calculus for finding an approximate hazard transform for systems formed by series and parallel combinations of components is extended so that it can be used for any coherent system. The extended calculus is shown to lead to conservative approximations. A first order version of the extended calculus is also discussed. This method of approximation is even more simple to use, but is not always conservative. Examples of its application indicate that it is capable of giving quite accurate results.  相似文献   

    

Charles R. Johnson  Edward P. Loane 《海军后勤学研究》1980,27(3):511-519

A model, for assessing the effectiveness of alternative force structures in an uncertain future conflict, is presented and exemplified. The methodology is appropriate to forces (e.g., the attack submarine force) where alternative unit types may be employed, albeit at differing effectiveness, in the same set of missions. Procurement trade-offs, and in particular the desirability of special purpose units in place of some (presumably more expensive) general purpose units, can be addressed by this model. Example calculations indicate an increase in the effectiveness of a force composed of general purpose units, relative to various mixed forces, with increase in the uncertainty regarding future conflicts.  相似文献   

    

Patrick R. Steele  Shane G. Henderson  David B. Shmoys 《海军后勤学研究》2018,65(3):187-202

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.  相似文献   

    

August R. Immel 《Journal of Military Ethics》2016,15(1):3-17

  相似文献   

    

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.  相似文献   

    

Abigail R. Hall  Christopher J. Coyne 《Defence and Peace Economics》2014,25(5):445-460

This paper provides a political economy analysis of the evolution of unmanned aerial vehicles (UAV), or ‘drones’ in the USA. Focus is placed on the interplay between the polity and private economic influences, and their impact on the trajectory of political, economic, and military outcomes. We identify the initial formation of the drone industry, trace how the initial relationships between the military and the private sector expanded over time, and discuss present relationships. Understanding the historical evolution of UAV technology, as well as the major players in the industry today, is important for ongoing policy debates regarding the use of drones both domestically and internationally.  相似文献   

    

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  相似文献   

    

José R. Correa  Maurice Queyranne 《海军后勤学研究》2012,59(5):384-395

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献