PRINCIPLE OF OPTIMALITY IN DYNAMIC PROGRAMMING WITH RETURNS IN PARTIALLY ORDERED SETS.

Research output: Contribution to journalArticlepeer-review

Abstract

A general sequential model is defined where returns are in a partially ordered set. A distinction is made between maximal (nondominated) returns and greatest returns. We show that Bellman's principle of optimality is valid with respect to maximal returns and it leads to an algorithm to approximate these returns. We argue that significantly greater effort is needed to apply this algorithm to maximal returns than to greatest returns.

Original languageEnglish
Pages (from-to)462-470
Number of pages9
JournalMathematics of Operations Research
Volume10
Issue number3
DOIs
StatePublished - 1985
Externally publishedYes

Fingerprint

Dive into the research topics of 'PRINCIPLE OF OPTIMALITY IN DYNAMIC PROGRAMMING WITH RETURNS IN PARTIALLY ORDERED SETS.'. Together they form a unique fingerprint.

Cite this