Instructions

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.

Sect. Network Flow Programming Models

Worksheet 1 Classical Models
Trans1 Transportation Problem
Assign Assignment Problem
SPT Shortest Path Problem
MaxFlow Maximum Flow Problem
2 Extension of the Basic Models
Trans2 Transportation Problem with Costs and Revenues
Trans2_Net Network Model for Transportation Problem with Costs and Revenues
Multiperiod Multiperiod Operations
Tranship Network Model of a Transshipment Problem
Tranship_T Transportation Model of a Transshipment Problem
TransFlow Transformation of Flow
Eco_Life Determining Economic Life
Arbitrage Arbitrage
3 Linear Programming Model

Page 1
 Instructions

Eco_LifeLP Linear Programming Model of Economic Life Problem

4 Minimum Cost Flow Problem
Dist_1 Distribution Problem
Dist_2 Distribution Problem with Variable External Flows
Dist_3 Distribution Problem as a Generalized Network (with losses)
Dist_4 Distribution Problem with a Side Constraint
Dist_5 Distribution Problem with a Restriction Through Atlanta
Computation - Example used on the add-in demonstration
Power Example Electric Power Distribution Problem

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

Math Programming - Transportation/Network Solver

Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Math Programming - Transportation/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver

Page 3
 Instructions

Math Programming - Linear-LP/IP Solver

Math Programming - Network/Network Solver

Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver
Math Programming - Network/Network Solver

Math Programming - Network/Network Solver

Page 4
Trans1
[external flow]
(cost)

Assign

