A new look at Bellman's principle of optimality

DOI10.1007/BF00939252zbMath0569.49020OpenAlexW2045094735MaRDI QIDQ1060687

Moshe Sniedovich

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939252

zbMATH Keywords

dynamic programmingBellman's principle of optimality

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Related Items (8)

Categories, relations and dynamic programming ⋮ C-programming: A nonlinear parametric optimization method ⋮ A hybrid method for solving nonlinear knapsack problems ⋮ Near-grazing bifurcations and deep reinforcement learning control of an impact oscillator with elastic constraints ⋮ A framework for optimization under limited information ⋮ An elimination condition to check the validity of the principle of optimality ⋮ Monotonicity and the principle of optimality ⋮ On a negative-equivalency theorem in associative optimal path problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonicity and the principle of optimality
• Composition Principles for Synthesis of Optimal Multistage Processes
• Scheduling to Minimize Interaction Cost
• The theory of dynamic programming
• Some Problems in the Theory of Dynamic Programming

This page was built for publication: A new look at Bellman's principle of optimality