摘要:

AbstractThe authors extend the generalized von Neumann model they developed (with J. G. Kemeny) in 1956 to an open model by assuming that there are exogeneously determined export and import prices and that any amount can be exported or imported at these prices. The open model is then characterized by means of seven axioms. It is shown, by applying the theory of linear programming, that if four economically reasonable assumptions hold, the open model has at least one solution in which at least one good with positive export price is exported and at least one good with positive import price is imported. It is also shown that, in general, a continuum of expansion rates can be achieved by varying certain control variables. The choice of these expansion rates gives indirectly the choice of a suitable sub‐economy and also determines the exports and imports of the economy. Other results and examples are discusse

ISSN:0028-1441    

DOI:10.1002/nav.3800160401

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

年代:1969

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800160402

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

年代:1969

数据来源: WILEY

摘要:

AbstractThe principal innovation in this paper is the consideration of a new objective function for inventory models which we call the shortage probability criterion. Under this criterion we seek to minimize the total expected discounted cost of ordering subject to the probability that the stock level at the end of the period being less than some fixed quantity not exceed some prescribed number. For three different models we show that the minimum order policy is optimal. This result is then applied to a particular inventory model in which the demand distribution is not completely known. A Bayesian procedure is discussed for obtaining optimal policies.

ISSN:0028-1441    

DOI:10.1002/nav.3800160403

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

年代:1969

数据来源: WILEY

摘要:

AbstractThis paper considers the problem of maintaining an inventory of an item which can deteriorate and become useless. A periodic review procedure is used and new items ordered may experience a time lag in delivery. Items are considered to deteriorate through one or two states before becoming useless. Thus the deterioration process in each period plays the role of the usual demand process and is a function of the inventory level at the beginning of each period. For the case of no time lag in delivery, one stage deterioration, and either binomial or uniform deterioration, optimal ordering policies are obtained for the n‐period dynamic model with the standard cost structure. (For the shortage probability criterion see the other paper by Iglehart and Jaquette, in this issue.) These policies are of the single critical number type. For more complicated models suboptimal policies of this same type are foun

ISSN:0028-1441    

DOI:10.1002/nav.3800160404

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

年代:1969

数据来源: WILEY

摘要:

AbstractWe consider the problem of simultaneously locating any number of facilities in three‐dimensional Euclidean space. The criterion to be satisfied is that of minimizing the total cost of some activity between the facilities to be located and any number of fixed locations. Any amount of activity may be present between any pair of the facilities themselves. The total cost is assumed to be a linear function of the inter‐facility and facility‐to‐fixed locations distances. Since the total cost function for this problem is convex, a unique optimal solution exists. Certain discontinuities are shown to exist in the derivatives of the total cost function which previously has prevented the successful use of gradient computing methods for locating optimal solutions. This article demonstrates the use of a created function which possesses all the necessary properties for ensuring the convergence of first order gradient techniques and is itself uniformly convergent to the actual objective function. Use of the fitted function and the dual problem in the case of constrained problems enables solutions to be determined within any predetermined degree of accuracy.Some computation results are given for both constrained and unconstrained p

ISSN:0028-1441    

DOI:10.1002/nav.3800160405

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

年代:1969

数据来源: WILEY

摘要:

AbstractA dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each ofnsinks forTperiods which can be fulfilled by shipments frommsources. A requirement in periodt2can be satisfied by a shipment in the same period (a linear shipping cost is incurred)orby a shipment in periodt1

ISSN:0028-1441    

DOI:10.1002/nav.3800160406

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

年代:1969

数据来源: WILEY

摘要:

AbstractThe purpose of this article is to formulate the multi‐commodity maximal flow problem into a node‐arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford&Fulkerson [3] using the arc‐chain formulation. A generalization to the problem is then considered which can potentially speed its conver

ISSN:0028-1441    

DOI:10.1002/nav.3800160407

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

年代:1969

数据来源: WILEY

摘要:

AbstractThis 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.

ISSN:0028-1441    

DOI:10.1002/nav.3800160408

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

年代:1969

数据来源: WILEY

摘要:

AbstractIn this paper applications of results obtained by these authors for a generalized version of a problem proposed by Smirnov, are considered. The areas of application explored are system interface, queueing, transportation flow, and sequential analysis. The included table should be invaluable to the reader in applying these results. Finally the relationship between the limiting and exact expressions relating to this table is also explored.

ISSN:0028-1441    

DOI:10.1002/nav.3800160409

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

年代:1969

数据来源: WILEY

摘要:

AbstractA single machine scheduling problem in which both the processing times and due‐dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due‐date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this cont

ISSN:0028-1441    

DOI:10.1002/nav.3800160410

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

年代:1969

数据来源: WILEY