Cover: A limit theorem for subadditive collections of sequences

A limit theorem for subadditive collections of sequences

Published 1965

by Jon H. Folkman

Purchase Print Copy

 Format Price
Add to Cart Paperback14 pages $20.00

A presentation of information 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. 14 pp.

This report is part of the RAND research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.