Non-negative matrices, dynamic programming and a harvesting problem

1 December 1984

journal article
Published by Cambridge University Press (CUP) in Journal of Applied Probability

Vol. 21 (4) , 685-694
https://doi.org/10.2307/3213687

Abstract

Existing results on the asymptotic behaviour of solutions to two dynamic programming equations involving non-negative matrices are reviewed and strengthened in certain directions. The results are then applied to strategies for harvesting of a small population so as to optimise its survival potential in a limited environment.

Keywords

This publication has 5 references indexed in Scilit:

Growth Optimality for Branching Markov Decision Chains
Mathematics of Operations Research, 1982
On sets of countable non-negative matrices and Markov decision processes
Advances in Applied Probability, 1978
Natural selection of life history attributes: An analytical approach
Theoretical Population Biology, 1974
THE THEORY OF NON-NEGATIVE MATRICES IN A DYNAMIC PROGRAMMING PROBLEM
Australian Journal of Statistics, 1969
On a Quasi-Linear Equation
Canadian Journal of Mathematics, 1956