Jülide Yildirim  Selami Sezgin 《Defence and Peace Economics》2013,24(2):81-83

  相似文献   

    

Selami Sezgin  Jülide Yildirim 《Defence and Peace Economics》2013,24(2):121-128

Although a number of studies concerning Turkish defence-growth relation have been published in recent years, little attention is given the demand for Turkish defence expenditure. This is an important issue for understanding which variables contribute to the determination of the demand for military expenditure. However, it is difficult to develop a general theory or a standard empirical approach for the determination of the demand military expenditure. This study models and estimates the demand for Turkish defence expenditure for the period 1951-1998 using autoregressive distributed lag approach to cointegration (ARDL) following the methodology outlined in Pesaran and Shin (1999). This procedure can be applied regardless of the stationary properties of the variables in the sample and allows for inferences on long-run estimates, which is not possible under alternative cointegration procedures. The findings suggest that Turkish defence spending is determined by NATO's defence spending, Greece's defence spending and some security considerations.  相似文献   

    

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

  相似文献   

    

Amit Eynan  Meir J. Rosenblatt 《海军后勤学研究》2007,54(6):615-622

Assemble in Advance (AIA) policy reduces assembly cost due to advance planning, while Assemble to Order (ATO) policy eliminates assembly of excessive (more than demanded) units. The tradeoffs between the two policies have been studied in the past for single product environments. Moreover, it was shown that it is beneficial to employ AIA and ATO simultaneously. In this article, we study the employment of such a composite assembly policy in a multiproduct environment with component commonality. When common components are used, ATO may also enable us to benefit from the risk pooling effect. We provide important managerial insights such as: the multiperiod problem is myopic and changes in inventory levels due to the use of common components, and demonstrate the potential profit increase compared to other policies.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   

    

Steven M. Shechter  Matthew D. Bailey  Andrew J. Schaefer 《海军后勤学研究》2008,55(7):700-703

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   

    

Richard J. Forrester  Warren P. Adams  Paul T. Hadavas 《海军后勤学研究》2010,57(1):1-12

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   

    

Claude Dennis Pegden  Clifford C. Petersen 《海军后勤学研究》1979,26(4):595-609

This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.  相似文献   

    

R. L. Bulfin  R. G. Parker  C. M. Shetty 《海军后勤学研究》1979,26(1):41-46

In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.  相似文献   

    

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

    

Oscar A. Z. Leneman  Frederick J. Beutler 《海军后勤学研究》1969,16(1):1-15

The intent of this paper is to demonstrate that the theory of stationary point processes is a useful tool for the analysis of stationary inventory systems. In conventional inventory theory, the equilibrium distributions for a specified inventory policy are obtained, whenever possible, by recursive or limiting procedures, or both. A different and more direct approach, based on stationary point processes, is proposed here. The time instants at which stock delivery is effected are viewed as points of the stationary point process, which possesses uniform statistical properties on the entire real axis; hence the equilibrium statistics of the inventory process can be calculated directly. In order to best illustrate this approach, various examples are given, including some that constitute new results.  相似文献