Network Optimizatiom Problems Problem: Distribution of unlim

Money cosst (least amount o

From To Ship Capacity Unit Cost Nodes Net Flow

F1 W1 30 <= 700 F1 80 =
F1 DC 50 <= 50 300 F2 70 =
DC W1 30 <= 50 200 DC 0=
DC W2 50 <= 50 400 W1 -60 =
F2 DC 30 <= 50 500 W2 -90 =
F2 W2 40 <= 1000

Total Cost 117000

oblem: Distribution of unlimited factory
oney cosst (least amount of cost) 80 F1 ---> 60 W1
DC (transhipment
note) F1 and F2 is Supply
W1 and W2 is
70 F2 ---> 90 W2 Demand
Supply / Demand
Tranpostation
80
70
0
-60
-90
FROM TO SHIP CAPACITY NODES
Stuttgart Rotterdam 50 <= 50 Stuttgart
Stuttgart Bordeaux 70 <= 70 Rotterdam
Stuttgart Lisbon 30 <= 40 Bordeaux
Rotterdam New York 50 <= 60 Lisbon
Bordeaux New York 30 <= 40 New York
Bordeaux New Orleans 40 <= 50 New Orleans
Lisbon New Orleans 30 <= 30 Los Angeles
New York Los Angeles 80 <= 80
New Orleans Los Angeles 70 <= 70
.+3 emg 030424

Maximum Flo 150

NET FLOW SUPPLY/DEMAND
150
0= 0
0= 0
0= 0
0= 0
0= 0
-150
FROM TO SHIP CAPACITY NODES
Fire St. A 1 3 Fire St.
Fire St. B 0 6 A
Fire St. C 0 4 B
A B 1 1 C
A D 0 6 D
B A 0 1 E
B C 0 2 F
B D 0 4 G
B E 1 5 H
C B 0 2 Fam Com.
C E 0 7
D E 0 3
D F 0 8
E D 0 3 .+3 EMG .3.424
E F 1 6
E G 0 5
E H 0 4
F G 0 3
F Fam Com. 1 4
G F 0 3
G H 0 2
G Fam Com. 0 6
H G 0 2
H Fam Com. 0 7

TOTAL DISTANCE 19
 NET FLOW SUPPLY/DEMAND
1= 1
0= 0
0= 0
0= 0
0= 0
0= 0
0= 0
0= 0
0= 0
-1 = -1

EMG .3.424