bluuebunny/crossref_metadata_2025 huggingface dataset:
Some Problems of Digital Systems Simulation
Authors: Conway R. W. , Johnson B. M. , Maxwell W. L.
Published: November 2008

Our objective is to discuss the technique of digital system simulation. This procedure has already achieved a considerable stature in industrial and research organizations and promises to attain even greater importance in the future. Yet, with few exceptions (5)1, the published literature in the area consists of introductory expositions (10) or of descriptions of the solution of a particular problem (7) where the technique itself is correctly relegated to secondary position. The only publication devoted entirely to the topic (12) is a compendium of papers of the latter type with little attempt to summarize or generalize. Simulations are, of course, as varied as the systems which they represent but they do have certain common characteristics and problems. An identification of these problems would at least allow the investigator to anticipate them and plan accordingly.

This paper consists of three sections. The first is an attempt to describe characteristics common to many system simulations; the second is a discussion of some problems involved in the construction of a digital simulator; and the third concerns problems that arise in the use of such a simulator.
The Weapon Systems Management Concept and Electronic Data Processing
Authors: Rosenzweig Jim
Published: November 2008

This paper is concerned with the lack of significant progress in the application of electronic computers for expanding the scope of systems of information flow. The weapon systems management concept, and more particularly its civilian counterpart the product mission concept, is presented as a possible frame of reference for top management and systems analysts to use in long-range planning. The functions necessary for successful product mission accomplishment are outlined and the role of systems analysts in the performance of these functions is emphasized. The feasibility of long-range planning for systems of information flow without reference to existing applications or hardware is also discussed.
On the Shortest Route Through a Network
Authors: Dantzig George B.
Published: November 2008

The chief feature of the method is that it fans out from the origin working out the shortest path to one new node from the origin and never having to backtrack. No more than n(n − 1)/2 comparisons are needed to find the shortest route from a given origin to all other nodes and possibly less between two fixed nodes.

Except for details and bias of various authors towards a particular brand of proof, this problem has been solved the same way by many authors. This paper refines these proposals to give what is believed to be the shortest procedure for finding the shortest route when it is little effort to arrange distances in increasing order by nodes or to skip consideration of arcs into nodes whose shortest route to the origin has been determined earlier in the computation.

In practice the number of comparisons is much less than indicated bounds because all arcs leading to nodes previously evaluated are deleted from further consideration. A further efficiency can be achieved in the event of ties by including least distances from origin to many nodes simultaneously during the fanning out process. However, these are shown as separate steps to illustrate the underlying principle.
A Machine-Job Scheduling Model
Authors: Dantzig George B.
Published: November 2008

This paper makes use of a device proposed by Fulkerson and Ford for maximal multi-commodity network flows (Ford, L. R. Jr., D. R. Fulkerson. 1958. A suggested computation for maximal multi-commodity network flows. The RAND Corporation, Paper P-1114, March 27, 1958. Also Management Sci. 5(1) 97–101.). A machine-job scheduling model is formulated that avoids the usual in-process inventories and thereby has fewer equations. The activities are the possible sequence for each job of machine steps and interspersed delays; this, of course, greatly multiplies the number of activities. However, a compact network representation of the set of possible activities is developed which permits generating just the activity to enter the basis on each iteration without explicitly generating the others. This is done by using one of the efficient procedures that now exist for computing the shortest route through a network (Dantzig, George B. 1960. On the shortest route through a network. Management Sci. 6(2); Moore, E. F. The shortest path through a maze. Unpublished mimeographed report, 16 pages; Bellman, Richard. 1958. On a routing problem. JORSA, XVI(1) 87–90.), (Ford, L. R. Jr. 1956. Network flow theory. The RAND Corporation, Paper P-923).
Problems in the Application of Replacement Theory
Authors: Mayer Raymond R.
Published: November 2008

A great deal of time and effort has been devoted to the development of quantitative methods for the solution of business management problems. Unfortunately, a tremendous difference exists between the rate at which these methods are being generated and the rate at which they are being applied. This suggests that there exist problems of application which industry is not able to overcome. The purpose of this paper is to present and analyze the difficulties encountered in a single, but representative, area of decision-making, namely, equipment replacement. It is hoped a presentation and analysis of these difficulties will have some effect on the nature of future research activities.
Sur l'Utilisation des Integrales de Contour dans les Problemes de Stocks et de Delais d'Attente
Authors: Ventura E.
Published: November 2008

