Network flow
| Linear Programming | |
|---|---|
 | |
| MATH340 | |
| Section: | 921 |
| Instructor: | Tali Pinksky |
| Email: | tali@math.ubc.ca |
| Office: | Math 229a |
| Office Hours: | Wed 1-2 pm or by appointment |
| Class Schedule: | Tue-Thu-Fri 2-4 pm, Wed 2-3 pm |
| Classroom: | Math Annex 1100 |
| Important Course Pages | |
| Resources | |
| Assignments | |
| Discussion | |
| Projects | |
A network flow is a problem of finding an optimal flow or path on a directed graph.
This is probably the most useful application of linear programming, and is part III of the textbook. after understanding the general framework you can choose to explain a specific application such as telecommunication networks, traffic, water supply, max-flow min-cut, single source shortest path, or choose one out of the many more applications.
After showing how to convert a toy example in your application of choice to into a linear programming problem, you might choose to solve (using a software package) a larger example, or present one of the specialised algorithms for network flows such as the one presented in chapter 19 of the textbook, or this one computing the maximal flow.
Teams
Group: Yiran Chen, Taeyun Kim, Michael Lam
Group 2: Haipeng Chen, Kenneth Sham, Minyi Jin, Jiahao Ding, Maureen Qi Zhang