Scribd
Upload
63 views7 pages

CH 6 Solver Min Cost Capacitated Network

This document summarizes the results of an optimization model solved in Microsoft Excel. It provides the original and final values for adjustable cells in a worksheet called "genTrans.xls", as well as the target cell, constraints, and intermediate calculations for a general capacitated network model solved with Excel's Solver tool. The optimal solution was found with a total cost of 490 and included flows between 5 nodes respecting the given unit costs, demands, supplies, and capacity limits.

Uploaded by

Carlos Andres Lopez Perez
Copyright
© Attribution Non-Commercial (BY-NC)
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
63 views7 pages

CH 6 Solver Min Cost Capacitated Network

This document summarizes the results of an optimization model solved in Microsoft Excel. It provides the original and final values for adjustable cells in a worksheet called "genTrans.xls", as well as the target cell, constraints, and intermediate calculations for a general capacitated network model solved with Excel's Solver tool. The optimal solution was found with a total cost of 490 and included flows between 5 nodes respecting the given unit costs, demands, supplies, and capacity limits.

Uploaded by

Carlos Andres Lopez Perez
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 7

Microsoft Excel 9.

0 Answer Report
Worksheet: [genTrans.xls]Sheet1
Report Created: 9/7/01 5:52:04 PM

Target Cell (Min)


Cell
Name
$F$20 S2 Flow

Original Value
180

Final Value
180

Adjustable Cells
Cell
Name
$B$20 S1 - D1 Flow
$B$21 S1 - D2 Flow
$B$22 S1 - D3 Flow
$B$23 S1 - D4 Flow
$B$24 S2 - D1 Flow
$B$25 S2 - D2 Flow
$B$26 S2 - D3 Flow
$B$27 S2 - D4 Flow
$B$28 S3 - D1 Flow
$B$29 S3 - D2 Flow
$B$30 S3 - D3 Flow
$B$31 S3 - D4 Flow
$B$32 S4 - D1 Flow
$B$33 S4 - D2 Flow
$B$34 S4 - D3 Flow
$B$35 S4 - D4 Flow

Original Value
0
0
0
50
0
20
0
160
100
180
0
0
0
0
180
89.99999999

Final Value
20
0
30
0
0
0
150
30
80
200
0
0
0
0
0
270

Constraints
Cell
Name
$F$19 S1 Flow
$F$20 S2 Flow
$F$21 S3 Flow
$F$22 S4 Flow
$F$23 D1 Flow
$F$24 D2 Flow
$F$25 D3 Flow
$F$26 D4 Flow

Cell Value
50
180
280
270
-100
-200
-180
-300

Formula
$F$19=$G$19
$F$20=$G$20
$F$21=$G$21
$F$22=$G$22
$F$23=$G$23
$F$24=$G$24
$F$25=$G$25
$F$26=$G$26

Status
Slack
Not Binding
0
Not Binding
0
Not Binding
0
Not Binding
0
Not Binding
0
Not Binding
0
Not Binding
0
Not Binding
0

General Capacitated Network Model with Solver


Input data:
No. of nodes

N1
N2
N3
N4
N5

5
N1
0
0
0
0
0

Demand
0
Optimum solution:
Total cost = 490
From - To
Flow
N1 - N2
5
N1 - N3
0
N1 - N4
35
N1 - N5
0
N2 - N1
0
N2 - N3
25
N2 - N4
0
N2 - N5
30
N3 - N1
0
N3 - N2
0
N3 - N4
0
N3 - N5
25
N4 - N1
0
N4 - N2
0
N4 - N3
0
N4 - N5
5
N5 - N1
0
N5 - N2
0
N5 - N3
0
N5 - N4
0
0
0
0
0
0
0
0
0
0
0
0
0
0

<<maximum 10
N2
3
0
0
0
0

Capacity
999999
10
35
0
0
60
0
30
0
0
0
999999
0
0
0
999999
0
0
0
0

N3
7
2
0
0
0

N4
5
0
0
0
0

Unit Cost Matrix


N5
0
1
8
4
0

0
30
60
Intermediate calculations:
Name Node
Flow Demand From
N1
1
40
40
1
N2
2
50
50
1
N3
3
0
0
1
N4
4
-30
-30
1
N5
5
-60
-60
2
2
2
2
3
3
3
3
4
4
4
4
5
5
5
5

To
2
3
4
5
1
3
4
5
1
2
4
5
1
2
3
5
1
2
3
4

UnitCost
3
7
5
0
0
2
0
1
0
0
0
8
0
0
0
4
0
0
0
0

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Supply
40
50
0
0
0

N1
N2
N3
N4
N5

Capacity Matrix (blank cell= infinity)


N1
N2
N3
N4
N5
0
10
35
0
0
0
60
0
30
0
0
0
0
0
0
0
0
0
0
0
0
0

You might also like