The goal of the article is to show how sometimes the use of contour integrals can help in solving problems of inventory and queueing theories by enabling the target function to be uniquely represented in the analytical form min(0, X). The use of those integrals allows us to rewrite some well-known formulas from queueing theory in a larger setting that enables generalizations. That is our goal in the first part of the paper.

In the second part, this idea is applied to a particular problem to determine the inventory that is changing ten months in a year by regular reduction for use in production and by supplies arriving by ships, randomly distributed following the Poisson distribution. Penalties imposed are proportional to the waiting time for a ship to arrive. The mathematical problem that enables to determine the optimum between the costs of waiting for a ship to arrive and the costs of maintaining the inventory is expressed as the residue of a contour integral. An asymptotic formula useful for numerical calculation is derived.
Games Decisions and Industrial Organization
Authors: Shubik M.
Published: November 2008

A survey of the current relationship between the many different problem areas investigated by means of Game Theory and the study of Industrial Organization is presented. Several examples are provided to illustrate the nature and relevance of work on (1) two-person constant-sum games; (2) the extensive form of a game; (3) theories of solution for n-person games; (4) theories of solutions for games against nature; and (5) theories of solution for dynamic games. The nature and state of the current applications of game theory to organizational problems and to parts of the behavorial sciences are summarized.
Correction
Authors: Dantzig George B.
Published: November 2008

Author's correction of Dantzig, G. B. 1960. On the shortest route through a network. Management Sci. 6 (2) 187–190.
Quadratic Programming as an Extension of Classical Quadratic Maximization
Authors: Theil H. , Van De Panne C.
Published: November 2008

The article describes a procedure to maximize a strictly concave quadratic function subject to linear constraints in the form of inequalities. First the unconstrained maximum is considered; when certain constraints are violated, maximization takes place subject to each of these in equational (rather than inequality) form. The constraints which are then violated are added in a similar way to the constraints already imposed. It is shown that under certain general conditions this procedure leads to the required optimum in a finite number of steps. The procedure is illustrated by an example while also a directory of computations is given.
A Non-Linear Extension of the Simplex Method
Authors: Wegner Peter
Published: November 2008

This paper describes an algorithm for the solution of mathematical programming problems having a linear objective function and non-linear constraints. The algorithm is basically an adaptation of the simplex method to the case of non-linear constraints. Certain complications are, however, introduced through non-linearity in the constraints, and it is shown how these can be overcome.
On the Interaction of Purchasing Motives and the Optimal Programming of Their Activation—A New Approach to the Evaluation of Advertising Themes
Authors: Emanuel H. , Klaassen L. H. , Theil H.
Published: November 2008

In recent years considerable attention has been paid by marketing theorists to the role of advertising and other promotional activities within the marketing policy of the firm and to their optimal setting in the combined operation of the various instruments available to such a policy. These authors have generally assumed efficient spending of money on advertising as far as choice of media and of purchase motivating themes are concerned. It is the object of the present paper to consider in some detail the second of these two problems—the efficient selection of purchase motivating themes for activation through advertising.
A Note on Accelerated Dollar Averaging
Authors: Wilson George W.
Published: November 2008

The policy of accelerated dollar averaging as discussed by William T. Morris is an excellent contribution (Morris, W. T. 1959. Some analysis of purchasing policy. Management Sci. 5 (4, July).) is essentially correct. The analysis, however, merits extension beyond the rather abbreviated treatment given in the article cited.

Dollar averaging is a type of procurement policy whereby a given amount of money is spent at each purchasing opportunity. The amount actually bought at each period is then a function of the price prevailing at that time.
Remarks on Anatol Rapoport's Paper
Authors: Wood Marshall K.
Published: November 2008

Professor Rapoport's article in this issue (Rapoport, A. 1961. Three modes of conflict. Management Sci. 7 (3) 210–218.), and his recent book on the same subject, “Fights, Games and Debates,” provide mush valuable insight into the problems of conflict resolution. I am in agreement with this principles for the resolution of conflicts among individuals, whenever his basic assumptions are applicable.

The application of these principles is difficult even in individual debate under favorable circumstances, as is evidenced by the wide discrepancy between Professor Rapoport's precepts and his practice as displayed in his comments on my paper in this issue. These principles are incomparably more difficult to apply in disputes between nations, in which the protagonists are not free agents, but must each answer to a constituency some part of which, at least will criticize his every move. Further, I question the applicability of Professor Rapoport's basic assumptions in the case of the present East-West conflict.

Professor Rapoport assumes implicitly that both parties to a conflict wish to resolve it; and he assumes explicitly that both parties have a similar psyche. I do not believe that either of these assumptions is valid as applied to the current conflict between the U.S. and the Soviet Union.
Optimal Inventory Depletion Policies
Authors: Bomberger Earl E.
Published: November 2008

