Академический Документы
Профессиональный Документы
Культура Документы
Chapter 5 Examples
Operations Research Models and Methods
Paul A. Jensen and Jonathan F. Bard
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/mp_add/index.html
Instructions
To use this workbook, you must first load the Math Programming add-in. See the Excel help file
topic "About add-ins" before continuing.
For cases using the Jensen Network Solver you must first load the Jensen Network Solver.
This workbook comes without control buttons. To make the buttons choose Add Buttons from
the Math Programming menu. This adds buttons to all the worksheets.
When you are moving a workbook to another computer, use the Remove Buttons command.
This simplifies opening the workbook on the other computer. Buttons are removed from all
worksheets.
Page 1
Instructions
Page 2
Instructions
Add-ins Used
Math Programming - Transportation/Network Solver
Math Programming - Transportation/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Page 3
Instructions
Page 4
Trans1
[external flow]
(cost)
Assign
[extern
MaxFlow
[external flow]
(cost)
(30, 8) (14)
S1
(5)
(2) (5
(50,10)
S2
(6)
(1
(9)
(10)
(30, 9) (15)
S1
(6)
(3) (6
(50, 9)
S2
(7)
(1
(10)
TransShip_T
[external flow]
(cost)
Eco_Life
Dist1 [Externalflow]
(cost)
lower=0,upper=200
[700] [20
(6) 2
1 1
(7) 6 (4)
(3) (3) 4
2 3
(5)
3 4
(cost)
lower=0,upper=200
[700] [20
(6) 2
1 1
(7) 6 (4)
(3) (3) 4
2 3
(5)
3 4
5
[200] [300]
13 (2)
(7)
12
7
[200
J1 J2 J3 J4 J5
M1 M 8 6 12 1
M2 15 12 7 M 10
M3 10 M 5 14 M
[external flow]
M4 12 M 12 16 15
M5 18 17 14 M 13
(5) (3)
O B [external flow]
[-1] [-1] [-1] (cost)
3) (2) (1)
(5) (3)
O B [external flow]
[-1] [-1] [-1] (cost)
3) (2) (1)
(4) (3)
M P
[-1] [-1] [-1]
1) (2) (4)
(3) (2)
J N
[-1] [-1] [-1]
7) (5) (4)
(3) (4)
G K
[-1] [-1] [-1]
Cost = 1
st)
(9)
[-15]
(14)
1 D2
(5)
2 D3
(6)
(12)
(1)
(9) [-15]
D4
[-20]
D1 (1)
(10)
[-20]
(15)
1 D2
(1)
(6)
(3) (6) [-20]
2 D3
(7) (1)
(13)
(10)
[-20]
D4
[external flow]
(flow)
S1 T1 D1
(5)
[200] [250]
(6) 2 6
1
(4) (6)
(7) 6 (4) 11 7 (5)
(3) 4 9
3
(5) (2)
4 8 10 5 [150] 17 (7)
[200] [250]
(6) 2 6
1
(4) (6)
(7) 6 (4)
(3) 11 7 (5)
4 9
3
(5) (2)
4 8 10 5 [150] 17 (7)
5
[300] (2)
(4)
16
13 (2) (5)
(7) (6)
14
12
15 8 [200]
7
[200]
Transportation Model Name: Trans1 Objective Term Solver: Jensen Network
1 Type: Trans Ship. Cost: 46 Type: Linear
0 Change Goal: Min Sup. Cost: 0 Sens.: No
1 Objective: 46 Dem. Rev.: 0 nteger: No
0 Solve Side: No
0
100 Vary
100
0 1 2 3 Supply Data
60 Name D1 D2 D3 Min. Max. Cost Shipped
0 1 S1 2 3 0 5 5 0 5
0 2 S2 5 0 2 7 7 0 7
0 3 S3 0 0 3 3 3 0 3
Demand Min.: 7 3 5
Data Max: 7 3 5
Revenue: 0 0 0
Received: 7 3 5
Trans. Costs 1 2 3
Name D1 D2 D3
1 S1 3 1 1000
2 S2 4 2 4
3 S3 1000 3 3
en Network
Transportation Model Name: Assign Objective Term Solver: Jensen Network
1 Type: Trans Ship. Cost: 51 Type: Linear
0 Change Goal: Min Sup. Cost: 0 Sens.: No
1 Objective: 51 Dem. Rev.: 0 nteger: No
0 Solve Side: No
0
100 Vary
100
0 Trans. Flows 1 2 3 4 5 Supply Data
60 Name J1 J2 J3 J4 J5 Min. Max. Cost Shipped
0 1 M1 0 0 0 0 1 1 1 0 1
0 2 M2 0 0 1 0 0 1 1 0 1
0 3 M3 1 0 0 0 0 1 1 0 1
4 M4 0 0 0 1 0 1 1 0 1
5 M5 0 1 0 0 0 1 1 0 1
Demand Min.: 1 1 1 1 1
Data Max: 1 1 1 1 1
Revenue: 0 0 0 0 0
Received: 1 1 1 1 1
Trans. Costs 1 2 3 4 5
Name J1 J2 J3 J4 J5
1 M1 1000 8 6 12 1
2 M2 15 12 7 1000 10
3 M3 10 1000 5 14 1000
4 M4 12 1000 12 16 15
5 M5 18 17 14 1000 13
en Network Ph. 1 Iter. 17
Total Iter. 25
Comp. Time 00:01
Status Optimal
Shipped
Network Model Name: SPT Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 111 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance Constraints
60 Num. Name Flow Origin Term. Cost Num. Name Fixed
0 1 A-D 9 1 4 0 1 A 15
0 2 A-C 6 1 3 1 2 B -1
0 3 D-G 8 4 7 3 3 C -1
4 D-F 0 4 6 7 4 D -1
5 G-K 1 7 11 4 5 E -1
6 G-J 6 7 10 5 6 F -1
7 K-N 0 11 14 4 7 G -1
8 C-F 2 3 6 4 8 H -1
9 C-E 3 3 5 5 9 I -1
10 F-J 0 6 10 3 10 J -1
11 F-I 1 6 9 1 11 K -1
12 J-N 1 10 14 2 12 L -1
13 J-M 4 10 13 2 13 M -1
14 N-P 0 14 16 4 14 N -1
15 E-I 0 5 9 1 15 O -1
16 E-H 2 5 8 2 16 P -1
17 I-M 0 9 13 4
18 I-L 0 9 12 3
19 M-P 2 13 16 3
20 M-O 1 13 15 2
21 P-B 1 16 2 1
22 H-L 1 8 12 0
23 L-O 0 12 15 5
24 O-B 0 15 2 3
en Network Ph. 1 Iter. 17
Total Iter. 21
Comp. Time 00:01
Status Optimal
Dual Values
de Data and Balance Cons 0
Fixed Balance 0
0 0 1
0 0 0
0 0 0
0 0 1
0 0 1
0 0 1
0 0
0 0
Transportation Model Name: Trans2 Objective Term Solver: Jensen Network
1 Type: Trans Ship. Cost: 140 Type: Linear
0 Change Goal: Min Sup. Cost: 180 Sens.: No
1 Objective: 620 Dem. Rev.: 300 nteger: No
0 Solve Side: No
0
100 Vary
100
0 Trans. Flows 1 2 3 4 Supply Data
60 Name D1 D2 D3 D4 Min. Max. Cost Shipped
0 1 S1 0 0 5 5 10 25 8 10
0 2 S2 5 5 0 0 10 25 10 10
0 Demand Min.: 5 5 5 5
Data Max: 15 15 15 15
Revenue: 12 14 16 18
Received: 5 5 5 5
Trans. Costs 1 2 3 4
Name D1 D2 D3 D4
1 S1 10 15 6 13
2 S2 3 6 7 10
en Network Ph. 1 Iter. 9
Total Iter. 15
Comp. Time 00:00
Status Optimal
Network Model Name: Trans2_Net Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 115 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance Constr
60 Num. Name Flow Origin Term. Upper Cost Num. Name
0 1 S1 5 0 1 15 8 1 S1
0 2 S2 5 0 2 15 10 2 S2
0 3 S1-D1 0 1 3 ### 10 3 D1
4 S1-D2 0 1 4 ### 15 4 D2
5 S1-D3 15 1 5 ### 6 5 D3
6 S1-D4 0 1 6 ### 13 6 D4
7 S2-D1 5 2 3 ### 3
8 S2-D2 5 2 4 ### 6
9 S2-D3 0 2 5 ### 7
10 S2-D4 5 2 6 ### 10 Note that the network model doe
11 D1 0 3 0 10 -12 external flows. To compare the co
12 D2 0 4 0 10 -14 do the calculation above.
13 D3 10 5 0 10 -16
14 D4 0 6 0 10 -18
en Network Ph. 1 Iter. 9
Total Iter. 16
Comp. Time 00:00
Status Optimal
Trans. Costs 1 2 3 4 5 6
Name D1 D2 D3 T1 T2 T3
1 S1 1000 1000 1000 6 3 1000
2 S2 1000 1000 1000 3 1 4
3 S3 1000 1000 1000 1000 6 4
4 T1 3 2 1000 0 1000 1000
5 T2 4 6 5 1000 0 1000
6 T3 1000 3 5 1000 1000 0
en Network Ph. 1 Iter. 17
Total Iter. 30
Comp. Time 00:00
Status Optimal
Shipped
5
7
3
15
17
19
Network Model Name:TransFlow Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 894.8 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows
60 Num. Name Flow Origin Term. Upper Cost Gain Flow_O
0 1 P1 25 0 1 25 10 1 25
0 2 P2 25 0 2 25 12 1 25
0 3 P3 25 0 3 25 9 1 25
4 P4 9.219 0 4 25 13 1 9.219
5 P1-A 5 1 5 ### 0 2 10
6 P1-B 20 1 6 ### 0 2.143 42.86
7 P2-A 25 2 5 ### 0 2.4 60
8 P2-C 0 2 7 ### 0 2 0
9 P3-B 5 3 6 ### 0 2.4 12
10 P3-C 20 3 7 ### 0 2 40
11 P4-B 9.219 4 6 ### 0 2.727 25.14
12 P4-C 0 4 7 ### 0 2.069 0
Plant
1 2 3 4 Demand
A 30 25 70
Product B 28 25 22 80
C 30 30 29 40
en Network Ph. 1 Iter. 14
Total Iter. 14
Comp. Time 00:00
Status Optimal
1.03960396
1.43564356
1.7029703
0.66039604
0.94059406
1.3960396
1.62376238
0.63366337
0.68316832
0.7029703
1.12871287
0.47524752
0.57425743
0.6039604
0.87128713
0.38613861
1.48514851
1.54455446
2.05940594
2.53465347
Jensen Network Ph. 1 Iter. 11
Total Iter. 13
Comp. Time 00:01
Status Optimal
7 8 9 10
X7 X8 X9 X 10
2.273 0 0 0
-1 -1 -1 -1
0 0 0 0
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
Network Model Name: dist_1 Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 5300 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance Constr
60 Num. Name Flow Origin Term. Upper Cost Num. Name
0 1 Phoe-Chi 200 1 2 200 6 1 Phoe
0 2 Phoe-LA 200 1 3 200 3 2 Chi
0 3 Phoe-Dal 200 1 4 200 3 3 LA
4 Phoe-Atl 100 1 5 200 7 4 Dal
5 Dal-LA 0 4 3 200 5 5 Atl
6 Dal-Chi 0 4 2 200 4 6 NY
7 Dal-NY 50 4 6 200 6 7 Aus
8 Dal-Atl 50 4 5 200 2 8 Gain
9 Atl-NY 0 5 6 200 5
10 Atl-Dal 0 5 4 200 2
11 Atl-Chi 0 5 2 200 4
12 Aus-LA 0 7 3 200 7
13 Aus-Dal 200 7 4 200 2
14 Aus-Atl 0 7 5 200 5
15 Gain-Dal 0 8 4 200 6
16 Gain-Atl 0 8 5 200 4
17 Gain-NY 200 8 6 200 7
en Network Ph. 1 Iter. 13
Total Iter. 15
Comp. Time 00:00
Status Optimal
Constraint
Network Model Name: dist_5 Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: -1500 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance Constr
60 Num. Name Flow Origin Term. Upper Cost Num. Name
0 1 Phoe-Chi 200 1 2 200 6 1 Phoe
0 2 Phoe-LA 200 1 3 200 3 2 Chi
0 3 Phoe-Dal 200 1 4 200 3 3 LA
4 Phoe-Atl 100 1 5 200 7 4 Dal
5 Dal-LA 0 4 3 200 5 5 Atl_in
6 Dal-Chi 0 4 2 200 4 6 NY
7 Dal-NY 0 4 6 200 6 7 Aus
8 Dal-Atl 0 4 5 200 2 8 Gain
9 Atl-NY 0 9 6 200 5 9 Atl_out
10 Atl-Dal 0 9 4 200 2
11 Atl-Chi 0 9 2 200 4
12 Aus-LA 0 7 3 200 7
13 Aus-Dal 200 7 4 200 2
14 Aus-Atl 0 7 5 200 5
15 Gain-Dal 0 8 4 200 6
16 Gain-Atl 50 8 5 200 4
17 Gain-NY 150 8 6 200 7
18 Phoe Scrap 0 1 0 700 5
Chi
19 Extra Demand 0 2 0 100 -20
Dal
20 Extra Demand100 4 0 100 -20
21 NY Demand 250 6 0 250 -25
22
Aus Extra Supply
200 0 7 300 10
23
Gain Extra Supply 0 0 8 100 14
24 Atl_Rest 0 5 9 100 1
en Network Ph. 1 Iter. 14
Total Iter. 27
Comp. Time 00:00
Status Optimal