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

DOI10.1016/0305-0548(95)00000-CzbMath0863.90133OpenAlexW1988577276MaRDI QIDQ2563890

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 programmingmultiobjective optimizationprinciple of optimalityelimination condition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A new look at Bellman's principle of optimality
• Theory and applications of generalized dynamic programming: An overview
• Dynamic programming in multiplicative lattices
• Nonzero-sum differential games
• Further properties of nonzero-sum differential games
• Additional aspects of the Stackelberg strategy in nonzero-sum games
• The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
• Foundations of hierarchical control
• Contraction Mappings in the Theory Underlying Dynamic Programming

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