A LIMIT THEOREM FOR SUBADDITIVE COLLECTIONS OF SEQUENCES,

Abstract

Information is presented about the asymptotic behavior of collections of sequences related by a certain inequality. These results generalize a well-known theorem on the asymptotic behavior of a subadditive sequence. The results have applications to dynamic programming, where sequences satisfying our inequality arise in a natural way. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1965
Accession Number
AD0624807

Entities

People

  • Jon Folkman

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Dynamic Programming
  • Inequalities
  • Mathematics
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Plasma Physics / Magnetohydrodynamics