Pareto optimal allocations and dynamic programming

Sebastian Sitarz ()

Annals of Operations Research, 2009, vol. 172, issue 1, 203-219

Abstract: 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. Copyright Springer Science+Business Media, LLC 2009

Keywords: Dynamic programming; Pareto optimal allocations; Ordered structures (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0558-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:172:y:2009:i:1:p:203-219:10.1007/s10479-009-0558-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0558-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().