Scribd
Upload
38 views4 pages

Maximal Flow Problem: Constraints

The document describes a maximal flow problem involving flows between 6 nodes. It specifies the constraints for each node in terms of flows into and out of the node. It also lists the decision variables and objective function to maximize total flow. The optimal solution provided achieves a maximal flow of 500 with non-zero flows on several paths that satisfy all the constraints.

Uploaded by

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

Maximal Flow Problem: Constraints

The document describes a maximal flow problem involving flows between 6 nodes. It specifies the constraints for each node in terms of flows into and out of the node. It also lists the decision variables and objective function to maximize total flow. The optimal solution provided achieves a maximal flow of 500 with non-zero flows on several paths that satisfy all the constraints.

Uploaded by

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

Maximal Flow Problem

X12 X13 X14 X21 X24 X26 X34 X35 X42 X43 X46
cars flowing
through path

Constraints:
Node 1 -1 -1 -1 1
Node 2 1 -1 -1 -1 1
Node 3 1 -1 -1 1
Node 4 1 1 1 -1 -1 -1
Node 5 1
Node 6 1 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs
max flow on arcs
max flow on arcs
max flow on arcs
max flow on arcs

Decision variables
Objective function
Left-hand-side of constraints

LHS Left-hand-side
RHS Right-hand-side
X53 X56 X62 X64 X61

1 0.00 <-- Objective

1 0.0 = 0
1 0.0 = 0
1 0.0 = 0
0.0 = 0
-1 -1 0.0 = 0
1 -1 -1 -1 0.0 = 0
0.0 < 300
0.0 < 1000
0.0 < 200
0.0 < 100
0.0 < 100
0.0 < 200
0.0 < 300
0.0 < 200
0.0 < 100
0.0 < 100
0.0 < 100
1 0.0 < 100
1 0.0 < 600
1 0.0 < 200
1 0.0 < 100
1 0.0 < 1E+05
LHS Sign RHS
Maximal Flow Problem

X12 X13 X14 X21 X24 X26 X34 X35 X42 X43 X46
cars flowing
through path 200.0 200.0 100.0 0.0 0.0 200.0 0.0 200.0 0.0 0.0 100.0

Constraints:
Node 1 -1 -1 -1 1
Node 2 1 -1 -1 -1 1
Node 3 1 -1 -1 1
Node 4 1 1 1 -1 -1 -1
Node 5 1
Node 6 1 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs 1
max flow on arcs
max flow on arcs
max flow on arcs
max flow on arcs
max flow on arcs

Decision variables
Objective function
Left-hand-side of constraints

LHS Left-hand-side
RHS Right-hand-side
X53 X56 X62 X64 X61

0.0 200.0 0.0 0.0 500.0


500.00 <-- Objective

1 0.0 = 0
1 0.0 = 0
1 0.0 = 0
0.0 = 0
-1 -1 0.0 = 0
1 -1 -1 -1 0.0 = 0
200.0 < 300
200.0 < 1000
100.0 < 200
0.0 < 100
0.0 < 100
200.0 < 200
0.0 < 300
200.0 < 200
0.0 < 100
0.0 < 100
100.0 < 100
1 0.0 < 100
1 200.0 < 600
1 0.0 < 200
1 0.0 < 100
1 500.0 < 1E+05
LHS Sign RHS

You might also like