Scribd
Upload
8 views

Dynamic Programming Shortest Path Problem

The document is a report from a solver that found a solution to optimize constraints and minimize distance. It summarizes: - The solver found a solution in 0.171 seconds with 17 iterations. - The objective was to minimize total minimum distance, which was achieved at a value of 13. - The solution involved specific variables like Sa, ab, bd, and dt being set to 1, while the rest were set to 0. - All constraints were satisfied and the solution met optimality conditions.

Uploaded by

RESMI V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
8 views

Dynamic Programming Shortest Path Problem

The document is a report from a solver that found a solution to optimize constraints and minimize distance. It summarizes: - The solver found a solution in 0.171 seconds with 17 iterations. - The objective was to minimize total minimum distance, which was achieved at a value of 13. - The solution involved specific variables like Sa, ab, bd, and dt being set to 1, while the rest were set to 0. - All constraints were satisfied and the solution met optimality conditions.

Uploaded by

RESMI V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 15

WPS Office Answer Report

Worksheet: [Book1]Sheet1
Report Created: 3/3/2023 2:30:33 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.29 Seconds.
Iterations: 13 Subproblem: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Solutions Unlimited, Integer Tolerance1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$C$31 Total Minimum distance a 0 1

Variable Cells
Cell Name Original Value Final Value Integer
$B$22 SS 0 0 Binary
$C$22 Sa 0 0 Binary
$D$22 Sb 0 0 Binary
$E$22 Sc 0 0 Binary
$F$22 Sd 0 0 Binary
$G$22 Se 0 0 Binary
$H$22 St 0 1 Binary
$B$23 aS 0 0 Binary
$C$23 aa 0 0 Binary
$D$23 ab 0 0 Binary
$E$23 ac 0 0 Binary
$F$23 ad 0 0 Binary
$G$23 ae 0 0 Binary
$H$23 at 0 0 Binary
$B$24 bS 0 0 Binary
$C$24 ba 0 0 Binary
$D$24 bb 0 0 Binary
$E$24 bc 0 0 Binary
$F$24 bd 0 0 Binary
$G$24 be 0 0 Binary
$H$24 bt 0 0 Binary
$B$25 cS 0 0 Binary
$C$25 ca 0 0 Binary
$D$25 cb 0 0 Binary
$E$25 cc 0 0 Binary
$F$25 cd 0 0 Binary
$G$25 ce 0 0 Binary
$H$25 ct 0 0 Binary
$B$26 dS 0 0 Binary
$C$26 da 0 0 Binary
$D$26 db 0 0 Binary
$E$26 dc 0 0 Binary
$F$26 dd 0 0 Binary
$G$26 de 0 0 Binary
$H$26 dt 0 0 Binary
$B$27 eS 0 0 Binary
$C$27 ea 0 0 Binary
$D$27 eb 0 0 Binary
$E$27 ec 0 0 Binary
$F$27 ed 0 0 Binary
$G$27 ee 0 0 Binary
$H$27 et 0 0 Binary
$B$28 tS 0 0 Binary
$C$28 ta 0 0 Binary
$D$28 tb 0 0 Binary
$E$28 tc 0 0 Binary
$F$28 td 0 0 Binary
$G$28 te 0 0 Binary
$H$28 tt 0 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$J$22 S out-in 1 $J$22=$L$22 Binding 0
$J$23 a out-in 0 $J$23=$L$23 Binding 0
$J$24 b out-in 0 $J$24=$L$24 Binding 0
$J$25 c out-in 0 $J$25=$L$25 Binding 0
$J$26 d out-in 0 $J$26=$L$26 Binding 0
$J$27 e out-in 0 $J$27=$L$27 Binding 0
$J$28 t out-in -1 $J$28=$L$28 Binding 0
$B$22=Binary
$C$22=Binary
$D$22=Binary
$E$22=Binary
$F$22=Binary
$G$22=Binary
$H$22=Binary
$B$23=Binary
$C$23=Binary
$D$23=Binary
$E$23=Binary
$F$23=Binary
$G$23=Binary
$H$23=Binary
$B$24=Binary
$C$24=Binary
$D$24=Binary
$E$24=Binary
$F$24=Binary
$G$24=Binary
$H$24=Binary
$B$25=Binary
$C$25=Binary
$D$25=Binary
$E$25=Binary
$F$25=Binary
$G$25=Binary
$H$25=Binary
$B$26=Binary
$C$26=Binary
$D$26=Binary
$E$26=Binary
$F$26=Binary
$G$26=Binary
$H$26=Binary
$B$27=Binary
$C$27=Binary
$D$27=Binary
$E$27=Binary
$F$27=Binary
$G$27=Binary
$H$27=Binary
$B$28=Binary
$C$28=Binary
$D$28=Binary
$E$28=Binary
$F$28=Binary
$G$28=Binary
$H$28=Binary
ume NonNegative
WPS Office Answer Report
Worksheet: [Book1]Sheet1
Report Created: 3/3/2023 2:37:5 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.171 Seconds.
Iterations: 17 Subproblem: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Solutions Unlimited, Integer Tolerance1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$C$31 Total Minimum distance a 100 13

