Countable State Average Cost Regenerative Stopping Problems.

Abstract

Regenerative stopping problems are stopping problems which recommence from the initial state upon stopping. An algorithm is presented which solves a semi-Markov regenerative stopping problem with a finite number of continue actions by solving a sequence of stopping problems. New results for the optimal stopping problem are obtained as well as for the regenerative stopping problem. Two models in the literature are used as detailed examples of the algorithm. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1979
Accession Number
ADA078509

Entities

People

  • Bruce L. Miller

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Distribution Functions
  • Equations
  • Inequalities
  • Inspection
  • Maintenance
  • Mathematics
  • Military Research
  • New York
  • Operations Research
  • Probability
  • Random Variables
  • Sequences
  • Stability Conditions
  • Transistors
  • Transitions

Readers

  • Mathematical Modeling and Probability Theory.