Consider a stockpile of items whose field life is a non-negative function of the age of the item upon being issued. Assume that only one item is in use at a time and that a demand occurs only when the item in use is completely exhausted.

Six theorems are given which extend the class of field life functions such that either LIFO or FIFO are optimal issue policies.
FIFO and LIFO Policies in Inventory Management
Authors: Eilon Samuel
Published: November 2008

Evaluation of FIFO (=first in first out) versus LIFO (=last in first out) policies in stock depletion problems has hitherto been based on the classification of field life functions as convex and concave, the optimal policy for n > 2 units being determined when the optimal policy for n = 2 units is known. This paper suggests a test for selecting the optimal policy for the n = 2 system, for field life functions with a derivative equal or larger than −1, and by induction the conclusions are extended to n > 2. When the derivative is smaller than −1, LIFO is shown to be an optimal policy.
Mathematical Methods in Economics
Authors: Dadayan V. , Chernyak Yu.
Published: November 2008

During April, 1960, a meeting was held at the USSR Academy of Science, to discuss the use of mathematical methods in economic research and planning. Fifty six reports were circulated beforehand, in the following categories: Mathematical Analysis of Expansion of Productivity. Interdepartmental Balances. Linear Programming and Dynamic Programming. Transportation Models. Other Models. Mathematical Statistics. In addition, a discussion of the use of electronic computers was given, with estimates of cost savings.

The conclusion of the conference was that despite some opposition, the use of these methods was to be encouraged. There would be unified guidance of the field in an Interdepartmental Scientific Council. Education in the field should be encouraged. Publications would be made.
Aggregation of Utility Functions
Authors: Eisenberg E.
Published: November 2008

We are primarily concerned here with the question of integrability of the total demand in a model in which each consumer acts according to a cardinal utility function and has a fixed monetary income. It is well known that concavity of the various utilities is not sufficient to guarantee integrability, nor even to ensure rationality of the revealed preference. We show that if each personal utility function is homogeneous, in addition to satisfying the usual regularity conditions, then an aggregate utility function can be defined explicitly in terms of the given utilities. Furthermore, under the same assumptions we give a new characterization of equilibrium and show that equilibrium satisfactions are unique.
Computer Management Control Systems Through the Looking Glass
Authors: Weinwurm George F.
Published: November 2008

A discussion of three aspects of the introduction of real time computer executive control systems into the world of business, using as a frame of reference the experience acquired through the design and operation of a similar military system, SAGE, over the past several years. In particular, consideration is given to the relative effectiveness with which the system communicates with its environment, the necessary compromises in the definition of the rules by which the system will function, and certain difficulties in the concept of executive control systems which are in some sense adaptive.
Management Science and Research in Great Britain
Authors: Wilkins Leslie T.
Published: November 2008

This paper is divided into three parts. In the first part, the present stage of development of management science in the United Kingdom is briefly discussed; in the second part are given a few “case histories,” stressing the methodology; the third part discusses a few recent features of management science in the United Kingdom which seem to be interesting.
An Inventory Model for Arbitrary Interval and Quantity Distributions of Demand
Authors: Beckmann Martin
Published: November 2008

The inventory problem for continuous time is studied under the following assumptions about the demand process (1) an arbitrary distribution of the length of intervals between successive demands; (2) a distribution of the quantity demanded which is independent of the last quantity demanded and any previous events but may depend on the time elapsed since the last demand; (3) unfilled orders are backlogged. The delivery time is fixed. Costs considered are fixed ordering costs and proportional costs of purchase, storage and shortage. The loss function and the equations for reordering point and minimal ordering quantity are derived. Formulae are calculated for the Poisson, stuttering Poisson, geometric, negative binomial, Gamma and compounded distributions.
Notes on Quadratic Programming: The Kuhn-Tucker and Theil-Van De Panne Conditions, Degeneracy, and Equality Constraints
Authors: Boot J. C. G.
Published: November 2008

The purpose of this note is to prove that the rules on which Theil and van de Panne [Theil, H., C. van de Panne. 1960. Quadratic programming as an extension of conventional quadratic maximization. Management Sci. 7(1) 1–20] based their recent method to follow straightforward from the well-known Kuhn-Tucker conditions and to propose a method for handling degeneracy in quadratic programming.
Concepts in Operational Support Research
Authors: Bovaird R. L. , Goldman A. S. , Slattery T. B.
Published: November 2008

