An elimination condition to check the validity of the principle of optimality

DOI10.1016/0305-0548(95)00000-CMaRDI QIDQ2563890zbMATH OpenOpenAlexFDO

Authors Kyösti Tarvainen

Publication date 10 June 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(95)00000-c

zbMATH Keywords

dynamic programmingelimination conditionmultiobjective optimizationprinciple of optimality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Dynamic programming (90C39) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• scientific article; zbMATH DE number 1214990
• Reflections on Bellman's optimality principle
• A new look at Bellman's principle of optimality
• Reflections on optimality and dynamic programming
• scientific article; zbMATH DE number 503297

Cites work

• A new look at Bellman's principle of optimality
• Additional aspects of the Stackelberg strategy in nonzero-sum games
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Dynamic programming in multiplicative lattices
• Foundations of hierarchical control
• Further properties of nonzero-sum differential games
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 53073 (Why is no real title available?)
• Nonzero-sum differential games
• The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
• Theory and applications of generalized dynamic programming: An overview

This page was built for publication: An elimination condition to check the validity of the principle of optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563890)