NOTES ON THE THEORY OF DYNAMIC PROGRAMMING, 5. MAXIMIZATION OVER DISCRETE SETS

Abstract

The theory of dynamic programming is applied to a class of problems involving maximization over discrete sets. The solution is made to depend on the solution of a class of functional equations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 12, 1955
Accession Number
AD0604931

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Cargo
  • Cargo Handling
  • Computer Programming
  • Dynamic Programming
  • Equations
  • Integrals
  • Linear Programming
  • Mathematics
  • Sensitivity
  • Sequences
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Neural Network Machine Learning.