The network flow problem involves finding the optimum route through a flow network; a directed graph where each arc has a capacity and each arc receives a flow. Typical examples include: evacuation plans and delivery services. The problem involves students analysing the plan of a school canteen and deciding whether, given relevant information, the school canteen can be evacuated in a given time.
Flows: presentation - an introduction to the problem outlining the student task and putting the task into context.
Flows: problem - a student version of the problem outlined in the introduction.
Flows: solution - one possible suggested solution for the problem.
The OR Society have developed these problems for use in Decision mathematics lessons. The problems can be used as an introduction to a topic, part of the learning process or as a plenary exercise.