In this paper, concepts of dynamic programming are used within a discrete time Markovian model for the development of a graded population. Optimal recruitment and transition patterns are determined by minimizing expected discrepancies between actual states and preferred goals.
No takes yet. Share an insight, caveat, or question.
Alexander Mehlmann (1980) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: