Routing (Leaving Cert Applied Maths): Flashcards

Optimisation challenges to find the best path through a network

Maximise benefits or minimise costs over time

Backward approach - start at final stage, work to beginning

Time periods or decision points; numbered by time remaining

Possible positions/locations at each stage

Decisions/moves you can make from each state

Where each action leads; your new state in next stage

Calculated benefit/cost of action (immediate + future)

$\text{Value} = \text{Profit} - \text{Travel} + \text{OVD}$

Optimum Value from Destination

Zero (no future stages to consider)

Ensures optimal decisions by knowing exact future benefits

Use asterisks (*) to identify best choices at each stage

Timing constraints, benefit calculations, cost analysis