A NOTE ON MARKOV-RENEWAL PROGRAMMING

Abstract

Various models of Markov-renewal programming were presented in a previous work. Related models have been presented independently by de Cani, Howard, and Schweitzer. Since that time, new results have been obtained which clarify certain questions raised in these papers. Since these results are either 'in the folklore,' or are available only in scattered unpublished reports, it seemed worthwhile to gather them together in one article. This article considers only the finite-state, finite alternative space, infinite- horizon, undiscounted and discounted models previously discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1966
Accession Number
AD0645712

Entities

People

  • William S. Jewell

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computations
  • Computer Programming
  • Dynamic Programming
  • Engineering
  • Heuristic Methods
  • Linear Programming
  • Markov Chains
  • Military Research
  • Operations Research
  • Probability
  • Simplex Method
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Educational Psychology
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space