15. Maxflow problem | Optimization using Excel

This is the 15th video of the lecture series Optimization using Excel. Here we have discussed how to formulate and solve a maximum flow (Maxflow) network problem. The objective is to maximize the total flow from the source to the destination node given the capacity constraints of the different routes of the network. Both algebraic formulation and Excel solver setup have been explained in the video.
Complete module:
1 Introduction: • 1.Introduction | Optim...
2. Introduction to LP: • 2.Introduction to LP |...
3. Graphical method to solve an LP: • 3.Graphical method an ...
4. Introduction to Solver: • 4.Introduction to Solv...
5. Product mix problem: • 5.Solving a Product Mi...
6. Sensitivity analysis: • 6.Sensitvity and Answe...
7. Integer programming: • 7.Integer programming ...
8. Transportation problem: • 8.Transportation probl...
9. Transshipment problem: • 9.Transshipment Proble...
10. Assignment problem: • 10.Assignment Problem ...
11. Set covering problem: • 10.Assignment Problem ...
12. Blending: • 12.Blending or Diet pr...
13. Network flow introduction: • 13.Network flow models...
14. Shortest path problems: • 14. Shortest Path Prob...
15. Maxflow problem: • 15. Maxflow problem | ...
16. Minimum Spanning Tree problem (Kruskal’s): • 16. Minimum Spanning T...
17. Minimum Spanning Tree problem (Prim’s): • 17. How to solve the M...
18. Travelling Salesman Problem (ILP): • 18. Travelling Salesma...
19. Introduction to NLP: • 19. Introduction to No...
20. Use of GRG solver: • 20. Solving a non-line...
21. Job sequencing model using Evolutionary solver: • 21. A Job Sequencing p...
22. Travelling Salesman Problem using NLP: • 22. Travelling Salesma...
Max Flow Problem Introduction
Ford-Fulkerson Algorithm for Maximum Flow Problem
What is maximum flow problem?
The maximum flow problem involves finding a feasible flow between a source and a sink in a network that is maximum and not minimum
What is maximum flow in algorithm?
Defined as the maximum amount of flow that the network would allow to flow from source to sink
What is the goal objective of a maximum flow problem?
In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges.