Network flow programming: models and applications
Course duration: 4 h
The term network flow program describes a class of linear programming models that can be modelled in terms of nodes and arcs that connect them. Network flow models provide a rich modelling framework that can be used effectively in a verity of contexts. Their special structure allows them to be solved more efficiently than general linear programs
We will start by introducing the necessary basics of graph theory. We will then discuss the modelling aspects of classic network flow models, including the minimum cost flow problem, the transportation problem, the assignment problem, the shortest path problem and the maximum flow problem.
Dr. Dmytro Matsypura
Place of employment: The University of Sydney
Spheres of researches: mathematical modeling and combinatorial optimization methods with applications to risk management problems in the investment industry and complex decision-making on global supply chain network system.