An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">ID</td><td class="align_center">Number of awardees</td><td class="align_center">Amount of scholarship</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">1</td><td class="align_center">2</td><td class="align_center">8000</td></tr><tr><td class="align_left">2</td><td class="align_center">3</td><td class="align_center">5000</td></tr><tr><td class="align_left">3</td><td class="align_center">1</td><td class="align_center">10000</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Discrete Dynamics in Nature and Society

tab1

Table 1

Table 1: An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment 