ISSN:0160-5682    

DOI:10.1057/jors.1974.101

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractAn account is given of the experiences of building a highly structured linear programming model for aiding buying and operating decisions in the food industry. The practical and computational considerations of a model encompassing many aspects of a company are considered. A description is given of the application of the Dantzig-Wolfe decomposition algorithm to the model. By taking account of the special structure of the model computational economies can be made in applying decomposition.

ISSN:0160-5682    

DOI:10.1057/jors.1974.102

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractThe purpose of this paper is to describe a simulation model for wilderness use patterns and to illustrate its behaviour with a small hypothetical trail and camp network. The program was written in GPSSV. The model defines schedules for each party using a given area, executes that schedule and records the interactions between parties as they progress along their schedules. Experimentation with the model indicates that it will provide a viable informational tool for the analysis of alternative management policies for low-density or wilderness recreational areas.

ISSN:0160-5682    

DOI:10.1057/jors.1974.103

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractThis paper describes a manual algorithm for determining optimal production schedules when there are linear costs associated with production and storage, demand is deterministic and there is no backlogging. The method is described for use in the one-product, one-line situation and extended for use in the multiproduct, one-line situation. Examples of the method, using work sheets, are given. A comparison is made with the formulation and solution of this problem using the transportation method of linear programming. The situation in which implementation took place is described, from which conclusions are drawn in relation to the use of this method in practice.

ISSN:0160-5682    

DOI:10.1057/jors.1974.104

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractThe problem of determining the optimal level of a firm's cash balance has been studied by many researchers. Their analyses differ with respect to the assumptions made about both the cost structure faced by the firm and the nature of the flow of funds to the firm. Because of the different methodologies employed by these authors, a proof of the form of the optimum policy only exists for some assumptions about costs and cash flow conditions. Under other conditions, authors have simply assumed the form of the policy and solved for the parameters of that policy. This paper uses a general dynamic programming formulation of the cash balance problem to derive the form of the optimal cash balance problem under different assumptions about transaction costs and the demand for funds. It consists of a review, synthesis, generalization, and in many cases gives a more rigorous derivation of results. Also the nature of the cash balance problem is expanded in the interest of realism, to allow for access to short-term sources of funds.

ISSN:0160-5682    

DOI:10.1057/jors.1974.105

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractWe propose a method of applying the Hespos and Strassmann "stochastic decision tree" framework, originally intended for investment decisions, to cash flow management. Sequences of uncertain events, such as a strike, affecting forecast cash flows are represented by a probability tree. Forecasts of constituent cash flows such as sales and costs are represented by Beta distributions dependent on paths through the tree. Monte Carlo simulations sample these distributions, and equations provided in the model convert the sampled cash flows to cash balances in each period. Frequencies of cash balances weighted by probabilities along paths through the tree yield a combined relative frequency distribution of cash balances for each period. These and related results may be used by management to plan financing arrangements to meet cash requirements in the future.

ISSN:0160-5682    

DOI:10.1057/jors.1974.106

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractThis paper presents an optimization procedure which would offer a much simpler and faster procedure than dynamic programming in reaching optimal solutions for a special class of resource allocation problems. The solution method is based upon an incremental analysis and does not require further computation beyond the conversion of a payoff table to a table of marginal payoffs by simple subtractions. The optimality of the incremental solution will be demonstrated by a heuristic proof with several examples; and a numerical problem to illustrate the use of incremental analysis as well as to compare it with the solution procedure of dynamic programming will also be given.

ISSN:0160-5682    

DOI:10.1057/jors.1974.107

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractMany decision situations can be described as multiple objective linear programmes. In this paper, the duality of such programmes is investigated, and the duality theorem is used to illustrate aspects of sensitivity analysis with multiple objectives. Both optimizing and satisficing situations are considered.

ISSN:0160-5682    

DOI:10.1057/jors.1974.108

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractThere are many computational models available now which purport to add to our ability to plan and control organizations in a decentralized fashion. Some of these are custom built for the purpose while others incorporate mathematical programming decomposition procedures. Although comparisons have been made concerning their computational requirements, little analysis seems to have been done to explore the organizational implications of the various methods. A start is made on this task here and some conclusions drawn in terms of the managerial style of-and the motives for-decentralization.

ISSN:0160-5682    

DOI:10.1057/jors.1974.109

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor

摘要:

AbstractApproximate formulae for the equilibrium queue-size and queueing-time distribution in the systemGI/M/rare derived. The degree of approximation achieved depends on the particular formula used and on the values of the various parameters involved; the relative percentage errors incurred seem, however, to be well below 5 per cent for most practical purposes. It is believed that the underlying idea of "similarity" in the behaviour of queueing processes may also lead, if extended, to useful approximate formulae for more complex systems.

ISSN:0160-5682    

DOI:10.1057/jors.1974.110

出版商:Taylor&Francis    

年代:1974

数据来源: Taylor