Bellman’s Dynamic Programming
GPTKB entity
Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Mathematical Optimization Method
|
| gptkbp:appliesTo |
Computer Science
Economics Control System Operations Research |
| gptkbp:developedBy |
gptkb:Richard_Bellman
|
| gptkbp:hasConcept |
Optimal Substructure
Overlapping Subproblems Principle of Optimality |
| https://www.w3.org/2000/01/rdf-schema#label |
Bellman’s Dynamic Programming
|
| gptkbp:introducedIn |
1950s
|
| gptkbp:relatedTo |
Divide and Conquer
Greedy Algorithms Memoization Bellman Equation Dynamic Table Construction Edit Distance Algorithms Fibonacci Sequence Computation Policy Iteration Recursive Algorithms Sequence Alignment State Space Representation Value Iteration |
| gptkbp:solvedBy |
gptkb:Markov_Decision_Processes
gptkb:Knapsack_Problem Inventory Management Problems Resource Allocation Problems Shortest Path Problems |
| gptkbp:usedFor |
Breaking Problems into Subproblems
Solving Optimization Problems |
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
|
| gptkbp:bfsLayer |
7
|