Based upon actual studies on current complex military systems, an attempt is made to gather into a cohesive form those concepts characterizing the operational support field (defined as the process having the objective of keeping system availability at acceptable levels). The concepts have evolved from integrated studies on reliability, maintainability and logistics problems and have proven to be productive in the solution of varied types of support problems.

The elements making up the conceptual framework of operational support are defined and discussed. The interrelationships among such characteristics as reliability, maintainability and supply are considered insofar as they must be taken into account by design personnel relative to the mission of the equipment or weapon system.

The aims and context of the field of operational support are discussed from the point of view of the ex ante (before the fact) designer and ex post (after the fact) operating personnel. By defining the subject area of operational support in terms of two major areas, reliability and maintainability, all other characteristics of a support system and all related functions may be classified under these two major groupings.

The concepts developed lead to a description in the form of a pulse train model which provides the analysis of the operation of the piece of equipment or weapon system. Distributions of system availability are derived from distributions of time to failure and time to return to service of the units making up the equipment or system.

Although systems management is not specifically discussed, the concepts structured not only give quantitative meaning to the engineering aspects of systems development but also extend to systems management. The concepts thereby become basic to management organization and to control and communication from the data processing point of view.
Stochastic Scheduling by the Horizon Method
Authors: Symonds G. H.
Published: November 2008

The stochastic scheduling problem discussed in this paper is similar to the classical inventory model. It is concerned with the demand for a single commodity expressed as a set of independent stochastic variables with known distributions and an objective functional composed of production and inventory cost variables. The model, however, incorporates a uniquely determined planning horizon, and in the usual application requires only a finite number of time periods. The horizon period is based upon the minimum expected loss in the operation and therefore is subject to the stochastic variables of demand.
An Algorithm for the Construction and Evaluation of Feasible Schedules
Authors: Heller Jack , Logemann George
Published: November 2008

An algorithm for the generation of feasible schedules and the computation of the completion times of the job operations of feasible schedule is presented. Using this algorithm, the distribution of schedule times over the set of feasible schedule—or a subset of feasible schedules—was determined for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal. Biasing techniques corresponding to “first come first serve,” random choice of jobs ready at each machine and combinations of these two extremes were used to compute distributions of schedule times.

In all the experiments “first come first serve” appears the best in the sense that convergence to the minimum is fastest and the smallest.

The work presented in this paper is supported by the AEC Computing and Applied Mathematics Center, Institute of Mathematical Sciences, New York University, under Contract AT(30-l)-1480 with the U.S. Atomic Energy Commission.
A Short Note on SANS
Authors: Koenigsberg Ernest
Published: November 2008

