ON THE K-TH BEST POLICIES

Abstract

It is shown how the functional equation technique of dynamic programming can be used to determine the optimal, second best, third best, etc., policies for various deterministic and stochastic multistage decision processes. This is of importance in various problems in combinatorial analysis, network and switching theory, feedback control, and sensitivity analysis. A routing problem is discussed in some detail.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 26, 1960
Accession Number
AD0606938

Entities

People

  • Richard E. Bellman
  • Robert E. Kalaba

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Corporations
  • Dynamic Programming
  • Engineering
  • Equations
  • Hard Copy
  • Mathematical Models
  • Microfiche
  • Models
  • Probability
  • Sensitivity
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Control Systems Engineering.
  • Mathematical Modeling and Probability Theory.