Linear Programming: Shortest Path with Excel Solver (Network Flows Part 4)

Enjoyed this content & want to support my channel? You can get the spreadsheet I build in the video or buy me a coffee! Links below:
Buy me a coffee: www.buymeacoff...
Buy complete spreadsheet: www.buymeacoff...
Buy me an item from my wishlist: www.buymeacoff...
How to travel from one place to another in the shortest distance possible, or in the shortest amount of time possible? The Shortest Path problem is simply a special case of the Transshipment problem in which you ship yourself from a given supply node (your current location) to a given demand node (your destination) in a network. If you haven't watched my video on the Transshipment problem yet, do that first then come back to watch this one. Here it is: • Linear Programming: Tr... .

[@dhrubajyotidas7067]

Just a quick question. Why do we need to consider capacities in case of shortest path problem? How is capacity influencing my decision to choose the shortest path?

[@TallysYunes]

You don't. The capacity constraints that were inherited from the transshipment problem I used to illustrate the shortest path become redundant/harmless. Note that capacities are also optional in a transshipment problem. It just so happened that in the transshipment example I used, capacities were present.

[@dhrubajyotidas7067]

@@TallysYunes thanks!