[extern

(0) (5) (3)

H L O B
[-1] [-1] [-1]
(2) (3) (2) (
SPT
(0) (5) (3)
H L O B
[-1] [-1] [-1]
(2) (3) (2) (

(1) (4) (3)

E I M P
[-1] [-1] [-1]

(5) (1) (2) (

(4) (3) (2)

C F J N
[-1] [-1] [-1]

(1) (7) (5) (

(0) (3) (4)

A D G K
[15] [-1] [-1]

MaxFlow

[minimum supply / demand] (extra demand, un

Trans2_Net
(shipping cost) [-5]
(10, -1
(extra supply, unit cost) D1
(10)
[10] (3) [-5]
(15, 8) (10, -
(15)
S1 D2
(6)
[10] (6) [-5]
(15, 10) (7) (10, -
S2 D3
(10) (13)
[-5]
 (extra supply, unit cost) D1
(10)
[10] (3) [-5]
(15, 8) (10, -
(15)
S1 D2
(6)
[10] (6) [-5]
(15, 10) (7) (10, -
S2 D3
(10) (13)
[-5]
(10, -
D4

[external flow]
(cost)

Mulltiperiod (upper bounds, cost)

(9)

(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)

[5] [-2] [-7]

(6) (3)
S1 T1 D1
(3) (2)

[7] (3) [0] (4) [-3]

(1) (6)
S2 T2 D2
(4) (5)

[3] (6) [+2] (3) [-5]

(4) (5)
S3 T3 D3

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

(extra demand, unit revenue)

ping cost) [-5]

(10, -12)
D1
(10)
(3) [-5]
(10, -14)
)
D2
(6)
(6) [-5]
(7) (10, -16)
D3
(10) (13)
[-5]
 D1
(10)
(3) [-5]
(10, -14)
)
D2
(6)
(6) [-5]
(7) (10, -16)
D3
(10) (13)
[-5]
(10, -18)
D4

[external flow] [-15]

(cost)
D1

st)
(9)
[-15]
(14)
1 D2
(5)

(2) (5) [-15]

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)

[5] [-2] [-7]

S1 T1 D1
(5)

[7] (2) [0] (7) [-3]

(5)
S2 T2 D2
(3)

[3] [+2] (3) [-5]

(3) (2)
S3 T3 D3

[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

and Balance Constraints

Balance
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Network Model Name:MaxFlow Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: -30 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance Cons
60 Num. Name Flow Origin Term. Upper Cost Red. Co Num. Name
1 1 Arc 1 30 0 1 99999 0 0 1 Node 1
1 2 Arc 2 15 1 2 15 0 0 2 Node 2
0 3 Arc 3 10 1 3 10 0 -1 3 Node 3
4 Arc 4 5 1 4 12 0 0 4 Node 4
5 Arc 5 5 2 5 5 0 0 5 Node 5
6 Arc 6 5 2 6 5 0 -1 6 Node 6
7 Arc 7 5 2 7 5 0 -1 7 Node 7
8 Arc 8 0 3 5 6 0 1 8 Node 8
9 Arc 9 6 3 6 6 0 0
10 Arc 10 4 3 7 6 0 0
11 Arc 11 5 4 5 12 0 0
12 Arc 12 10 5 8 10 0 -1
13 Arc 13 11 6 8 15 0 0
14 Arc 14 9 7 8 15 0 0
15 Arc 15 30 8 0 99999 -1 0
 en Network Ph. 1 Iter. 10
Total Iter. 18
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

de Data and Balance Constraints 8

Fixed Balance 10
10 0 12
10 0 14
-5 0 16
-5 0 18
-5 0 sts from external flows -120
-5 0 Arc costs 0
Total -120

e that the network model does not assess a charge for

rnal flows. To compare the cost of the solution to Trans2
he calculation above.
Network Model Name:MultPeriod Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 2110 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_1 30 0 1 30 8 1 S1_1
0 2 S2_1 50 0 2 50 10 2 S2_1
0 3 S1-D1_1 0 1 3 ### 9 3 D1_1
4 S1-D2_1 0 1 4 ### 14 4 D2_1
5 S1-D3_1 30 1 5 ### 5 5 D3_1
6 S1-D4_1 0 1 6 ### 12 6 D4_1
7 S2-D1_1 20 2 3 ### 2 7 S1_2
8 S2-D2_1 15 2 4 ### 5 8 S2_2
9 S2-D3_1 0 2 5 ### 6 9 D1_2
10 S2-D4_1 15 2 6 ### 9 10 D2_2
11 D1_Inv 5 3 9 ### 1 11 D3_2
12 D2_Inv 0 4 10 ### 1 12 D4_2
13 D3_Inv 15 5 11 ### 1
14 D4_Inv 0 6 12 ### 1
15 S1_2 10 0 7 30 9
16 S2_2 50 0 8 50 9
17 S1-D1_2 0 7 9 ### 10
18 S1-D2_2 0 7 10 ### 15
19 S1-D3_2 5 7 11 ### 6
20 S1-D4_2 5 7 12 ### 13
21 S2-D1_2 15 8 9 ### 3
22 S2-D2_2 20 8 10 ### 6
23 S2-D3_2 0 8 11 ### 7
24 S2-D4_2 15 8 12 ### 10
 en Network Ph. 1 Iter. 18
Total Iter. 28
Comp. Time 00:00
Status Optimal

de Data and Balance Constraints

Fixed Balance
0 0
0 0
-15 0
-15 0
-15 0
-15 0
0 0
0 0
-20 0
-20 0
-20 0
-20 0
Network Model Name:Tranship Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 100 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 S1-T1 0 1 4 6 1 S1 5
0 2 S1-T2 5 1 5 3 2 S2 7
0 3 S2-T1 2 2 4 3 3 S3 3
4 S2-T2 5 2 5 1 4 T1 -2
5 S2-T3 0 2 6 4 5 T2 0
6 S3-T2 0 3 5 6 6 T3 2
7 S3-T3 3 3 6 4 7 D1 -7
8 T1-D1 0 4 7 3 8 D2 -3
9 T1-D2 0 4 8 2 9 D3 -5
10 T2-D1 7 5 7 4
11 T2-D2 0 5 8 6
12 T2-D3 3 5 9 5
13 T3-D2 3 6 8 3
14 T3-D3 2 6 9 5
en Network Ph. 1 Iter. 10
Total Iter. 14
Comp. Time 00:01
Status Optimal

and Balance Constraints

Balance
0
0
0
0
0
0
0
0
0
Transportation Model Name: TranShip_T Objective Term Solver: Jensen Network
1 Type: Trans Ship. Cost: 100 Type: Linear
0 Change Goal: Min Sup. Cost: 0 Sens.: No
1 Objective: 100 Dem. Rev.: 0 nteger: No
0 Solve Side: No
0
100 Vary
100
0 Trans. Flows 1 2 3 4 5 6 Supply Data
60 Name D1 D2 D3 T1 T2 T3 Min. Max. Cost
0 1 S1 0 0 0 0 5 0 5 5 0
0 2 S2 0 0 0 2 5 0 7 7 0
0 3 S3 0 0 0 0 0 3 3 3 0
4 T1 0 0 0 15 0 0 15 15 0
5 T2 7 0 3 0 7 0 17 17 0
6 T3 0 3 2 0 0 14 19 19 0
Demand Min.: 7 3 5 17 17 17
Data Max: 7 3 5 17 17 17
Revenue: 0 0 0 0 0 0
Received: 7 3 5 17 17 17

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

Node Data and Balance Constraints

Num. Name Fixed Balance
1 P1 0 0
2 P2 0 0
3 P3 0 0
4 P4 0 0
5 A -70 2E-006
6 B -80 ###
7 C -40 0
Network Model Name:Eco_Life Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 8045 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance
60 Num. Name Flow Origin Term. Cost Gain Flow_O Num.
0 1 Y0 3.273 1 2 1000 0.833 2.727 1
0 2 Y1 2.727 2 3 1000 0.833 2.273 2
0 3 Y2 0 3 4 1200 0.833 0 3
4 Y3 0 4 5 1500 0.833 0 4
5 Y4 0 5 6 1900 0.833 0 5
6 S1 0 2 1 500 1 0 6
7 S2 2.273 3 1 900 1 2.273
8 S3 0 4 1 1400 1 0
9 S4 0 5 1 1900 1 0
10 S5 0 6 1 2500 1 0
en Network Ph. 1 Iter. 8
Total Iter. 9
Comp. Time 00:01
Status Optimal

Node Data and Balance Constraints

Name Fixed Balance
N0 1 0
N1 0 ###
N2 0 ###
N3 0 0
N4 0 0
N5 0 0
Network Model Name:Arbitrage1 Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 63.03 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows
60 Num. Name Flow Origin Term. Cost Gain Flow_O
0 1 Arc1 0 1 2 1 1.04 0
0 2 Arc2 0 1 3 1 1.436 0
0 3 Arc3 0 1 4 1 1.703 0
4 Arc4 0 1 5 1 0.66 0
5 Arc5 0 2 1 0.95 0.941 0
6 Arc6 0 2 3 0.95 1.396 0
7 Arc7 0 2 4 0.95 1.624 0
8 Arc8 0 2 5 0.95 0.634 0
9 Arc9 0 3 1 0.69 0.683 0
10 Arc10 0 3 2 0.69 0.703 0
11 Arc11 0 3 4 0.69 1.129 0
12 Arc12 30.4728554 3 5 0.69 0.475 14.47
13 Arc13 0 4 1 0.58 0.574 0
14 Arc14 0 4 2 0.58 0.604 0
15 Arc15 34.986057 4 3 0.58 0.871 30.47
16 Arc16 0 4 5 0.58 0.386 0
17 Arc17 0.67340067 5 1 1.5 1.485 1
18 Arc18 0 5 2 1.5 1.545 0
19 Arc19 0 5 3 1.5 2.059 0
20 Arc20 13.8012055 5 4 1.5 2.535 34.99

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

Node Data and Balance Constraints

Num. Name Fixed Balance
1 US -1 1E-008
2 Yen(100) 0 0
3 CHF 0 ###
4 D-Mark 0 1E-006
5 Brit - P 0 ###
Linear Model Name: Eco_LifeLP Solver: Jensen LP/IP Ph. 1 Iter.
1 Type: LP1 Type: Linear Total Iter.
0 Change Goal: Min Sens.: No Comp. Time
1 Objective: 8045 Side: No
0 Solve
0 Variables 1 2 3 4 5 6
100 Vary Name: X1 X2 X3 X4 X5 X6
100 Values: 3.273 2.727 4E-016 ### 0 0
0 Change Relation
60

Linear Obj. Coef.: 1000 1000 1200 1500 1900 500

Constraints
Num. Name Value Rel. RHS Linear Constraint Coefficients
1 N0 1 = 1 1 0 0 0 0 -1
2 N1 ### = 0 -0.833 1 0 0 0 1
3 N2 9E-016 = 0 0 -0.833 1 0 0 0
4 N3 ### = 0 0 0 -0.833 1 0 0
5 N4 2E-016 = 0 0 0 0 -0.833 1 0
6 N5 0 = 0 0 0 0 0 -0.833 0
 Ph. 1 Iter. 6
Total Iter. 8
Comp. Time 00:00
Status Optimal

7 8 9 10
X7 X8 X9 X 10
2.273 0 0 0

900 1400 1900 2500

-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

de Data and Balance Constraints

Fixed Balance
700 0
-200 0
-200 0
-300 0
-150 0
-250 0
200 0
200 0
Network Model Name: dist_2 Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: -1600 Side: No
0 Solve
0
100 Vary
100
0 Arc Data and Flows Node Data and Balance C
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 0 4 6 200 6 7 Aus
8 Dal-Atl 0 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 100 5 2 200 4
12 Aus-LA 0 7 3 200 7
13 Aus-Dal 200 7 4 200 2
14 Aus-Atl 100 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
19 Chi Extra Demand 100 2 0 100 -20
20 Dal Extra Demand 100 4 0 100 -20
21 NY Demand 250 6 0 250 -25
22 Aus Extra Supply 300 0 7 300 10
23 Gain Extra Supply 0 0 8 100 14
 en Network Ph. 1 Iter. 13
Total Iter. 23
Comp. Time 00:00
Status Optimal

de Data and Balance Constraints

Fixed Balance
700 0
-200 0
-200 0
-300 0
-150 0
100 0
0 0
200 0
Network Model Name: dist_3 Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: -494 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 Phoe-Chi 200 1 2 200 6 0.95 190
0 2 Phoe-LA 200 1 3 200 3 0.95 190
0 3 Phoe-Dal 200 1 4 200 3 0.95 190
4 Phoe-Atl 100 1 5 200 7 0.95 95
5 Dal-LA 0 4 3 200 5 0.95 0
6 Dal-Chi 0 4 2 200 4 0.95 0
7 Dal-NY 0 4 6 200 6 0.95 0
8 Dal-Atl 0 4 5 200 2 0.95 0
9 Atl-NY 0 5 6 200 5 0.95 0
10 Atl-Dal 0 5 4 200 2 0.95 0
11 Atl-Chi 10.53 5 2 200 4 0.95 10
12 Aus-LA 10.53 7 3 200 7 0.95 10
13 Aus-Dal 200 7 4 200 2 0.95 190
14 Aus-Atl 47.92 7 5 200 5 0.95 45.53
15 Gain-Dal 21.05 8 4 200 6 0.95 20
16 Gain-Atl 21.05 8 5 200 4 0.95 20
17 Gain-NY 157.9 8 6 200 7 0.95 150
18 Phoe Scrap 0 1 0 700 5 1 0
19Chi Extra Demand 0 2 0 100 -20 1 0
20Dal Extra Demand 100 4 0 100 -20 1 100
21 NY Demand 250 6 0 250 -25 1 250
22 Aus Extra Supply258.4 0 7 300 10 1 258.4
23Gain Extra Supply 0 0 8 100 14 1 0
en Network Ph. 1 Iter. 16
Total Iter. 26
Comp. Time 00:01
Status Optimal

Node Data and Balance Constraints

Num. Name Fixed Balance
1 Phoe 700 0
2 Chi -200 ###
3 LA -200 ###
4 Dal -300 ###
5 Atl -150 ###
6 NY 100 ###
7 Aus 0 0
8 Gain 200 0
Network Model Name: dist_4 Solver: Excel Solver
-1500 Type: Net Type: Linear
23 Change Goal: Min Sens.: No
1 Objective: -1500 Side: Yes
1 Solve
1
100 Vary

Arc Data and Flows Node Data and Balance Constr

Num. Name Flow Origin Term. Upper Cost Num. Name
1 Phoe-Chi 200 1 2 200 6 1 Phoe
2 Phoe-LA 200 1 3 200 3 2 Chi
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 3E-015 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 5 6 200 5
10 Atl-Dal 0 5 4 200 2 Side Constraint
11 Atl-Chi 3E-014 5 2 200 4 ExpressionValue
12 Aus-LA ### 7 3 200 7 0 0
13 Aus-Dal 200 7 4 200 2
14 Aus-Atl 3E-014 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 Demand 100 4 0 100 -20
21 NY Demand 250 6 0 250 -25
22
Aus Extra Supply200 0 7 300 10
23
Gain Extra Supply
5E-014 0 8 100 14
de Data and Balance Constraints
Fixed Balance
700 0
-200 0
-200 0
-300 0
-150 0
100 0
0 0
200 0

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

de Data and Balance Constraints

Fixed Balance
700 0
-200 0
-200 0
-300 0
-150 0
100 0
0 0
200 0
0 0
Network Model Name: Power Solver: Jensen Network
1 Type: Net Type: Linear
0 Change Goal: Min Sens.: No
1 Objective: 48313 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 A_B 0 1 2 10000 0 0.95 0
0 2 A_C 0 1 3 10000 0 0.95 0
0 3 B_A 0 2 1 10000 0 0.95 0
4 B_C 0 2 3 10000 0 0.95 0
5 C_A 0 3 1 10000 0 0.95 0
6 C_B 16.67 3 2 10000 0 0.95 15.83
7 A_X 0 1 4 10000 0 0.9 0
8 A_Z 4E-007 1 6 10000 0 0.9 3E-007
9 B_Y 0 2 5 10000 0 0.9 0
10 B_Z 33.33 2 6 10000 0 0.9 30
11 C_X 27.78 3 4 10000 0 0.9 25
12 C_Y 55.56 3 5 10000 0 0.9 50
13 A 0 0 1 100 500 1 0
14 B 17.5 0 2 75 475 1 17.5
15 C 100 0 3 100 400 1 100
en Network Ph. 1 Iter. 8
Total Iter. 14
Comp. Time 00:01
Status Optimal

Node Data and Balance Constraints

Num. Name Fixed Balance
1 A 0 4E-007
2 B 0 ###
3 C 0 0
4 X -25 ###
5 Y -50 ###
6 Z -30 ###
Algorithmic Details for problem Power.
Jensen Network Solution Algorithm
Start Solution
Add Artificial Arcs
Artifical Arc: 20 added to basis tree. Arc goes from 9 to 1.
Artifical Arc: 21 added to basis tree. Arc goes from 9 to 2.
Artifical Arc: 22 added to basis tree. Arc goes from 9 to 3.
Artifical Arc: 23 added to basis tree. Arc goes from 9 to 4.
Artifical Arc: 24 added to basis tree. Arc goes from 9 to 5.
Artifical Arc: 25 added to basis tree. Arc goes from 9 to 6.
Artifical Arc: 26 added to basis tree. Arc goes from 9 to 7.
Artifical Arc: 27 added to basis tree. Arc goes from 9 to 8.
Start PHASE_1
Iterations Iter. Enters Leaves Red. Cost Flow Chg Select
1 16 26 -1 0 First
2 19 27 -1 0 First
3 13 20 -1 0 First
4 14 21 -1 0 First
5 15 22 -1 0 First
6 7 23 -0.9 27.777779 First
7 8 25 -0.9 33.333334 First
8 9 24 -0.9 55.555557 First
Start PHASE_2
Iterations Iter. Enters Leaves Red. Cost Flow Chg Select
9 5 13 -74.99999 64.327488 First
10 6 15 -51.24999 35.672512 First
11 11 7 -23.75001 27.777779 First
12 12 -6 -23.75002 37.134501 First
13 10 9 -25 17.500004 First
14 6 -5 -2.00E-005 16.666664 First
Finish Optimal: z = 48312.5