Bellman's Principle (Leaving Cert Applied Maths): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What does Bellman's Principle state about optimal paths?
What does Bellman's Principle state about optimal paths?
Optimal paths are made of optimal sub-paths
What are multi-stage networks particularly useful for solving?
What are multi-stage networks particularly useful for solving?
Sequential decision problems
How are stages numbered in multi-stage networks?
How are stages numbered in multi-stage networks?
In reverse order from destination
Why do we use backward induction in multi-stage networks?
Why do we use backward induction in multi-stage networks?
To know optimal values for future stages
How many columns are in the dynamic programming table structure?
How many columns are in the dynamic programming table structure?
Four main columns
In the dynamic programming table, what does the 'State' column represent?
In the dynamic programming table, what does the 'State' column represent?
The node or position currently at
What does the 'Value' column in the table represent?
What does the 'Value' column in the table represent?
Optimal value from state to destination
For terminal stage nodes, how is the value calculated?
For terminal stage nodes, how is the value calculated?
Simply the edge weight to T
How is value calculated for intermediate stage nodes?
How is value calculated for intermediate stage nodes?
Edge weight plus optimal value from next
What direction should you work when solving multi-stage networks?
What direction should you work when solving multi-stage networks?
Backwards from destination
What determines the first step of your optimal path?
What determines the first step of your optimal path?
Optimal action at source stage
What could 'optimal' mean depending on the question context?
What could 'optimal' mean depending on the question context?
Longest, shortest, max profit, min cost