Scribd
Upload
45 views4 pages

Network Programming

This document describes a maximal flow problem on a network with 7 nodes. It provides the flow capacities and current flows between each pair of nodes. The maximum total flow that can pass through the network is 55 units. It also shows the flow conservation constraints for each node to ensure flows are balanced.

Uploaded by

Divyank Jyoti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
45 views4 pages

Network Programming

This document describes a maximal flow problem on a network with 7 nodes. It provides the flow capacities and current flows between each pair of nodes. The maximum total flow that can pass through the network is 55 units. It also shows the flow conservation constraints for each node to ensure flows are balanced.

Uploaded by

Divyank Jyoti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

MAXIMAL FLOW PROBLEM

To Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7


From Baku A B C D E F
Node 1 Baku 0 20 15 20 0 0 0
Node 2 A 0 0 2 0 18 0 0
Node 3 B 0 0 0 0 6 13 0
Node 4 C 0 0 2 0 0 0 18
Node 5 D 0 0 0 0 0 10 0
Node 6 E 0 0 0 0 0 0 0
Node 7 F 0 0 0 0 0 0 0
Node 8 G 0 0 0 0 0 0 0
Node 9 H 0 0 0 0 0 0 0
Node 10 Adana 55 0 0 0 0 0 0
Total Flow To 55 20 19 20 24 23 18

MAXIMUM FLOW CAPACITIES


To Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7
From Baku A B C D E F
Node 1 Baku 0 20 15 22 0 0 0
Node 2 A 0 0 20 0 18 0 0
Node 3 B 0 10 0 0 20 13 0
Node 4 C 0 0 5 0 0 0 18
Node 5 D 0 0 0 0 0 10 0
Node 6 E 0 0 0 0 0 0 5
Node 7 F 0 0 0 0 0 0 0
Node 8 G 0 0 0 0 0 0 0
Node 9 H 0 0 0 0 0 0 0
Node 10 Adana 9999 0 0 0 0 0 0

Maximum Flow 55
FLOW PROBLEM
Node 8 Node 9 node 10 Flow Conservation Constraints
G H Adana Total Flow From Node Network F RHS
0 0 0 55 Baku 0 0
0 0 0 20 A 0 0
0 0 0 19 B 0 0
0 0 0 20 C 0 0
14 0 0 24 D 0 0
23 0 0 23 E 0 0
0 18 0 18 F 0 0
0 7 30 37 G 0 0
0 0 25 25 H 0 0
0 0 0 55 Adana 0 0
37 25 55

Node 8 Node 9 node 10


G H Adana
0 0 0
0 0 0
0 0 0
0 0 0
14 0 0
25 5 0
0 20 0
0 10 30
0 0 25
0 0 0
SHORTEST PATH PROBLEM
Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7
Chicago Indianapolis Green Bay South Bend Detroit Concinnati Cleveland
Node 1 Chicago 0 0 0 1 0 0 0
Node 2 Indianpolis 0 0 0 0 0 0 0
Node 3 Green Bay 0 0 0 0 0 0 0
Node 4 South Bend 0 0 0 0 0 0 1
Node 5 Detroit 0 0 0 0 0 0 0
Node 6 Cincinnati 0 0 0 0 0 0 0
Node 7 Cleveland 0 0 0 0 0 0 0
Total Flow Out 0 0 0 1 0 0 1

COST MATRIX
Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7
Chicago Indianapolis Green Bay South Bend Detroit Concinnati Cleveland
Node 1 Chicago 9999 180 300 100 9999 9999 9999
Node 2 Indianpolis 180 9999 9999 145 9999 120 9999
Node 3 Green Bay 200 9999 9999 300 450 9999 9999
Node 4 South Bend 100 145 300 9999 215 240 250
Node 5 Detroit 9999 9999 450 215 9999 9999 160
Node 6 Cincinnati 9999 120 9999 240 9999 9999 225
Node 7 Cleveland 9999 9999 9999 250 160 225 9999

Total Cost 350


OBLEM
Flow Conservation Constraints
Total Flow In Node Network Flow RHS
1 1 1 1
0 2 0 0
0 3 0 0
1 4 0 0
0 5 0 0
0 6 0 0
0 7 1 1

You might also like