| Article ID: | iaor200973435 |
| Volume: | 172 |
| Issue: | 1 |
| Start Page Number: | 203 |
| End Page Number: | 219 |
| Publication Date: | Nov 2009 |
| Journal: | Annals of Operations Research |
| Authors: | Sitarz Sebastian |
| Keywords: | pareto-optimality |
The aim of the paper is to show the relations between dynamic programming (DP) and the Pareto optimal allocations (PAO) problem. Moreover, the paper shows how to use DP methods in order to find the Pareto optimal allocations at a particular point in time.