Network flow analysis
This is Julian Hall‘s whiteboard. Julian works in the area of optimization, and he is trying to figure out better ways to implement the simplex method to solve very large linear programming problems. Network flow problems are special cases of linear programming problems; for example, how a company should organise deliveries from various warehouses to various shops, or how a company should organise its workforce to complete a set of activities most efficiently. On the board here, these network problems are being analysed to understand why the simplex method sometimes runs much faster when the objective costs of a linear programming problem are perturbed randomly.
If you have access to a black or white board of interesting mathematics, please take a photo and send it to me (along with a short description) at Julia.Collins@ed.ac.uk!