Microsoft Excel 16.

67 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 2022/12/11 23:37:06
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 313.827 Seconds.
Iterations: 14 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 1E-06, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$K$46 Total On Route 0 18

Variable Cells
Cell Name Original Value Final Value Integer
$K$28 On Route 0 1 Contin
$K$29 On Route 0 0 Contin
$K$30 On Route 0 0 Contin
$K$31 On Route 0 1 Contin
$K$32 On Route 0 0 Contin
$K$33 On Route 0 0 Contin
$K$34 On Route 0 0 Contin
$K$35 On Route 0 0 Contin
$K$36 On Route 0 1 Contin
$K$37 On Route 0 0 Contin
$K$38 On Route 0 0 Contin
$K$39 On Route 0 0 Contin
$K$40 On Route 0 0 Contin
$K$41 On Route 0 1 Contin
$K$42 On Route 0 0 Contin
$K$43 On Route 0 0 Contin
$K$44 On Route 0 1 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$O$28 Net Flow 1 $O$28=$Q$28 Binding 0
$O$29 Net Flow 0 $O$29=$Q$29 Binding 0
$O$30 Net Flow 0 $O$30=$Q$30 Binding 0
$O$31 Net Flow 0 $O$31=$Q$31 Binding 0
$O$32 Net Flow 0 $O$32=$Q$32 Binding 0
$O$33 Net Flow 0 $O$33=$Q$33 Binding 0
$O$34 Net Flow 0 $O$34=$Q$34 Binding 0
$O$35 Net Flow 0 $O$35=$Q$35 Binding 0
$O$36 Net Flow 0 $O$36=$Q$36 Binding 0
$O$37 Net Flow 0 $O$37=$Q$37 Binding 0
$O$38 Net Flow 0 $O$38=$Q$38 Binding 0
$O$39 Net Flow -1 $O$39=$Q$39 Binding 0
NonNegative
Microsoft Excel 16.67 Sensitivity Report
Worksheet: [Book1]Sheet1
Report Created: 2022/12/11 23:37:06

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$K$28 On Route 1 0 5 7 1E+030
$K$29 On Route 0 0 10 1E+030 7
$K$30 On Route 0 0 7 1E+030 7
$K$31 On Route 1 0 1 7 1E+030
$K$32 On Route 0 7 4 1E+030 7
$K$33 On Route 0 7 3 1E+030 7
$K$34 On Route 0 10 11 1E+030 10
$K$35 On Route 0 0 3 7 1
$K$36 On Route 1 0 7 1 1E+030
$K$37 On Route 0 1 5 1E+030 1
$K$38 On Route 0 0 2 8 10
$K$39 On Route 0 0 9 1E+030 8
$K$40 On Route 0 0 0 1 7
$K$41 On Route 1 0 1 7 1E+030
$K$42 On Route 0 7 12 1E+030 7
$K$43 On Route 0 8 2 1E+030 8
$K$44 On Route 1 0 4 7 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$O$28 Net Flow 1 14 1 1E+030 0
$O$29 Net Flow 0 9 0 1E+030 0
$O$30 Net Flow 0 2 0 0 0
$O$31 Net Flow 0 4 0 0 0
$O$32 Net Flow 0 8 0 1E+030 0
$O$33 Net Flow 0 5 0 0 0
$O$34 Net Flow 0 3 0 1E+030 0
$O$35 Net Flow 0 1 0 1E+030 0
$O$36 Net Flow 0 1 0 0 0
$O$37 Net Flow 0 -6 0 0 0
$O$38 Net Flow 0 0 0 0 1E+030
$O$39 Net Flow -1 -4 -1 1 0
Microsoft Excel 16.67 Limits Report
Worksheet: [Book1]Sheet1
Report Created: 2022/12/11 23:37:06

Objective
Cell Name Value
$K$46 Total On Route 18

Variable Lower Objective Upper Objective

Cell Name Value Limit Result Limit Result
$K$28 On Route 1 0 85 250 18835
$K$29 On Route 0 0 110 398.5 20035
$K$30 On Route 0 0 125 597 21020
$K$31 On Route 1
$K$32 On Route 0
$K$33 On Route 0
$K$34 On Route 0
$K$35 On Route 0
$K$36 On Route 1
$K$37 On Route 0
$K$38 On Route 0
$K$39 On Route 0
$K$40 On Route 0
$K$41 On Route 1
$K$42 On Route 0
$K$43 On Route 0
$K$44 On Route 1
Keven SL2209006
 Nodes

Iterations 1 2 3 4 5

1 [0, -] [∞, -] [∞, -] [∞, -] [∞, -]

2 [0, -]* [∞, -] [∞, -] [∞, -] [∞, -]
3 [0, -]* [5, 1]* [∞, -] [10, 1] [∞, -]
4 [0, -]* [5, 1]* [12, 2] [10, 1] [6, 2]*
5 [0, -]* [5, 1]* [12, 2] [10, 1] [6, 2]*
6 [0, -]* [5, 1]* [12, 2] [10, 1] [6, 2]*
7 [0, -]* [5, 1]* [12, 2]* [10, 1] [6, 2]*
8 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
9 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
10 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
11 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
12 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
13 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*
14 [0, -]* [5, 1]* [12, 2]* [10, 1]* [6, 2]*

Shortest
path Nodes: 1 -> 2-> 5 -> 8 -> 11 -> 12

From To On Route Distance Nodes

1 2 1 5 1
1 4 0 10 2
2 3 0 7 3
2 5 1 1 4
3 6 0 4 5
4 5 0 3 6
4 7 0 11 7
5 6 0 3 8
5 8 1 7 9
6 9 0 5 10
7 8 0 2 11
7 10 0 9 12
8 9 0 0
8 11 1 1
9 12 0 12
10 11 0 2
11 12 1 4

Total 18
 Nodes

6 7 8 9 10 11 12

[∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -]

[∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -]
[∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -]
[∞, -] [21, 4] [∞, -] [∞, -] [∞, -] [∞, -] [∞, -]
[9, 5]* [21, 4] [13, 5] [∞, -] [30, 7] [∞, -] [∞, -]
[9, 5]* [21, 4] [13, 5] [14, 6]* [30, 7] [14, 8] [∞, -]
[9, 5]* [21, 4] [13, 5] [14, 6]* [30, 7] [14, 8] [26, 9]
[9, 5]* [21, 4] [13, 5] [14, 6]* [30, 7] [14, 8] [26, 9]
[9, 5]* [21, 4]* [13, 5] [14, 6]* [30, 7] [14, 8] [26, 9]
[9, 5]* [21, 4]* [13, 5]* [14, 6]* [30, 7] [14, 8] [26, 9]
[9, 5]* [21, 4]* [13, 5]* [13,6]* [30, 7] [14, 8] [26, 9]
[9, 5]* [21, 4]* [13, 5]* [13,6]* [30, 7]* [14, 8] [25, 9]
[9, 5]* [21, 4]* [13, 5]* [13,6]* [30, 7]* [14, 8]* [18, 11]
[9, 5]* [21, 4]* [13, 5]* [13,6]* [30, 7]* [14, 8]* [18, 11]*

Net Flow Supply/

Demand
1 = 1
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0
-1 = -1
The excel solver confirms that the shortest path
goes through nodes 1, 2, 5, 8 and 11 to reach
node 12.
Prominent Updated
nodes nodes

2
5
6
9
3
4
7
8 9
9 12
10
11 12
12