Lecture 1 Flashcards
1
Q
What is Dynamic Programming (DP)?
A
2
Q
Of what elements doet a deterministic sequential decision problem with a finite horizon consist of?
A
3
Q
What is an optimal politicy?
A
4
Q
When can we use forward recursion too?
A
When we have deterministic decision problem.
5
Q
How to apply forward recursion?
A
6
Q
How to DP model a knapsack problem?
A
7
Q
How to DP model a shortest path problem?
A
8
Q
How to apply recursion without stages?
A
