• Publications
  • Influence
Introduction of Operations Research
Overview of the operations research modelling approach introduction to linear programming solving linear programming problems - the Simplex Method duality theory and sensitivity analysis other algorithms for linear programming the transportation and assignment problems network analysis, including Pert-CPM dynamic programming game theory integer programming non-linear programming Markov chains queueing theory the application of queueing Theory inventory theory forecasting Markovian decision processes and applications decision analysis simulation. Expand
  • 2,590
  • 30
A Sequential Stochastic Assignment Problem
Suppose there are n men available to perform n jobs. The n jobs occur in sequential order with the value of each job being a random variable X. Associated with each man is a probability p. If a "p"Expand
  • 165
  • 28
Introduction to Operations Research (10th ed.)
  • 252
  • 24
Introduction to operation research.
  • 280
  • 15
A Renewal Decision Problem
A system e.g., a motor vehicle must operate for t units of time. A certain component e.g., a battery is essential for its operation and must be replaced each time it fails. There are n types ofExpand
  • 80
  • 6
  • PDF
Introduction to Mathematical Programming
Overview of the operation research modelling approach introduction to linear programming solving linear programming problems - the Simplex method the theory of the Simplex method duality theory andExpand
  • 185
  • 5
Sampling Plans for Inspection by Variables
Abstract * This work was performed under the sponsorship of the office of Naval Research. The authors are indebted to Albert H. Bowker for invaluable aid.
  • 195
  • 5
On Optimal Assembly of Systems
Abstract : The paper discusses the following reliability problem: A system has k different types of components. Associated with each component is a numerical value. Let the set(a sup j) (j = 1,...,k)Expand
  • 43
  • 4
  • PDF
Optimal System Allocations with Penalty Costs
We have N stages to sequentially construct I successful components. At each stage, we allocate a certain amount of money for the construction of a component. If y is the amount allocated, then theExpand
  • 18
  • 4
  • PDF
On the Consecutive-k-of-n:F System
The linear (circular) k-of-n:F system has n linearly (circularly) ordered components. Each component either functions or fails. The system fails i.f.f.k consecutive components fail. This paperExpand
  • 225
  • 3