Abstract

The theory of flows in networks began to evolve in the early 1950's.The various linear optimisation questions that could be asked of flows in conserving networks turned out to be neat combinatorial specialisations of linear programming. The simplex method (and its variants) turned out to have very pretty combinatorial interpretations on networks. The algebraic dexterity of linear programming duality led to a unified treatment of many deep theorems in graph theory and combinatorics. In this part, the last of the series on linear programming, we will see glimpses of the theory of network flows through a specific flow optimisation problem - the maximum flow problem.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.