In the SANS [O'Brien, G. G., H. S. Sherwood, R. E. Trueman. 1960. SANS, a simplified account numbering system. New York University J. Retailing (April); Trueman, R. E. 1961. Development of an efficient account-numbering method. Management Sci. 7 265.] system, which attempts to reduce alphabetical and numerical files to a single file, problems of overflow occur when new members fall between two existing members with consecutive numbers. A method is given for determining the probability distributions of overflows in a cell of size 2k, and the mean value and variance of these distributions as functions of the growth of the system. In this paper we use some of the results of another paper on a related problem [Jewell, W. S. 1962. A filing problem. Management Sci. 8 210.] to formulate the problem and obtain a solution. The mathematical treatment outlined can be extended to the calculation of other important parameters, including the expected number of entries which will be out-of-order within a group of areas, and the probability that the last overflow area will itself have an overflow.
A Filing Problem
Authors: Jewell William S.
Published: November 2008

n samples are drawn from a known distribution, ordered and placed in groups inside file drawers with a previously decided number of samples going in each drawer; the initial (ordered) sample in a drawer defines the “beginning” of a drawer, and the initial (ordered) sample of the next drawer defines the “end” of the drawer under consideration. If N new samples are drawn from the same distribution, what is the probability that x of them fall “inside” a given filing drawer? Is it shown that this probability depends only on the number of original samples “inside” a drawer, and is independent of the original sampling distributions and of the original sample which defines the beginning of the drawer. Hence, if the design objective is to equalize the overflow probability of each drawer, the best a priori policy is to divide the original ordered samples equally among the file drawers.
Appraisal of Laboratory Simulation Experiences
Authors: Geisler Murray A.
Published: November 2008

This paper was prepared for presentation as the Presidential Address at the 8th Annual International Meeting of The Institute of Management Sciences, Brussels, Belgium, August 24, 1961.
On the Evaluation of Kantorovich's Work of 1939
Authors: Koopmans Tjalling C.
Published: November 2008

These brief comments on the preceding article by Charnes and Cooper are limited to those of their remarks that bear on the evaluation of Kantorovich's long paper of 1939 reprinted in the July 1960 issue of Management Science.
A Problem in Equipment Maintenance
Authors: Weiss George H.
Published: November 2008

There have been several publications dealing with the theory of semi-Markov processes, [1–6]. Most of these have been purely theoretical analyses, although it is realized that the theory has many potential applications, [4, 6], particularly to so-called “repairman” problems and to problems in reliability. Other work along these lines has recently appeared in the literature, [8–11]. These papers are concerned with the reliability of multi-state mechanisms [8], with surveillance plans, [9, 10] and with inventory problems. In particular, the work of Barlow and Proschan considers a model almost identical to our own, using renewal theory methods. Since the semi-Markov process can be considered to be a generalization of renewal theory, it is not surprising that such applications are the first to suggest themselves. It is the purpose of this paper to present an application of the theory of semi-Markov processes to a problem in maintenance theory and obtain results which we believe to be new. The body of this paper will consist of material relevant to the actual problem; a development of the theory as needed in our presentation will be found in the Appendix.
Estimation of the Allowance for Doubtful Accounts by Markov Chains
Authors: Cyert R. M. , Davidson H. J. , Thompson G. L.
Published: November 2008

Investigation of more accurate and efficient methods of estimating the allowance for doubtful accounts was begun in the early 1950's by R. M. Cyert and R. M. Trueblood [Cyert, R. M., R. M. Trueblood. 1957. Statistical sampling techniques in the aging of accounts receivable in a department store. Management Sci. 3 (2, January) 185–195.]. At this time, studies were confined primarily to investigation of more efficient methods of performing the first step in the estimation procedure: determining the age distribution of accounts. In particular, the applicability of statistical sampling techniques was evaluated. A number of retail establishments now use scientific sampling methods to perform the first step in the estimation of the allowance for doubtful accounts.

As a continuation of research, the second phase of the allowance estimation problem was a logical area for investigation. While it did not seem likely that all of the judgment factors involved in the setting of loss expectancy rates could be eliminated, it did appear feasible to develop a scientific approach to determining these rates. Accordingly, research into this problem was initiated. This paper discusses a method which has been developed. In addition, some of the managerial implications of the method are discussed.
Judgment and Decision-Making Activities of Government Executives as Described by Superiors and Co-Workers
Authors: Forehand Garlie A. , Guetzkow Harold
Published: November 2008

Concepts which may be useful in research on executive performance stem from a variety of sources and are expressed in a variety of vocabularies. Administrators themselves have developed a complex jargon which is likely to be as mystifying to the social scientists as is the latter's to them. Administrative theorists often formulate variables in the language of psychology [10] in order to pose problems and suggest hypotheses for study. The translation of ideas from practitioner's lore or administrative theory into behavioral terms amenable to measurement, however, raises a host of conceptual and methodological questions.

Some of these questions are confronted in the present study. It is one of a series of papers intended to develop a general theory of “executive judgment” and to permit study of its susceptibility to educational modification. An a priori analysis of the concept of executive judgment which provides the rationale of these studies is presented elsewhere [Guetzkow, H., G. A. Forehand. 1961. A research strategy for partial knowledge useful in the selection of executives. R. Tagiuri, ed. Research Needs in Executive Selection. Harvard Business School, Boston.].
Education—Rich Problems and Poor Markets
Authors: Platt William J.
Published: November 2008

Decision-makers and policy-makers in education face some options to which systems analysts and economists might make contributions. Some of these options are identified within three clusters: how much to invest in education, how to allocate that investment, and what technology and organization to use. Tuition and fees, scholarships, admissions and retention requirements, and counseling policies are viewed as policy settings that can more explicitly encourage educational flows appropriate to development objectives. Education is shown to be a dispersed and difficult “market” for research services.
On Trivial and Binding Constraints in Programming Problems
Authors: Boot J. C. G.
Published: November 2008

The present paper is concerned with the constraints which enter in programming problems in the form of linear inequalities. The solution of a programming problem consists of finding that point out of the points satisfying all constraints which maximizes some given objective function. Constraints may be trivial in the sense that, should we delete them, the set of points satisfying all (remaining) constraints does not increase. This notion is discussed in detail in Sections 1–5. Section 6, using the concept of a trivial constraint, proves concisely the main theorems of linear programming, known as the duality theorem and the existence theorem. Part 2 discusses binding constraints, i.e., constraints which are satisfied in equational form in the solution. The approach is based on the work of Theil-Van de Panne [Theil, H., C. van de Panne. 1960. Quadratic programming as an extension of conventional quadratic maximization. Management Sci. 7 (1) 1–20], which amounts to finding the set S of constraints such that, maximizing the objective function with all constraints belonging to S taken as strict equalities, the solution point is obtained. Rules are given in the work of Theil-Van de Panne to generate this set. One conclusion is that the set thus generated need not be unique in cases of “pathological” degeneracy. Another that trivial constraints may be binding! Numerical examples and figures illustrate the various anomalies.
A Method of Solution for Quadratic Programs
Authors: Lemke C. E.
Published: November 2008

This paper describes a method of minimizing a strictly convex quadratic functional of several variables constrained by a system of linear inequalities. The method takes advantage of strict convexity by first computing the absolute minimum of the functional. In the event that the values of the variables yielding the absolute minimum do not satisfy the constraints, an equivalent and simplified quadratic problem in the “Lagrange multipliers” is derived. An efficient algorithm is devised for the transformed problem, which leads to the solution in a finite number of applications. A numerical example illustrates the method.
Systems Evaluation and Repricing Theorems
Authors: Charnes A. , Cooper W. W.
Published: November 2008

When a system is described in terms of a linear programming problem max cTx with Ax ≦ b, x ≧ 0, study of its properties, e.g., sensitivity analyses, etc., focuses on effects of alterations in the triple (A, b, c) on the properties of the system. These effects are non-linear and generally lead one away from a model with convenient special structure to much more complex systems. In this paper, methods (“repricing-reprocessing” theorems) are developed which (under certain assumptions about real world behavior) permit one to assess these effects exactly by means of a model of the same structure which can be prescribed in advance. The proofs of these theorems are accomplished by the “chained construction” methods of Charnes and Cooper. Approximation techniques and exact characterization of the non-linearities are also presented.
Non-Linear Programming—A Survey
Authors: Dorn W. S.
Published: November 2008

Some of the more recent theoretical and computational developments in non-linear programming are surveyed. The notions of Lagrange multipliers and duality are discussed together with applications of these ideas to scientific and business problems. Moreover, several algorithms for solving quadratic programming problems are reviewed. Explicit rules are given for two of these algorithms, and a simple example is solved by both methods. A large step gradient method for the solution of convex programs is given and one of Gomory's algorithms for integer programming is described. Simple examples are solved using both of these techniques. Linear fractional programming is also discussed briefly.
Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
Authors: Charnes A. , Cooper W. W. , Kortanek K.
Published: November 2008

By constructing a new infinite dimensional space for which the extreme point—linear independence and opposite sign theorems of Charnes and Cooper continue to hold, and, building on a little-known work of Haar (herein presented), an extended dual theorem comparable in precision and exhaustiveness to the finite space theorem is developed. Building further on this a dual theorem is developed for arbitrary convex programs with convex constraints which subsumes in principle all characterizations of optimality or duality in convex programming. No differentiability or constraint qualifications are involved, and the theorem lends itself to new computational procedures.
Simulation Tests of Lot Size Programming
Authors: Dzielinski B. P. , Baker C. T. , Manne A. S.
Published: November 2008

This paper presents the results of some digital computer simulation tests of a procedure for the economic planning of lot sizes, work force, and inventories. A dynamic, deterministic, linear programming model was used to obtain approximate solutions to the actual problem which is both dynamic and stochastic. The tests were made with data taken from an actual factory. An alternate procedure, based upon single-item inventory control, was also tested; its results were compared with those obtained from the linear programming model. On the basis of these tests, this linear programming method appears to offer a promising method for the practical economic planning of production activities.
On the Determination of Occupational Categories in an Organization
Authors: Stoller David S.
Published: November 2008

Typically, a personnel assignment model is based on the assumption that ni persons of skill type i; i = 1, …, k, are to be assigned over mj jobs requiring skill j; j = 1, …, s, with a penalty score, dij, for assigning a person of skill type i to a job requiring j. Then algorithms are sought for an assignment matrix, X = ‖xij‖, which minimizes ∑i,j xijdij, under certain constraints, where xij is the number of persons of skill type i assigned to jobs of skill type j. An input to the problem, then is a determination, for a given organization, of the occupational categories, j = 1, …, s, to which personnel will be assigned. This paper applies the problem to a repair organization. Before one can determine the number of repair men in an organization, among other factors, one must determine the number of their occupational categories.
Some Notes on the Similarity of Three Management Science Models and Their Analysis by Connectivity Matrix Techniques
Authors: Steinberg Alan W.
Published: November 2008

Certain Properties of Connectivity Matrices are noted to be similarly applicable to Three Management Science Models which have hitherto been investigated as independent structures: (1) PERT Network Analysis; (2) Parts Explosion Techniques; and (3) Business System Data Flow Analysis. These properties suggest some computational techniques which should be helpful in the analysis of systems described by the three models.
On Adaptive Programming
Authors: Marschak Jacob
Published: November 2008

In general, it is non-optimal to estimate, on the basis of past experience and as a basis for present action, an a posteriori statistical parameter other than the optimal action itself.
Statistical Control of Time Standards
Authors: Langier Franciszek Jan
Published: November 2008

An application of the statistical control of time standards developed by the author has, quite unexpectedly, created the possibility of a further application of this method as an indicator of organisational deficiencies in industry which, at the same time, makes it possible to locate these deficiencies in the respective plants, departments and workshops.
The Perils of Polynomials
Authors: Cowden Dudley J.
Published: November 2008

It is extremely dangerous to extrapolate a polynomial trend. Although there are other sources of danger, this study concentrates on the statistical error, which is very large for end values and increases alarmingly with extrapolations. Relative standard errors of polynomial trend values are summarized, and generalizations are made concerning the relative magnitude of the standard errors with changes in: (1) the degree of equation; (2) the number of observations; (3) the position of the trend value in time. The most interesting generalization is that the relative variance of a polynomial of degree m, as the position of the trend value departs farther and farther from the central position in time, may be described by a polynomial equation of degree 2m.
Marketing Expansion—A Statistical Analysis
Authors: King William R.
Published: November 2008

The problem of introducing a consumer product into the market is considered as one of “testing” the product in some restricted group of marketing areas and utilizing the information thereby gained in drawing inference to potential new market areas.

A decision rule is developed for classifying proposed expansion areas as potentially penetrable or impenetrable for the product using minimization of the expected cost of error as the optimality criterion. A significance test for the classification is considered along with the problems of ranking areas within the two categories, classifying groups of areas, and analyzing the sensitivity of the solution.
Resignation: What do we Really Know About it?
Authors: Cornog Geoffrey Y.
Published: November 2008

Simple rate comparisons, the use of biographical characteristics of the individual, and the use of a formal definition of resignation are all parts of the method of resignation analysis in common use among students of administration, personnel technicians, and executives. Tests of the assumptions on which these common tools are based indicate that they are open to considerable objection, both for practical organization purposes and for purposes of research in organizational behavior.
Depreciation, Market Valuations, and Investment Theory
Authors: Smith Vernon L.
Published: November 2008

In this paper the theory of optimal replacement investment decisions is employed to interpret the problem of depreciation accounting and market valuation. An asset should be replaced when its net contribution to present worth from an additional (marginal) year of service no longer exceeds its external market value. Three concepts of depreciation are contained or involved in this investment decision rule: market value, capital recovery, and net contribution to present worth. Market value and capital recovery are commonly suggested “methods” of depreciation. Net contribution to present worth declines with asset age, and represents a concept of depreciation that generally may not coincide with market valuation in exchange. The existence of a market for a used asset is interpreted in terms of multiple uses (and marginal internal values) for an asset. Through exchange the asset is downgraded from one use to another until it is junked.
Erratum
Authors: Charnes A. , Cooper W. W. , Kortanek K.
Published: November 2008

Discussion that was omitted from page 210 of the authors' article “Duality in Semi-Infinite Programs and Some Works of Haar and Caratheódory,” Management Science, Vol. 9, No. 2 (January 1963).
Some New Statistical Techniques Applicable to Operations Research
Authors: Ackoff Russell L.
Published: November 2008

The task of describing new statistical methods which have potential use in operations research is not an easy one; many of you have attained a level of statistical knowledge to which I cannot pretend, and the field of statistics is expanding so rapidly that one could not hope to do justice to the topic in a short time. Consequently, rather than attempt to list the many developments which might be of interest, I will describe three methods which I have found of particular interest and usefulness.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Operations Research in Agriculture
Authors: Thornthwaite C. W.
Published: November 2008

No abstract available.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Monte Carlo Method as a Natural Mode of Expression in Operations Research
Authors: King Gilbert W.
Published: November 2008

Operations research is meaningless unless it gets results quickly. Every group has its own preferences, and possibly other methods are better, but the fact remains that almost all the real problems we have solved have been solved by the Monte Carlo method, which gave acceptable results in a reasonable time.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Optimum Distribution of Effort
Authors: Koopman Bernard O.
Published: November 2008

When a limited amount of effort is available for the performance of two related tasks, the practical of how it is to be divided between them in order to obtain the best over-all result is one which constantly arises in operations research. The object of the present paper is to show how the question can often be put in quantitative form, and then to give it a simple mathematical solution in illustrative cases, interpreting the results in the language of recommended procedures.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
A Mathematical Note on Sub-Optimization
Authors: Marshall A. W.
Published: November 2008

Of the several points discussed in the previous paper [Hitch, C. J. 1953. Jour. Op. Res. Soc. America 1 87.], perhaps only one requires any mathematical restatement or explication. This one is the so-called “Golden Rule” for the allocation of scarce resources. Here we present, for a simple case, the proof of the theorem on which it is based [For a discussion of a more general case readers are referred to K. J. Arrow's paper, “An Extension of the Basic Theorem of Classical Welfare Economics,” Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, 1951, pp. 507–532.].

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
The Theory of Value and the Science of Decision a Summary
Authors: Smith Nicholas M. , Walters Stanley S. , Brooks Franklin C. , Blackwell David H.
Published: November 2008

Operations research is defined as “the science of decision.” It is necessary, therefore, to understand the rationale and operation of the decision process. Decision is primarily based upon two quantities: (1) the probability with which certain immediate outcomes may result if a given course of action is taken; and (2) the value or worth of these outcomes. The product of probability times value summed over all the possible outcomes is the expected value, or simply the expectation. The course of action which leads to the highest expectation is the indicated choice of the decision. Decision means preference, and preference can be expressed only between like quantities. Thus, the problem in establishing a set of values is to establish a numerical function which will enable the ranking of preference of states or conditions.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Linear Programming and Profit Preference Scheduling for a Manufacturing Firm
Authors: Charnes A. , Cooper W. W. , Farr Donald
Published: November 2008

Many business, economic, and engineering problems involve devising means of achieving optimal results in the face of a series of restrictions. These restrictions may assume a variety of forms. Plant or machine capacities, labor requirements, market restrictions, procedural and policy conditions, financial limitations, etc., are examples common to many kinds of business. Other examples may be specialized to more narrow groups of firms. It is, therefore, desirable to develop modes of attacking such problems which will provide a general and economical method of (1) determining best or optimal solutions within the stipulated limitations and (2) assessing the economic cost of the restrictions and, therefore, the worthwhileness of altering them.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Failure of Complex Equipment
Authors: Shellard Gordon D.
Published: November 2008

This paper had its origin in consideration of the work reported on by D. M. Boodman [Boodman, D. M. 1953. The reliability of airborne radar equipment. Jour. Op. Res. Soc. America 1 (February) 39–45.]. The purpose is to examine some of the implications arising from the assumption that a piece of complex equipment fails when, and only when, one of its component parts fails. The equipment is assumed made up of many individual parts, each of which is liable to prime failure independent of all other parts. Two different initial conditions are assumed at the beginning of observation or operation: (a) all components are new; (b) the equipment has been operating for a long time, components that have failed having been replaced by new ones at the time of failure. We consider the probability of failure of the equipment as a function of time and of the survival curve of individual components, and the possible improvement of reliability of equipment by replacement of components at a given age.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Operations Research and the Management Consultant
Authors: Pocock J. W.
Published: November 2008

The genesis of management consulting is somewhat obscured in the mists of time. However, the profession's written history begins with the work of Frederick W. Taylor, Henry L. Gantt, Emerson, and other pioneers of scientific management, who began their work around 1885. At that time they formulated the doctrine that scientific methods of analysis and measurement could and should be used in matters of production, and that wherever possible, business decisions should be based on facts rather than on somebody's intuition or emotional reaction. The original emphasis was on work in the production area, since here facts could be readily accumulated, experiments executed and results followed within a limited area of observation.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Sub-Optimization in Operations Problems
Authors: Hitch Charles
Published: November 2008

The validity and therefore the usefulness of operations research depend upon the skill with which projects are designed and particularly upon the shrewdness with which criteria (“payoffs,” “objectives functions”) are selected. The criterion problem has been relatively neglected in operations research literature, and has apparently usually been “solved” in practice by assuming the first plausible payoff function which springs to mind; or if several spring to mind, by trying all and compromising (or letting a commander compromise) among the results of alternative computations. The problem is much too important for such casual treatment. Calculating quantitative solutions using the wrong criteria is equivalent to answering the wrong questions. Unless operations research develops methods of evaluating criteria and choosing good ones, its quantitative methods may prove worse than useless to its clients in its new applications in government and industry.

Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.