STOCHASTIC ALLOCATION PROBLEM.

Haim Mendelson, Joseph S. Pliskin, Uri Yechiali

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

A given quantity of a resource is to be allocated to several activities. The amount of the resource allocated to each activity is used to supply stochastic demands occurring randomly. The system operates as long as all the demands can be met. Whenever the demand of any one activity exceeds its allotment the system fails. The problem is to find the allocation which maximizes the expected time until failure. It is shown that when the available quantity of the resource is large, the optimal allocation is proportionate to the expected demand rate of each activity. An application to a multi-installation inventory problem is presented.

Original languageEnglish
Pages (from-to)687-693
Number of pages7
JournalOperations Research
Volume28
Issue number3 pt 2
DOIs
StatePublished - 1 Jan 1980

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'STOCHASTIC ALLOCATION PROBLEM.'. Together they form a unique fingerprint.

Cite this