Week 16 and 17

The shortest path problem was lectured by ?yvind R, and he showed algorithms for solving this problem, and examples. It can be viewed as a special case of networks flows, but Dijkstra's or Bellman's algorithms are simpler and faster. Then, I started on the final topic of this course, convexity. Here we use the notes I wrote, see syllabus and resources on this page. Convexity gives a mathematical foundation of optimization, so there are important concepts and results, and we look at some of these (3 weeks).?