About the last lecture

On tuesday we went through the primal and dual simplex method applied to network problems, and thus almost finished the chapter V14 (which I encourage everyone to read, together with Geir Dahls lecture notes). The next lecture will be the final ordinary lecture. We will finish section V14 and discuss some applications of network LPs, such as the famous Dijkstra algorithm.