3) MAXIMUM FLOW Problem (not Longest Oath )

Question 1

What’s changed this time frim longest path to max flow

Answer 1

Now it’s water going through, so it can’t flow BACKWARDS as a fact!

This time we are maximising the flow out of the SOURCE, thus the maximise command will be the routes OUT OF THE SOURCE, or the routes into the sink either is fine

Now the paths aren’t INDICATOR variables, they don’t represent 1 or 0, instead they represent flow or not

Question 2

So how to do
What to maximise
What cinstraints

What extra contradict

Answer 2

Maximise flow going out if source

Constraint = ignore start snd end because they only have one route

For each other vertex, the flow in - flow out = 0

And then a CONSTRAINT TO DEFINE EACH VARIABLES CAPACITY FOR EACH ONE

Question 3

How to interpret with results given

Answer 3

With each direction, mark the desired weights on each pipe

Finally say what the maximum flow wsd