MULTICHAIN MARKOV RENEWAL PROGRAMS,

Abstract

Two methods are presented for computing optimal decision sequences and their cost functions. The first method, called 'policy iteration,' is an adaption of an iterative scheme that is widely used for sequential decision problems. The second method is to specify a linear programming problem whose solution determines an optimal policy and its cost function. A third solution technique is shown to apply to certain, but not all, of these Markov renewal programs. As a byproduct of the development, new techniques are provided for solving a broad class of shortest-route problems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1967
Accession Number
AD0648000

Entities

People

  • B. L. Fox
  • E. V. Denardo

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Interdisciplinary Science
  • Iterations
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Numerical Analysis
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research
  • Systems Analysis and Design