Variable Cells
Cell Name Original Value Final Value Integer
$B$22 SS 0 0 Binary
$C$22 Sa 0 1 Binary
$D$22 Sb 0 0 Binary
$E$22 Sc 0 0 Binary
$F$22 Sd 0 0 Binary
$G$22 Se 0 0 Binary
$H$22 St 1 0 Binary
$B$23 aS 0 0 Binary
$C$23 aa 0 0 Binary
$D$23 ab 0 1 Binary
$E$23 ac 0 0 Binary
$F$23 ad 0 0 Binary
$G$23 ae 0 0 Binary
$H$23 at 0 0 Binary
$B$24 bS 0 0 Binary
$C$24 ba 0 0 Binary
$D$24 bb 0 0 Binary
$E$24 bc 0 0 Binary
$F$24 bd 0 1 Binary
$G$24 be 0 0 Binary
$H$24 bt 0 0 Binary
$B$25 cS 0 0 Binary
$C$25 ca 0 0 Binary
$D$25 cb 0 0 Binary
$E$25 cc 0 0 Binary
$F$25 cd 0 0 Binary
$G$25 ce 0 0 Binary
$H$25 ct 0 0 Binary
$B$26 dS 0 0 Binary
$C$26 da 0 0 Binary
$D$26 db 0 0 Binary
$E$26 dc 0 0 Binary
$F$26 dd 0 0 Binary
$G$26 de 0 0 Binary
$H$26 dt 0 1 Binary
$B$27 eS 0 0 Binary
$C$27 ea 0 0 Binary
$D$27 eb 0 0 Binary
$E$27 ec 0 0 Binary
$F$27 ed 0 0 Binary
$G$27 ee 0 0 Binary
$H$27 et 0 0 Binary
$B$28 tS 0 0 Binary
$C$28 ta 0 0 Binary
$D$28 tb 0 0 Binary
$E$28 tc 0 0 Binary
$F$28 td 0 0 Binary
$G$28 te 0 0 Binary
$H$28 tt 0 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$J$22 S out-in 1 $J$22=$L$22 Binding 0
$J$23 a out-in 0 $J$23=$L$23 Binding 0
$J$24 b out-in 0 $J$24=$L$24 Binding 0
$J$25 c out-in 0 $J$25=$L$25 Binding 0
$J$26 d out-in 0 $J$26=$L$26 Binding 0
$J$27 e out-in 0 $J$27=$L$27 Binding 0
$J$28 t out-in -1 $J$28=$L$28 Binding 0
$B$22=Binary
$C$22=Binary
$D$22=Binary
$E$22=Binary
$F$22=Binary
$G$22=Binary
$H$22=Binary
$B$23=Binary
$C$23=Binary
$D$23=Binary
$E$23=Binary
$F$23=Binary
$G$23=Binary
$H$23=Binary
$B$24=Binary
$C$24=Binary
$D$24=Binary
$E$24=Binary
$F$24=Binary
$G$24=Binary
$H$24=Binary
$B$25=Binary
$C$25=Binary
$D$25=Binary
$E$25=Binary
$F$25=Binary
$G$25=Binary
$H$25=Binary
$B$26=Binary
$C$26=Binary
$D$26=Binary
$E$26=Binary
$F$26=Binary
$G$26=Binary
$H$26=Binary
$B$27=Binary
$C$27=Binary
$D$27=Binary
$E$27=Binary
$F$27=Binary
$G$27=Binary
$H$27=Binary
$B$28=Binary
$C$28=Binary
$D$28=Binary
$E$28=Binary
$F$28=Binary
$G$28=Binary
$H$28=Binary
ume NonNegative
Shortest Path Problem

S a b c d e
S 100 2 5 4 100 100
a 100 100 2 100 7 100
b 100 100 100 1 4 3
c 100 100 1 100 100 4
d 100 7 4 100 100 1
e 100 100 3 4 1 100
t 100 100 100 100 100 100

S a b c d e
S 0 1 0 0 0 0
a 0 0 1 0 0 0
b 0 0 0 0 1 0
c 0 0 0 0 0 0
d 0 0 0 0 0 0
e 0 0 0 0 0 0
t 0 0 0 0 0 0
Total in 0 1 1 0 1 0

Total Minimum distance 13


t
100
100
100
100
5
7
100

t Total out out-in Relation RHS


0 1 1= 1
0 1 0= 0
0 1 0= 0
0 0 0= 0
1 1 0= 0
0 0 0= 0
0 0 -1 = -1
1

You might also like