摘要:

AbstractUnder certain conditions, the re‐supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reductio

ISSN:0028-1441    

DOI:10.1002/nav.3800170302

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractThe problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc‐chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum‐cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is di

ISSN:0028-1441    

DOI:10.1002/nav.3800170303

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractIn this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above.

ISSN:0028-1441    

DOI:10.1002/nav.3800170304

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractAn inventory system is described in which demand information may be incorrectly transmitted from the field to the stocking point. The stocking point employs a forwarding policy which attempts to send out to the field a quantity which, in general, is some function of the observed demand. The optimal ordering rules for the general n‐period problem and the steady state case are derived. In addition orderings of the actual reorder points as functions of the errors are presented, as well as some useful economic interpretations and numerical illustration

ISSN:0028-1441    

DOI:10.1002/nav.3800170305

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractABSTRACT A large manufacturer of telephone directories purchases about 100,000 tons of paper annually from several paper mills on the basis of competitive bids. The awards are subject to several constraints. The principal company constraint is that the paper must be purchased from at least three different suppliers. The principal external constraints are: 1) one large paper mill requires that if contracted to sell the company more than 50,000 tons of paper, it must be enabled to schedule production over the entire year; 2) the price of some bidders is based on the condition that their award must exceed a stipulated figure.The paper shows that an optimal purchasing program corresponds to the solution of a model which, but for a few constraints, is a linear programming formulation with special structure. The complete model is solved by first transforming it into an almost transportation type problem and then applying several well‐known L.P. technique

ISSN:0028-1441    

DOI:10.1002/nav.3800170306

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractLet\documentclass{article}\pagestyle{empty}\begin{document}$$ x_i = y_{i0} - \sum\limits_{j \in R} {y_{ij} x_j, i = 0},...,m $$\end{document}be a basic solution to the linear programming problem\documentclass{article}\pagestyle{empty}\begin{document}$$ \max \,x_0 = \sum {{}_jc_j x_j } $$\end{document}subject to:\documentclass{article}\pagestyle{empty}\begin{document}$$ \sum {{}_ja_{ij} x_j } = b_i, i=1,...,m, $$\end{document}whereRis the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers andxuis not an integer in the basic solution, the linear constraint\documentclass{article}\pagestyle{empty}\begin{document}$$\sum\limits_{j \in R_u^* } {x_j \ge 1,} \,R_u^* = \{ j|j \in R\,{\rm\, and}\,\,y_{uj} \ne {\rm integer}\}$$\end{document}is implied. We prove that including these “cuts” in a specified way yields a finite dual simplex algorithm for the pure integer programming problem. The relation of these modified Dantzig cuts to Gomory cuts is discus

ISSN:0028-1441    

DOI:10.1002/nav.3800170307

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractThis paper presents a general solution for theM/M/rqueue with instantaneous jockeying andr>1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr−1) × (2r−1) matrices.The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying.To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solu

ISSN:0028-1441    

DOI:10.1002/nav.3800170308

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

摘要:

AbstractIn this paper the exact distribution of the product of two noncentral beta variates is derived using Mellin integral transform. The density function of the product is represented as a mixture of Beta distributions and the distribution function as a mixture of Incomplete Beta Functions.

ISSN:0028-1441    

DOI:10.1002/nav.3800170309

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800170310

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800170311

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1970

数据来源: WILEY