315 results
Search Results
2. Opinion Paper.
- Author
-
Cooper, William S.
- Subjects
INDEXING ,QUALITY ,MATHEMATICAL analysis ,HYPOTHESIS ,REASONING ,CATALOGING - Abstract
It is often assumed that the amount of interindexer consistency experienced under a given method of indexing is somehow indicative of the quality of the indexing. To explore this assumption, two hypotheses are stated concerning the possible connection between interindexer consistency and indexing quality. A specific counter-example is then exhibited which shows both hypotheses to be invalid. Although a mathematical analysis of the counterexample yields certain insights, the general relationship between interindexer consistency and successful retrieval is more subtle than might have been expected. it is concluded that until equations describing this relationship have been derived, measurements of interindexer consistency will have little meaning as clues to indexing quality. [ABSTRACT FROM AUTHOR]
- Published
- 1969
3. COUNTS DELAYED BUT NOT LOST-A NOTE ON A PAPER OF HAIGHT.
- Author
-
Anderson, J. A. and Bithell, J. F.
- Subjects
MIXTURE distributions (Probability theory) ,MARKOV processes ,STOCHASTIC processes ,DISTRIBUTION (Probability theory) ,NUMERICAL analysis ,MATHEMATICAL analysis ,PROBABILITY theory - Abstract
This paper generalizes, by the use of compound distributions, a result of HAIGHT (1966) on counts that are delayed but not lost. An application of Markov chains indicates a simple method of numerical evaluation of the distributions involved. Finally a continuous time analogue is studied. [ABSTRACT FROM AUTHOR]
- Published
- 1967
- Full Text
- View/download PDF
4. Non-Occupational Uses of Mathematics Mental and Written—Approximate and Exact
- Author
-
Wandt, Edwin and Brown, Gerald W.
- Published
- 1957
5. A COMMENT ON A PAPER OF MAXWELL BY J.B. SIDNEY--A REJOINDER.
- Author
-
Moore, J. M.
- Subjects
JOB shops management ,INTEGER programming ,PRODUCTION management (Manufacturing) ,PRODUCTION planning ,MANUFACTURING cells ,MANUFACTURING process management ,MATHEMATICAL programming ,MATHEMATICAL analysis ,MATHEMATICAL models of industrial management ,OPERATIONS research ,MANAGEMENT science research - Abstract
The article presents the author's comments on criticisms of the management science paper "On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs," by William L. Maxwell. Maxwell presented an integer programming formulation for a one-machine job shop problem. The author contends that Maxwell's formulation was erroneous due to the intermediate steps leading from the original problem. He explains that the steps are not adequately described and therefore problematic. The author also explains that the counterexample to Maxwell's assessment is unable to be proven.
- Published
- 1972
- Full Text
- View/download PDF
6. THE DISTRIBUTION OF THE TIME REQUIRED TO REDUCE SOME PREASSIGNED LEVEL A SINGLE-CHANNEL QUEUE CHARACTERIZED BY A TIME-DEPENDENT POISSON-DISTRIBUTED ARRIVAL RATE AND A GENERAL CLASS OF HOLDING TIMES .
- Author
-
Luchak, George
- Subjects
QUEUING theory ,OPERATIONS research ,POISSON distribution ,MATHEMATICAL analysis ,DIFFERENTIAL equations ,ANALYSIS of variance ,PRODUCTION scheduling - Abstract
This paper provides the solution to the problem of the distribution of busy periods of the single-channel queue characterized by a time-dependent Poisson-distributed arrival rate and a general class of holding times. The notation is chosen in such a fashion that the main body of computations and mathematical analysis is identical with what was required in the solution of the general queuing equations considered in a previous paper which should be read first
[4] . The solution of the problem for winch the traffic intensity is constant and the holding time distribution is Pearson type III is derived in closed form in terms of the In k functions introduced previously. [ABSTRACT FROM AUTHOR]- Published
- 1957
- Full Text
- View/download PDF
7. MATHEMATICAL ANALYSIS OF FACILITY-COMMODITY SCHEDULING PROBLEMS.
- Author
-
Beenhakker, H. L.
- Subjects
MATHEMATICAL analysis ,PRODUCTION scheduling ,MANUFACTURING processes ,PRODUCTION (Economic theory) ,COMMERCIAL products - Abstract
A number of operational situations exist in which certain facilities are available and where a number of commodities must be processed on some or all of these facilities. The paper describes an algorithm to generate schedules which are near optimal or optimal with respect to the total processing time of all the commodities, the idle time of facilities and production rate. Thus, these schedules are characterized by near minimal or minimal total processing time and idle time of facilities and near maximal or maximal production rate. Usually this algorithm does not result in the desired schedule after the first application; it is therefore proposed to generate a set "D" of schedules from which the desired schedule can be selected. A decision rule determines the optimal number of elements belonging to set D. In order to justify the concept of the algorithm for the determination of the schedules mentioned above, an analysis is given of the decision tree associated with the sequencing model in terms of the probabilities related to the nodes in the decision tree. [ABSTRACT FROM AUTHOR]
- Published
- 1963
- Full Text
- View/download PDF
8. STOCHASTIC DUELS WITH LIMITED AMMUNITION SUPPLY.
- Author
-
Ancker Jr., C. J.
- Subjects
STOCHASTIC analysis ,MATHEMATICAL analysis ,STOCHASTIC processes ,AMMUNITION ,EXPLOSIVES ,GUNNERY - Abstract
In a previous paper the ground work was laid for a new theoretical model of combat called the 'stochastic duel.' The principal elements of the model were fixed kill probabilities on each round fired, a random time between rounds fired, and unlimited ammunition supply. This paper extends the solution to those more realistic cases of limited ammunition supply. The general solution (as a quadrature) is obtained and it is applied to several specific examples. The special case of finite, fixed ammunition supply is treated separately. [ABSTRACT FROM AUTHOR]
- Published
- 1964
- Full Text
- View/download PDF
9. THE SIMPLEX METHOD: TWO BASIC VARIABLES REPLACEMENT.
- Author
-
Paranjape, S. R.
- Subjects
LINEAR programming ,MATHEMATICAL programming ,SYSTEMS engineering ,MATHEMATICAL analysis ,PROBLEM solving ,MANAGEMENT science ,SIMPLEXES (Mathematics) ,MATHEMATICAL variables ,MATHEMATICAL optimization ,OPERATIONS research ,LINEAR systems ,SYSTEM analysis - Abstract
The paper presents a method for solving the linear programming problems, which is itself a step towards the generalization of the classical Simlex Method. It replaces two basic variables by two non-basic variables at each iteration. Naturally this will reduce the total number of steps to reach the final solution. The paper also includes the solution of one example to illustrate the applicability of the method. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
10. INDEPENDENCE, TRADE-OFFS, AND TRANSFORMATIONS IN BIVARIATE UTILITY FUNCTIONS.
- Author
-
Fishburn, Peter C.
- Subjects
UTILITY functions ,PRODUCTION possibility curve ,VARIATE difference method ,PROBABILITY theory ,INDIFFERENCE curves ,AXIOMS ,MATHEMATICAL models ,MATHEMATICAL analysis ,MATHEMATICAL transformations ,DIFFERENTIAL invariants ,MATHEMATICAL models of consumption - Abstract
This paper explores several important notions relevant to modern utility theory. Restricting the discussion to the consideration of bivariate utility functions, the paper defines and examines the interrelationships between (1) independence in the utility sense, (2) trade-off or indifference curves, and (3) transformation curves (as defined herein). Following the form in which a set of basic axioms of utility are stated, independence is defined in terms of indifference between 50-50 gambles, and it is shown that, if the condition of the definition holds, then φ (x, y), the bivariate utility function, can be written as a function of x plus a function of y. The concepts of trade-off curve (indifference curve) and transformation curve are also defined on the basis of the indifference relation but are not concerned with gambles. After exploring relationships among the three notions it is shown how the utility curves for the two variables under independence can be constructed on the basis of two trade-off curves. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
11. A NOTE ON THE OPTIMALITY OF (S, s) POLICIES IN INVENTORY THEORY.
- Author
-
Zabel, Edward
- Subjects
PRODUCTION planning ,PRODUCTION control ,MATHEMATICAL analysis ,MATHEMATICAL functions ,INVENTORY control ,HOLDING cost ,SUPPLY & demand ,INDUSTRIAL costs ,MATHEMATICAL models ,ECONOMIC demand ,MANAGEMENT - Abstract
In this paper a proof of Herbert Scarf's on the optimality of (S,s) policies in inventory theory is extended to cases where differentiability of cost functions may not be available. In addition to an ordering cost composed of a unit cost plus a reorder cost all that is needed in the proof is that the expected holding and shortage cost function be convex. [ABSTRACT FROM AUTHOR]
- Published
- 1962
- Full Text
- View/download PDF
12. SURROGATE MATHEMATICAL PROGRAMMING.
- Author
-
Greenberg, Harvey J. and Pierskalla, William P.
- Subjects
MATHEMATICAL programming ,MATHEMATICS ,OPERATIONS research ,LINEAR programming ,MATHEMATICAL optimization ,MATHEMATICAL analysis - Abstract
This paper presents an approach, similar to penalty functions, for solving arbitrary mathematical programs. The surrogate mathematical program is a lesser constrained problem that, in some cases, may be solved with dynamic programming. The paper deals with the theoretical development of this surrogate approach. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
13. OPTIMIZATION OF SERIES-PARALLEL-SERIES NETWORKS.
- Author
-
Jensen, Paul A.
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,MATHEMATICAL analysis ,PROBABILITY theory ,ALGEBRA ,MATHEMATICS - Abstract
This paper introduces a generalization of the frequently discussed problem of finding the optimum redundancy that maximizes the reliability of a network of components. Past work has restricted consideration to arrangements of redundant components called series-parallel networks. This paper allows a much broader class of arrangements called series-parallelseries networks. It is important to consider such arrangements for realistic situations in which components have more than one failure mode, or the combination of parallel paths introduces a failure probability. A dynamic programming algorithm is used to solve the more general problem for the case in which there are no constraints on the optimum solution. The algorithm is extended to handle multiple constraints using dominance and a variety of elimination methods to reduce the storage required in a compurer implementation of the algorithm. Problems with as many as 15 serial components and three constraints have been solved with reasonable digital computer computation times. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
14. CUTTING-PLANE METHODS WITHOUT NESTED CONSTRAINT SETS.
- Author
-
Topkis, Donald M.
- Subjects
ALGORITHMS ,ALGEBRA ,CALCULATORS ,FOUNDATIONS of arithmetic ,MATHEMATICAL analysis ,MATHEMATICS - Abstract
This paper gives general conditions for the convergence of a class of cutting-plane algorithms without requiring that the constraint sets for the subproblems be sequentially nested. Conditions are given under which inactive constraints may be dropped after each subproblem. Procedures for generating cutting-planes include those of KELLEY, CHENEY AND GOLDSTEIN, and a generalization of the one used by both ZOUTENDIJK and VEXNoTT. For algorithms with nested constraint sets, these conditions reduce to a special case of those of ZANGWILL for such problems and include as special cases the algorithms of Kelley, Cheney and Goldstein, and Veinott. Finally, the paper gives an arithmetic convergence rate. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
15. AN OVERVIEW OF THE MATHEMATICAL THEORY OF GAMES.
- Author
-
Lucas, William F.
- Subjects
GAME theory ,MATHEMATICAL models ,DECISION making ,DECISION theory ,SIMULATION methods & models ,MANAGEMENT science ,MATHEMATICAL analysis ,THEORY ,MATHEMATICAL functions - Abstract
A cursory survey of the theory of games is presented. The basic models for games in extensive form, normal form, and characteristic function form are discussed, and some generalizations and extensions of these models are mentioned briefly. Some general remarks about the applicability of the theory are made in §2, and a few specific applications are referred to in sections subsequent to the description of the particular models. Mention is made throughout this paper to the other game theoretic articles in this issue in an attempt to place them somewhat within this outline of the subject. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
16. ON TERMINATING STOCHASTIC GAMES.
- Author
-
Mine, H., Yamada, K., and Osaki, S.
- Subjects
GAME theory ,DECISION making ,MARKOV processes ,STOCHASTIC processes ,STOCHASTIC models ,PRODUCTION scheduling ,LINEAR programming ,MATHEMATICAL programming ,MATHEMATICAL optimization ,MAXIMA & minima ,MATHEMATICAL analysis - Abstract
This paper describes a stochastic game in which the play terminates in a finite number of steps with probability 1. The game is called a terminating stochastic game. When the play terminates at any step, the play is regarded to reach to an absorbing state in the Markov chain under consideration. Hence, the terminating stochastic game is a nonstationary Markov chain with rewards in which our concern is the transient behavior before absorption. In particular, when one of the players is a dummy, the stochastic game reduces to a Markovian decision process of special type. This paper discusses such games. We introduce a new concept of rewards and formulate three problems arising in the games by linear programming. Finally, numerical examples are presented. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
17. GAME THEORETIC ANALYSIS OF A PROBLEM OF GOVERNMENT OF PEOPLE.
- Author
-
Chidambaram, T. S.
- Subjects
SOCIAL control ,GAME theory ,DECISION making ,DECISION theory ,OPERATIONS research ,INDUSTRIAL engineering ,SYSTEMS theory ,MANAGEMENT science ,MATHEMATICAL analysis ,UTILITY theory ,CONTROL (Psychology) - Abstract
The general problem of control of a set of individuals to achieve the objective of a controller is common to many areas such as business and government. This paper attempts a mathematical formulation and analysis of such problems. It is assumed that each individual is a rational being acting in his own self-interest. The interests of different individuals are, in general, conflicting, thus leading to a competitive situation which can be analyzed using Game Theory notions. An important aim of mathematical analysis of such a situation will be to study the effectiveness of various kinds of power that a controller might have over the individuals. Most of the results in this paper are concerning a class of 'coordination problems' where the controller's objective is to maximize the total utility to the whole group of individuals and where competition arises due to constraints on strategies. The analysis indicates that in such cases the simple power to accept or reject strategies which violate the constraints may be sufficient to realize the controller's goals. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
18. AN ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM.
- Author
-
Graves, G. W. and Whinston, A. B.
- Subjects
RESOURCE allocation ,QUADRATIC assignment problem ,ASSIGNMENT problems (Programming) ,ECONOMIC models ,COMBINATORIAL optimization ,COMBINATORICS ,ECONOMIC statistics ,MATHEMATICAL statistics ,MATHEMATICAL models ,ALGORITHMS ,MATHEMATICAL analysis ,PROBLEM solving - Abstract
The paper presents a new approach to solving a class of combinatorial economic allocation problems. One member of this class is known as the quadratic assignment problem. Besides presenting an algorithm to solve this problem, we will discuss in general terms the techniques for treating combinatorial problems. A novel feature of the paper is the development of the statistical properties of the criterion function. These statistical properties are used in conjunction with a general enumerative procedure to form the main parts of the algorithm. Using the idea of confidence level enumeration, an extension of the algorithm is proposed which should allow for the effective treatment of large scale combinatorial problems. Finally we present some computational results in order to illustrate the effectiveness of the general approach. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
19. AN INFINITE LINEAR PROGRAM WITH A DUALITY GAP.
- Author
-
Duffin, R. J. and Karlovitz, L. A.
- Subjects
HAAR system (Mathematics) ,DUALITY theory (Mathematics) ,LINEAR programming ,INFINITE processes ,ORTHOGONAL functions ,MATHEMATICAL analysis ,COMPUTER programming ,MATHEMATICAL programming ,MATHEMATICAL optimization ,LINEAR systems ,MAXIMA & minima ,TOPOLOGY - Abstract
The first part of this paper is concerned with the semi-infinite linear programs studied by Charnes, Cooper and Kortanek. A form of the Farkas lemma stated by Haar appears to apply to such programs and leads to a duality theorem. In this paper an example of a semi-infinite program is given which is consistent and which has a finite minimum. However the dual program is found to be inconsistent. With a variation of the example a situation is exhibited in which both the program and its dual are consistent and have finite extrema. In this case, however, the minimum of the former is not equal to the maximum of the latter. The existence of such a ‘duality gap’ indicates that Haar's statement needs qualification. In the second part of the paper a correct form of Haar's theorem is stated and proved. The proof invokes the infinite programming theory of Duffin and Kretschmer. The last part of the paper develops a new duality theory for infinite programs which, as a special case, insures a weak form of duality for programs typified by the examples. This new duality theory is somewhat simpler than previous theories of infinite programming. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
20. SOME GENERALIZATIONS OF AN INVENTORY PLANNING HORIZON THEOREM.
- Author
-
Zabel, Edward
- Subjects
INVENTORIES ,PRODUCTION planning ,INVENTORY control ,BUSINESS mathematics ,MATHEMATICAL models of industrial management ,BUSINESS planning ,MANAGEMENT science ,MATHEMATICAL models in business ,STRATEGIC planning ,MATHEMATICAL analysis - Abstract
This study extends the results of a paper on inventory models by H. M. Wagner and T. M. Whitin. Particular attention is given to the usefulness of planning horizon theorems in simplifying computations. [ABSTRACT FROM AUTHOR]
- Published
- 1964
- Full Text
- View/download PDF
21. ON A BASIC CLASS OF MULTI-ITEM INVENTORY PROBLEMS.
- Author
-
Balintfy, Joseph L.
- Subjects
PRODUCT management ,INVENTORIES ,DECISION making ,INVENTORY control ,DECISION theory ,COST analysis ,MATHEMATICAL optimization ,OPERATIONS research ,INDUSTRIAL costs ,MANAGEMENT science ,COMPUTER simulation ,MATHEMATICAL analysis - Abstract
The paper evaluates and compares classes of multi-item inventory problems where joint order of several items may save a part of the setup cost. A cost ratio and simple decision rule are determined for joint versus individual orders in specified cases. The comparisons call for the necessity of a new policy for reorder point-triggered random output multi-item systems. This policy, "the random joint order policy," operates through the determination of a reorder range within which several items can be ordered. The existence of an optimum reorder range is proved, and a computational technique is demonstrated with the help of a machine-interference type queueing model. Under favorable conditions the results exhibited on the diagram of optimum reorder ranges are generally applicable. The random joint order policy model is especially suitable for computer controlled inventory systems. [ABSTRACT FROM AUTHOR]
- Published
- 1964
- Full Text
- View/download PDF
22. Matrix Models of Reciprocal Service Cost Allocation.
- Author
-
Minch, Roland and Petri, Enrico
- Subjects
MATRICES (Mathematics) ,COST allocation ,ALGEBRA ,MATHEMATICAL models ,ACCOUNTING ,MATHEMATICAL analysis ,MATHEMATICS ,COST accounting - Abstract
The article is a comment on an article "Matrix Theory and Cost Allocation," by researchers T.H. Williams and C.H. Griffin, published in the July 1964 issue of the journal "The Accounting Review." According to the author, Williams and Griffin were the first to select this topic as an illustration of the application of matrix algebra to accounting problems. The model presented by Williams and Griffin is a matrix formulation of the popular simultaneous equations method of past years. It was pointed out that the aggregate cost of service departments after allocation in the Williams and Griffin model is more than the combined direct cost before allocation. The scope of this paper has two dimensions: first, to attempt to clarify the matrix algebra approaches that have already been posed and place them in perspective; second, to present a new matrix model of reciprocal service cost allocation and relate it to those previously presented. It would be assumed that each service department will have some of its cost allocated to some of the producing departments.
- Published
- 1972
23. ASYMPTOTICALLY OPTIMAL TESTS OF COMPOSITE HYPOTHESIS FOR RANDOMIZED EXPERIMENTS WITH NONCONTROLLED PREDICTOR VARIABLES.
- Author
-
Neyman, Jerzy and Scott, Elizabeth L.
- Subjects
RANDOM variables ,HYPOTHESIS ,DISTRIBUTION (Probability theory) ,MATHEMATICAL analysis ,NUMERICAL analysis ,CHARACTERISTIC functions - Abstract
The paper is concerned with randomized experiments with one treatment. Two randomization schemes are considered: randomized pairs and unrestricted randomization. If effective at all, the treatment is supposed to affect the conditional distribution of the "experimental" variable Y given another variable X, called "predictor". The distribution of X is not affected by the treatment. Using the general theory published elsewhere, the paper deduces the locally asymptotically optimal test of the hypothesis that the treatment has no effect. Apart from the usual difficulties connected with asymptotic tests (how large must N be?), the theory is easily applicable in many "live" cases even though the conditional distribution of Y given X may contain nuisance parameters and be of unusual form. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
24. Discussion.
- Author
-
Kessen, William
- Subjects
MATHEMATICAL functions ,CHILD development ,DEVELOPMENTAL psychobiology ,LOGIC ,INTELLECT ,PSYCHOLOGY ,DIFFERENTIAL equations ,MATHEMATICAL analysis ,MATHEMATICS - Abstract
The article reports on the discussion of the study concerning the learning of mathematics. The discussion contains arguments regarding the paper written by professor Stone about functions. One of the arguments that is given attention to, is the concept of function being connected with the primitive concepts of pure logic, nearly unanalyzable and must be grasped by a psychological act of direct perception. This argument is also related to the child's development as the notion of grasping and perception are described to occur at some point in the development.
- Published
- 1965
- Full Text
- View/download PDF
25. CRITIQUE OF: "A NEW PRODUCT ANALYSIS AND DECISION MODEL"
- Author
-
Lipstein, Benjamin
- Subjects
NEW product development ,COMMERCIAL products ,MATHEMATICAL analysis ,MATHEMATICAL models ,DECISION making ,PRODUCT management ,SEQUENTIAL analysis ,DECISION theory ,HEURISTIC programming ,MATHEMATICAL programming ,FUNCTIONAL analysis ,RAPID prototyping - Abstract
The article features the author's comments on the research paper "A New Product Analysis and Decision Model." The author acknowledges the important applications of the paper for sequential decision theory in the field of management science, but expresses concern as to generalizations made in the text. It is suggested that the demand function component of the mathematical analysis discussed in the paper. The author proposes that the functional analysis overlooks some main difficulties associated with the featured decision making variables. The industrial product development process is discussed. A heuristic programming approach is also examined.
- Published
- 1968
- Full Text
- View/download PDF
26. STOCHASTIC DOMINANCE AS A RISK ANALYSIS CRITERION.
- Author
-
Porter, R. Burr and Carey, Kenneth
- Subjects
RISK assessment ,RISK ,STOCHASTIC analysis ,STOCHASTIC processes ,MATHEMATICAL analysis ,EVALUATION - Abstract
This paper discusses the Stochastic Dominance (SD) approach to the evaluation of risky assets. Given a set of portfolios, the familiar EV procedure chooses a set of EV-efficient portfolios while the SD procedures choose SD-efficient sets that usually are quite similar to (but not identical with) the EV-efficient set. The SD approach can be employed as a refinement of the EV model or as an alternative method of evaluating portfolios. The SD view has certain conceptual advantages in the screening of a set of portfolios, but the EV model has the important advantage of an optimizing algorithm that builds efficient portfolios. Also, the SD approach requires more data than the EV approach. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
27. A Probabilistic Model for Analyzing Campus Parking Policies.
- Author
-
Narragon, E. A., Dessouky, M. I., and de Vor, R. E.
- Subjects
PARKING facilities ,CAMPUS parking ,AUTOMOBILE parking ,PROBABILISTIC number theory ,MATHEMATICAL analysis ,TRAFFIC regulations - Abstract
In order to evaluate alternative policies for over-issuing permits for a limited number of parking spaces, this paper develops a probabilistic model that allows several classes of users to be considered simultaneously. The sensitivity of the model to its underlying assumptions is derived and illustrated with data from a case study. The paper shows how its model can be used to evaluate over-issuance policies such as a common over-issuance of several lots and mixing different classes of users in one lot. It also discusses the factors to be considered in implementing this approach in the context of a total-parking-system model incorporating other means of satisfying user demands on parking spaces. The model is of an inventory type and is applicable to other problems where there are various classes of customers with varying demand characteristics. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
28. Pseudo-Boolean Solutions to Multidimensional Location Problems.
- Author
-
Warszawski, Abraham
- Subjects
BOOLEAN algebra ,ALGORITHMS ,PHYSICAL distribution of goods ,CONSUMPTION (Economics) ,MULTIDIMENSIONAL symbol test ,MATHEMATICAL analysis ,OPERATIONS research - Abstract
This paper presents a pseudo-boolean formulation of location problems based on a concept of a ‘dummy’ supply source activated outside a given distribution. First, it formulates a simple location problem as a pseudo-boolean function that can be optimized with existing boolean optimization algorithms. Later the formulation is extended to multidimensional location problems. Two such problems are analyzed: the first involves a distribution system with plants for production of different commodities; the second involves a distribution system with consumer demand and its pattern varying with time. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
29. EXPECTED OBJECTIVE VALUE OF A STOCHASTIC LINEAR PROGRAM AND THE DEGREE OF UNCERTAINTY OF PARAMETERS.
- Author
-
Itami, Hiroyuki
- Subjects
PROGRAMMING languages ,STOCHASTIC programming ,LINEAR programming ,MATRICES (Mathematics) ,UNCERTAINTY ,ANALYSIS of covariance ,MULTILEVEL models ,DUALITY theory (Mathematics) ,MATHEMATICAL analysis - Abstract
In this paper, we characterize the relationship between the expected optimal value of a stochastic linear program and a stochastic program with recourse and the degree of uncertainty in the objective function coefficients c and the stipulation vector b. It is shown that under certain conditions the expected objective value is nondecreasing as the degree of uncertainty in c increases and the opposite is true for the case of b. The degree of uncertainty of a random vector is defined in terms of a covariance matrix. Some managerial interpretations are also given. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
30. PUBLIC FACILITIES LOCATION UNDER STOCHASTIC DEMAND.
- Author
-
Carbone, Robert
- Subjects
PUBLIC utilities ,ROADS ,STOCHASTIC analysis ,MATHEMATICAL analysis ,STOCHASTIC processes ,MATHEMATICAL programming ,ALGORITHMS ,COMPUTER programming ,FUNCTIONAL equations - Abstract
This paper extends the current state of public facilities location problems on a road network to cover situations in which the number of users at each node may be a random variable. The basic location model is reformulated as a chance-constrained programming problem with fractile criterion. A computational procedure for solving the non-linear deterministic equivalent problem derived is presented. Finally, a hypothetical numerical example illustrates the possibility of changes in the location decision when the stochastic nature of the problem is taken into account. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
31. ON SIMPLE STOCHASTIC DIFFUSION MODELS.
- Author
-
Gray, Louis N. and von Broembsen, Maximilian H.
- Subjects
STOCHASTIC analysis ,DIFFUSION processes ,INFORMATIONS (Criminal procedure) ,STOCHASTIC processes ,MARKOV processes ,MATHEMATICAL analysis - Abstract
This paper expands the diffusion of information models developed by Funkhouser and McCombs (1972) to include situations involving simple interaction processes and more complicated situations involving both mass mediated messages and interactively mediated messages. This paper develops discrete time models of information diffusion as opposed to the continuous time models developed by Coleman (1964) and Bartholomew (1967) and others. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
32. INCREASING THE RATES OF FABRIC PRODUCTION OF WEFT- KNITTING MACHINERY PART III: MEASUREMENT OF THE NEEDLE FORCES.
- Author
-
Black, D. H. and Munden, D. L.
- Subjects
KNITTING machines ,TEXTILE machinery ,NEEDLES & pins ,VISCOSITY ,PROPERTIES of matter ,TEXTILES ,MEASURING instruments ,LUBRICATION & lubricants ,MATHEMATICAL analysis - Abstract
When information is required about the forces acting on the needles in different cam systems, it is clearly more desirable to measure these forces directly than to measure the over-all machine torque. This paper describes a method for measuring the needle forces directly, and an examination is made of some of the information obtained from the force-measuring device used. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
33. INCREASING THE RATES OF FABRIC PRODUCTION OF WEFT- KNITTING MACHINERY PART II: AN ANALYSIS OF HIGH-SPEED KNITTING-CAM SYSTEMS.
- Author
-
Black, D. H. and Munden, D. L.
- Subjects
KNITTING machines ,TEXTILE machinery ,TEXTILES ,YARN ,WOOL textiles ,ACCELERATION (Mechanics) ,WORSTED ,PRODUCTION (Economic theory) ,MATHEMATICAL analysis - Abstract
It has been shown in the preceding paper how high-speed cam systems were desired to give substantial increases in the rate of fabric production of weft-knitting machinery. This paper provides a detailed analysis of the effect of cam shape on the knitting-yarn tensions, machine performance, and individual needle forces. It is explained that, although the yarn tensions developed within the knitting cycle are greater for high-speed cams than for conventional linear cams, these tensions do not affect the resulting fabric appearance or the machine performance. In addition, calculations of individual needle forces and high-speed trials indicate that speeds many times as great as commercial speeds may be achieved with the mathematically designed high-speed cams. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
34. A METHODOLOGICAL NOTE ON TYPOLOGICAL ANALYSIS IN STATUS CONSISTENCY RESEARCH.
- Author
-
Berry, Kenneth J. and Martin, Thomas W.
- Subjects
MATHEMATICAL analysis ,PSYCHOLOGICAL typologies ,COMBINATORICS ,PUBLIC opinion ,EXPERIMENTAL design ,MATHEMATICAL optimization - Abstract
Status consistency research has been severely criticized for its inability to reconcile certain problems of theory and method. As the validity of these criticisms has become evident, researchers have turned from classic research designs to more powerful methods. One popular approach has incorporated typological procedures based on two-factor profiles of status inconsistents. In this paper, a serious fault of the two-factor technique is delineated, and the analysis of differences between types is shown to be without substance. Researchers are provided with a simple procedure for avoiding this pitfall before research is initiated, and elementary combinatorial analysis is utilized to derive a proper procedure. Two research designs, a 2 × 4 and a 3 × 4, receive special attention because of their popularity and complexity, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
35. 6. CARDING.
- Author
-
Smith, P. A.
- Subjects
CARDING ,FIBERS ,TEXTILE research ,COTTON carding ,WOOL-carding ,WORSTED ,MATHEMATICAL analysis ,TEXTILE industry ,SPINNING (Textiles) - Abstract
The section of "Yarn Production and Properties," presents information about the process of carding. The mathematical analysis of the evening power of a card has been carried out by a researcher. He divides the card into many homogeneous sections and analyzes the time for a fibre to shift through each of the sections, in terms of its mean and variability. Although three research papers discussed in the article are concerned with cotton carding, but same general principles are applicable to woollen and worsted carding.
- Published
- 1969
36. An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach.
- Author
-
Bradley, Gordon H. and Wahi, Pran N.
- Subjects
LINEAR programming ,ALGEBRAIC functions ,COMBINATORIAL enumeration problems ,MATHEMATICAL programming ,MATHEMATICAL analysis ,FUNCTIONAL equations ,MATHEMATICAL optimization ,OPERATIONS research - Abstract
This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs the Fourier-Motzkin elimination. These algebraic operations transform the problem into a form that leads to an efficient implicit enumeration scheme to calculate an optimal solution. The algorithm constructs, in a finite number of operations, an optimal solution to an integer program with n variables and n or n + 1 inequality constraints. If the original problem has more than n + 1 constraints, then the integer program with only the constraints that are binding at an optimal linear programming solution is solved in place of the original problem. Computational results are presented. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
37. Mathematical Programs with Optimization Problems in the Constraints.
- Author
-
Bracken, Jerome and McGill, James T.
- Subjects
MATHEMATICAL programming ,MATHEMATICAL optimization ,CONVEX programming ,MATHEMATICAL analysis ,FUNCTIONAL equations ,FUNCTIONAL analysis ,OPERATIONS research - Abstract
This paper considers a class of optimization problems characterized by constraints that themselves contain optimization problems. The problems in the constraints can be linear programs, nonlinear programs, or two-sided optimization problems, including certain types of games. The paper presents theory dealing primarily with properties of the relevant functions that result in convex programming problems, and discusses interpretations of this theory. It gives an application with linear programs in the constraints, and discusses computational methods for solving the problems. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
38. A CONTINUATION OF DELAY-DEPENDENT QUEUE DISCIPLINES.
- Author
-
Jiunn Hsu
- Subjects
MATHEMATICAL models ,SYSTEM analysis ,MACHINE theory ,CONTROL theory (Engineering) ,MATHEMATICAL analysis ,OPERATIONS research ,SIMULATION methods & models - Abstract
Kleinrock has studied linearly time-dependent queue disciplines with a set of positive variable parameters. This paper continues his work by deriving a result for a delay-dependent priority system in which a unit's priority is decreased from zero linearly with time in proportion to a negative rate assigned to the unit's group. The two queuing structures provide the system designers the same number of degrees of freedom. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
39. ON THE OPTIMALITY OF SINGLE-SERVER QUEUING SYSTEMS.
- Author
-
Stidham Jr., Shaler
- Subjects
EXPERIMENTAL design ,OPTIMAL designs (Statistics) ,MATHEMATICAL optimization ,MATHEMATICAL analysis ,OPERATIONS research ,SIMULATION methods & models - Abstract
This paper considers optimal design models for queuing systems in which the decision variables are the number of servers and the mean rate at which each serves, the total cost per unit time of operating the system is the sum of a service cost per unit time and a waiting cost per unit time, and the optimality criterion is long-run expected average cost per unit time. It is shown that a single-server system is optimal for a wide class of arrival processes and service-time distributions, and for a wide variety of waiting cost functions. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
40. PARAMETRIC PRIORITY RULES: AN APPROACH TO OPTIMIZATION IN PRIORITY QUEUES.
- Author
-
Balachandran, K. R.
- Subjects
STOCHASTIC processes ,QUEUING theory ,MATHEMATICAL optimization ,MATHEMATICAL analysis ,MANAGEMENT science ,MATHEMATICS - Abstract
This paper analyzes priority rules that are mixtures of preemption and postponable rules. Whether a preemption occurs is made to depend on some factor in addition to priority class; dependence on the completed portion of service (age) of the lower-priority customer in service and the number of prior preemptions of the lower-priority customer in service are each considered. The stochastic model (without priorities) is that of the M/G/1 queue. The paper obtains first-moment expressions (e.g., expected number of customers in the system) in the steady-state case for each priority class as a function of the particular factor being considered. It then introduces a linear cost model that is a function of expected waiting time and expected number of preemptions, and formulates the problem of finding an optimal rule from each class by considering a parametric class of rules determined by each factor. In each case, conditions are sought for the global optimality of a rule over a class of rules, but results are obtained only after restrictions (e.g., monotone failure rates) on service distributions are imposed. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
41. TURNPIKE THEOREMS FOR INTEGER PROGRAMMING PROBLEMS.
- Author
-
Shapiro, Jeremy F.
- Subjects
INTEGER programming ,MATHEMATICAL programming ,DYNAMIC programming ,LINEAR programming ,MATHEMATICAL analysis ,MATHEMATICS - Abstract
A certain class of integer programming problems, called asymptotic or steady-state, has been shown by GOMORY to be cost equivalent to a group-optimization problem. This paper extends the algebraic characterization by demonstrating that there are cost-equivalent group problems for all integer programming problems. Finally, the result is interpreted from the viewpoint of dynamic programming, and this provides the turnpike theorem. [ABSTRACT FROM AUTHOR]
- Published
- 1970
- Full Text
- View/download PDF
42. HEURISTIC APPROACH TO NONSTANDARD FORM ASSIGNMENT PROBLEMS.
- Author
-
Joseph, J. A.
- Subjects
OPERATIONS research ,RESEARCH ,INDUSTRIAL engineering ,MATHEMATICAL optimization ,HEURISTIC ,MATHEMATICAL analysis - Abstract
Many problems of the practicing operations analyst do not fit the standard forms of analytic OR procedures and do not lend themselves to precise optimization methods. The voracious appetite of the computer demands numerical algorithms in order to give answers. Very often an optimum is not absolutely essential to management, as long as the answer is efficient or superior to guesswork. So heuristic approaches are adapted to the problem. This paper presents a heuristic approach to a nonstandard, practical assignment problem. It concerns a problem that the analyst had to solve in the field' at Cape Canaveral (now Cape Kennedy) wherein 74 telemetry channels for 19 missiles had to be assigned to 28 available frequency bands. A conflict for a channel occurs if (a) time for use of the range by the missile channels is demanded and (b) another channel on another missile has the same frequency assignment and also wishes the same time. A conflict means one or more missiles must be denied time on the range, which causes costly delay. It is desirable to assign channels to frequencies (which is done at the time the missile is designed) so as to minimize the total expected amount of conflict (or cost of conflict). This paper shows a general, heuristic (not-necessarily optimum) procedure for handling typical, nonstandard assignment problems and gives details of the Cape Kennedy application. This is an example of what can happen 'in the field' when standard mathematical forms are not available. [ABSTRACT FROM AUTHOR]
- Published
- 1967
- Full Text
- View/download PDF
43. GENERAL SYMMETRIC DUAL PROGRAMS.
- Author
-
Mehndiratta, S. L.
- Subjects
DUALITY theory (Mathematics) ,NONLINEAR theories ,MATHEMATICAL analysis ,OPERATIONS research ,ALGEBRA ,TOPOLOGY ,NONLINEAR programming ,MATHEMATICAL programming - Abstract
Duality and symmetry of nonlinear programs are considered. The duality theorem of this paper assures that if the primal problem is solvable at a certain point of its domain of definition then the dual problem is also solvable at the same point and vice versa. [ABSTRACT FROM AUTHOR]
- Published
- 1966
- Full Text
- View/download PDF
44. ON THE PARTS REQUIREMENTS PROBLEM.
- Author
-
Thompson, Gerald L.
- Subjects
MATHEMATICAL analysis ,SPARE parts ,MATRICES (Mathematics) ,OPERATIONS research ,ALGEBRA ,ASSEMBLY machines ,ASSEMBLY line methods ,PROBLEM solving - Abstract
The parts requirements (or `explosion') problem is that of finding the total numbers of components, subassemblies, and assemblies needed to fulfill an order, given the individual requirements needed in each assembly. In this paper two methods are presented for solving the problem, together with the so-called `spare parts' and `netting' problems. The first method involves the use of the inverse of the matrix I-Q where Q is the quantity matrix. The second method is a generalization of the successive multiplication algorithm, first discussed in a special case by ELMALGHRABY. Mathematical proofs of the methods are presented, as is computational experience with small problems. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
45. QUEUING WITH ALTERNATING PRIORITIES.
- Author
-
Avi-Itzhak, B., Maxwell, J. W. L., and Miller, L. W.
- Subjects
CONSUMERS ,QUEUING theory ,MATHEMATICAL models ,RANDOM variables ,MATHEMATICAL analysis ,MATHEMATICAL statistics ,DENSITY functionals ,FUNCTIONAL analysis - Abstract
For a service facility serving more than one class of customers a problem arises as to the order in which customers should be served (i.e., the priority rule). A typical example is a manufacturing facility that produces two products to meet a random stream of incoming orders. In this paper the alternating priority nile (also known as the `zero switch rule') is introduced and investigated. Two classes of customers are served by a single service facility. Customers of class i(i= 1, 2) have priority over customers of class j(j=I, 2; ≠1) whenever a class i customer is in service. When the service facility is idle, the first arriving customer enters service and acquires the priority right for customers of his class. Within classes the `first-come, first-served' rule is observed. Customers' arrivals are assumed to be Poisson and service times are assumed to be arbitrarily distributed in- dependent random variables. The steady-state densities of queuing times are formulated by the use of a special mathematical procedure. The expectations of queuing times and sizes of queues as well as the first two moments of the busy periods are obtained in terms of the basic parameters of the arrival process and service time distributions. All the results are related to the case where switching from one type of customers to another is not penalized by setup time. The alternating priority rule is compared to the 'head-of-the-line' and the 'first-come, first-served' rules with respect to expected queuing times and queue sizes. The last part of the paper discusses the possibilities of extending the suggested rule to cases involving more than two classes of customers and nonzero setup times and setup costs. [ABSTRACT FROM AUTHOR]
- Published
- 1965
- Full Text
- View/download PDF
46. TWO QUEUES UNDER PREEMPTIVE PRIORITY WITH POISSON ARRIVAL AND SERVICE RATES.
- Author
-
Stephan, Frederick F.
- Subjects
POISSON distribution ,QUEUING theory ,DISTRIBUTION (Probability theory) ,POISSON processes ,STATISTICAL correlation ,OPERATIONS research ,COMBINATORICS ,MATHEMATICAL analysis - Abstract
This paper extends the work of White and Christie, reported in OPERATION RESEARCH, vol 6, pp 79-95 (January-February, 1958), on preemptive priority queuing. A random walk procedure yields recursive relations between the state probabilities in the steady state. Recursive relations for the moments of the length of the lower priority queue follow. Combined with the use of moment generating functions, this approach provides moments of the waiting time for elements of the lower priority class that arrive when the system is in a given state, i e, the two queues are of given lengths. The moments of waiting time and time in the system are also obtained recursively for the steady state Routines for computing and checking are provided. [ABSTRACT FROM AUTHOR]
- Published
- 1958
- Full Text
- View/download PDF
47. THE SOLUTION OF A CERTAIN TWO-PERSON ZERO-SUM GAME.
- Author
-
Brown, Richard H.
- Subjects
TWO-person zero-sum games ,OPERATIONS research ,REAL numbers ,ARITHMETIC ,DIFFERENTIAL games ,MATHEMATICS ,MATHEMATICAL analysis - Abstract
The paper considers two-person zero-sum game. Let B be an arbitrary positive real number and let &b.Theta; be a real number between zero and one. First player chooses a number, t1, with t1 ranging between 0 to B+1. Second player chooses a number, t2, with t2 ranging between 0 to B. The pay-off function, &b.Theta, which specifies the amount the first player receives from second player, is given in the article. If &b.Theta; were continuous, it would be known that these two numbers are equal and hence the game would have a well-determined value. However, the pay-off function considered here is not continuous and this standard theorem cannot be applied. It should be clear that the optimal strategies for first player and second player are not unique.
- Published
- 1957
- Full Text
- View/download PDF
48. ON THE LOADING PROBLEM--A COMMENT.
- Author
-
Lev, Benjamin
- Subjects
ALGORITHMS ,HEURISTIC programming ,MATHEMATICAL programming ,MATHEMATICAL optimization ,RESOURCE allocation ,RESOURCE management ,MATHEMATICAL models ,MATHEMATICAL analysis ,NUMERICAL analysis ,OPERATIONS research ,PROBLEM solving - Abstract
The author responds to the paper "The Loading Problem," by Eilon and Christofides. He focuses on suggesting a solution to the problem. The recommended solution involves a heuristic algorithm that allegedly requires fewer computations than the one proposed by Eilon and Christofides. It is suggested that the simpler algorithm offered by the author reaches mathematical optimization as often as the aforementioned algorithm. It is further proposed that the algorithm presented by Eilon and Christofides cannot be used to solve multi-dimensional programming problems. The author goes on to discuss a numerical analysis that can be used for the allocation of industrial resources. Related mathematical models are discussed in detail. A table comparing the results of the two algorithms is also presented.
- Published
- 1972
- Full Text
- View/download PDF
49. RISK-SENSITIVE MARKOV DECISION PROCESSES.
- Author
-
Howard, Ronald A. and Matheson, James E.
- Subjects
MARKOV processes ,ITERATIVE methods (Mathematics) ,STOCHASTIC processes ,DECISION making ,PROBABILITY theory ,NUMERICAL analysis ,RISK ,MATHEMATICAL analysis ,MATHEMATICAL optimization ,MATHEMATICAL models - Abstract
This paper considers the maximization of certain equivalent reward generated by a Markov decision process with constant risk sensitivity. First, value iteration is used to optimize possibly time-varying processes of finite duration. Then a policy iteration procedure is developed to find the stationary policy with highest certain equivalent gain for the infinite duration case. A simple example demonstrates both procedures. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
50. THE USE OF MULTIPLE RANKING PROCEDURES TO ANALYZE SIMULATIONS OF MANAGEMENT SYSTEMS: A TUTORIAL.
- Author
-
Kleijnen, Jack P. C., Naylor, Thomas H., and Seaks, Terry G.
- Subjects
COMPUTER simulation ,SIMULATION methods & models ,SYSTEM analysis ,RANKING (Statistics) ,DATA analysis ,NUMERICAL analysis ,MANAGEMENT science ,MATHEMATICAL models ,MATHEMATICAL analysis ,OPERATIONS research - Abstract
This paper describes the use of multiple ranking procedures to analyze data generated from computer simulation experiments with models of management systems. After outlining the rationale for the use of multiple ranking procedures with computer simulation experiments and defining some basic terminology, we examine several specific multiple ranking procedures. Careful attention is given to the assumptions underlying the different multiple ranking procedures and the extent to which these assumptions are satisfied by the data generated by simulation experiments. An example model is included to illustrate the applicability of multiple ranking procedures to simulation experiments in management science. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.