Scribd
Upload
24 views

w10 AsignmentProblem

The document summarizes the results of solving two optimization problems in Microsoft Excel using the Solver add-in. The first problem assigns subcontractors to projects to minimize mileage. The second problem finds the shortest route between nodes to minimize the total distance traveled. Both problems were solved successfully with the Solver finding solutions that satisfied all constraints in less than 0.1 seconds.

Uploaded by

Phuong Dung
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
24 views

w10 AsignmentProblem

The document summarizes the results of solving two optimization problems in Microsoft Excel using the Solver add-in. The first problem assigns subcontractors to projects to minimize mileage. The second problem finds the shortest route between nodes to minimize the total distance traveled. Both problems were solved successfully with the Solver finding solutions that satisfied all constraints in less than 0.1 seconds.

Uploaded by

Phuong Dung
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Microsoft Excel 16.

0 Answer Report
Worksheet: [w10_AsignmentProblem.xlsx]AsignmentProblem
Report Created: 4/22/2022 7:45:22 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$D$11 Minimize the mileage C 0 69

Variable Cells
Cell Name Original Value Final Value Integer
$B$14 Westside A 0 0 Contin
$C$14 Westside B 0 0 Contin
$D$14 Westside C 0 1 Contin
$B$15 Federated A 0 1 Contin
$C$15 Federated B 0 0 Contin
$D$15 Federated C 0 0 Contin
$B$16 Goliath A 0 0 Contin
$C$16 Goliath B 0 0 Contin
$D$16 Goliath C 0 0 Contin
$B$17 Universal A 0 0 Contin
$C$17 Universal B 0 1 Contin
$D$17 Universal C 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$B$18 Total A 1 $B$18=$B$20 Binding 0
$C$18 Total B 1 $C$18=$C$20 Binding 0
$D$18 Total C 1 $D$18=$D$20 Binding 0
$E$14 Westside Total 1 $E$14<=$G$14 Binding 0
$E$15 Federated Total 1 $E$15<=$G$15 Binding 0
$E$16 Goliath Total 0 $E$16<=$G$16 Not Binding 1
$E$17 Universal Total 1 $E$17<=$G$17 Binding 0
NonNegative
Electrical Contractor Problem

Projects
Subconstractors A B C
Westside 50 36 16 Distance (miles)
Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14

Model
Minimize the mileage 69 Value assigned (0 or 1)

Subconstractors A B C Total Available


Westside 0 0 1 1 <= 1
Federated 1 0 0 1 <= 1
Goliath 0 0 0 0 <= 1
Universal 0 1 0 1 <= 1
Total 1 1 1
= = =
1 1 1
Microsoft Excel 16.0 Answer Report
Worksheet: [w10_AsignmentProblem.xlsx]Ex4, Shortest-Route Problem
Report Created: 4/22/2022 8:14:57 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$G$14Minimize total mileage Out 0 32

Variable Cells
Cell Name Original Value Final Value Integer
$C$3 Node 1 - Node 2 Decision variables 0 0 Contin
$C$4 Node 1 - Node 3 Decision variables 0 1 Contin
$C$5 Node 2 - Node 3 Decision variables 0 0 Contin
$C$6 Node 2 - Node 4 Decision variables 0 1 Contin
$C$7 Node 2 - Node 6 Decision variables 0 0 Contin
$C$8 Node 3 - Node 2 Decision variables 0 1 Contin
$C$9 Node 3 - Node 5 Decision variables 0 0 Contin
$C$10 Node 4 - Node 2 Decision variables 0 0 Contin
$C$11 Node 4 - Node 5 Decision variables 0 0 Contin
$C$12 Node 4 - Node 6 Decision variables 0 1 Contin
$C$13 Node 5 - Node 3 Decision variables 0 0 Contin
$C$14 Node 5 - Node 4 Decision variables 0 0 Contin
$C$15 Node 5 - Node 6 Decision variables 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$H$4 Node 1(origin) Shipments 1 $H$4=$J$4 Binding 0
$H$5 Node 2 Shipments 0 $H$5=$J$5 Binding 0
$H$6 Node 3 Shipments 0 $H$6=$J$6 Binding 0
$H$7 Node 4 Shipments 0 $H$7=$J$7 Binding 0
$H$8 Node 5 Shipments 0 $H$8=$J$8 Binding 0
$H$9 Node 6 (destination) Shipments -1 $H$9=$J$9 Binding 0
Microsoft Excel 16.0 Answer Report
Worksheet: [w10_AsignmentProblem.xlsx]Ex4, Shortest-Route Problem
Report Created: 4/22/2022 10:41:20 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$G$14Minimize total mileage Out 0 32

Variable Cells
Cell Name Original Value Final Value Integer
$C$3 Node 1 - Node 2 Decision variables 0 0 Contin
$C$4 Node 1 - Node 3 Decision variables 0 1 Contin
$C$5 Node 2 - Node 3 Decision variables 0 0 Contin
$C$6 Node 2 - Node 4 Decision variables 0 1 Contin
$C$7 Node 2 - Node 6 Decision variables 0 0 Contin
$C$8 Node 3 - Node 2 Decision variables 0 1 Contin
$C$9 Node 3 - Node 5 Decision variables 0 0 Contin
$C$10 Node 4 - Node 2 Decision variables 0 0 Contin
$C$11 Node 4 - Node 5 Decision variables 0 0 Contin
$C$12 Node 4 - Node 6 Decision variables 0 1 Contin
$C$13 Node 5 - Node 3 Decision variables 0 0 Contin
$C$14 Node 5 - Node 4 Decision variables 0 0 Contin
$C$15 Node 5 - Node 6 Decision variables 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$H$4 Node 1(origin) Shipments 1 $H$4=$J$4 Binding 0
$H$5 Node 2 Shipments 0 $H$5=$J$5 Binding 0
$H$6 Node 3 Shipments 0 $H$6=$J$6 Binding 0
$H$7 Node 4 Shipments 0 $H$7=$J$7 Binding 0
$H$8 Node 5 Shipments 0 $H$8=$J$8 Binding 0
$H$9 Node 6 (destination) Shipments -1 $H$9=$J$9 Binding 0
Gorman construction problem
Arc Distance Decision variables Unit shipped
Node 1 - Node 2 25 0 Node In Out
Node 1 - Node 3 20 1 Node 1(origin) 1
Node 2 - Node 3 3 0 Node 2 1 1
Node 1 - Node 4 5 1 Node 3 1 1
Node 1 - Node 5 14 0 Node 4 1 1
Node 3 - Node 2 3 1 Node 5 0 0
Node 3 - Node 5 6 0 Node 6 (destination) 1
Node 4 - Node 2 5 0
Node 4 - Node 5 4 0
Node 4 - Node 6 4 1
Node 5 - Node 3 6 0
Node 5 - Node 4 4 0 Minimize total mileage 32
Node 5 - Node 6 7 0
Net
Shipments Supply
1 = 1
0 = 0
0 = 0
0 = 0
0 = 0 Negative shipment for the consuming nodes
-1 = -1
Microsoft Excel 16.0 Answer Report
Worksheet: [w10_AsignmentProblem.xlsx]Ex5, Maximal Flow Problem
Report Created: 4/22/2022 9:01:09 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.063 Seconds.
Iterations: 13 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$C$17 Node 7 - Node 1 Decision variables 0 14

Variable Cells
Cell Name Original Value Final Value Integer
$C$3 Node 1 - Node 2 Decision variables 0 3 Contin
$C$4 Node 1 - Node 3 Decision variables 0 6 Contin
$C$5 Node 1 - Node 4 Decision variables 0 5 Contin
$C$6 Node 2 - Node 3 Decision variables 0 0 Contin
$C$7 Node 2 - Node 5 Decision variables 0 3 Contin
$C$8 Node 3 - Node 2 Decision variables 0 0 Contin
$C$9 Node 3 - Node 4 Decision variables 0 0 Contin
$C$10 Node 3 - Node 5 Decision variables 0 3 Contin
$C$11 Node 3 - Node 6 Decision variables 0 3 Contin
$C$12 Node 4 - Node 6 Decision variables 0 5 Contin
$C$13 Node 5 - Node 6 Decision variables 0 0 Contin
$C$14 Node 5 - Node7 Decision variables 0 7 Contin
$C$15 Node 6 - Node 5 Decision variables 0 1 Contin
$C$16 Node 6 - Node 7 Decision variables 0 7 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$H$4 Node 1(origin) Shipments 0 $H$4=$J$4 Binding 0
$H$5 Node 2 Shipments 0 $H$5=$J$5 Binding 0
$H$6 Node 3 Shipments 0 $H$6=$J$6 Binding 0
$H$7 Node 4 Shipments 0 $H$7=$J$7 Binding 0
$H$8 Node 5 Shipments 0 $H$8=$J$8 Binding 0
$H$9 Node 6 Shipments 0 $H$9=$J$9 Binding 0
$H$10 Node 7 (destination) Shipments 0 $H$10=$J$10 Binding 0
$C$3 Node 1 - Node 2 Decision variables 3 $C$3<=$B$3 Not Binding 2
$C$4 Node 1 - Node 3 Decision variables 6 $C$4<=$B$4 Binding 0
$C$5 Node 1 - Node 4 Decision variables 5 $C$5<=$B$5 Binding 0
$C$6 Node 2 - Node 3 Decision variables 0 $C$6<=$B$6 Not Binding 2
$C$7 Node 2 - Node 5 Decision variables 3 $C$7<=$B$7 Binding 0
$C$8 Node 3 - Node 2 Decision variables 0 $C$8<=$B$8 Not Binding 2
$C$9 Node 3 - Node 4 Decision variables 0 $C$9<=$B$9 Not Binding 3
$C$10 Node 3 - Node 5 Decision variables 3 $C$10<=$B$10 Binding 0
$C$11 Node 3 - Node 6 Decision variables 3 $C$11<=$B$11 Not Binding 4
$C$12 Node 4 - Node 6 Decision variables 5 $C$12<=$B$12 Binding 0
$C$13 Node 5 - Node 6 Decision variables 0 $C$13<=$B$13 Not Binding 1
$C$14 Node 5 - Node7 Decision variables 7 $C$14<=$B$14 Not Binding 1
$C$15 Node 6 - Node 5 Decision variables 1 $C$15<=$B$15 Binding 0
$C$16 Node 6 - Node 7 Decision variables 7 $C$16<=$B$16 Binding 0
Microsoft Excel 16.0 Answer Report
Worksheet: [w10_AsignmentProblem.xlsx]Ex5, Maximal Flow Problem
Report Created: 4/22/2022 11:24:42 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.078 Seconds.
Iterations: 13 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$C$17 Node 7 - Node 1 Decision variables 0 14

Variable Cells
Cell Name Original Value Final Value Integer
$C$3 Node 1 - Node 2 Decision variables 0 3 Contin
$C$4 Node 1 - Node 3 Decision variables 0 6 Contin
$C$5 Node 1 - Node 4 Decision variables 0 5 Contin
$C$6 Node 2 - Node 3 Decision variables 0 0 Contin
$C$7 Node 2 - Node 5 Decision variables 0 3 Contin
$C$8 Node 3 - Node 2 Decision variables 0 0 Contin
$C$9 Node 3 - Node 4 Decision variables 0 0 Contin
$C$10 Node 3 - Node 5 Decision variables 0 3 Contin
$C$11 Node 3 - Node 6 Decision variables 0 3 Contin
$C$12 Node 4 - Node 6 Decision variables 0 5 Contin
$C$13 Node 5 - Node 6 Decision variables 0 0 Contin
$C$14 Node 5 - Node7 Decision variables 0 7 Contin
$C$15 Node 6 - Node 5 Decision variables 0 1 Contin
$C$16 Node 6 - Node 7 Decision variables 0 7 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$H$4 Node 1(origin) Shipments 0 $H$4=$J$4 Binding 0
$H$5 Node 2 Shipments 0 $H$5=$J$5 Binding 0
$H$6 Node 3 Shipments 0 $H$6=$J$6 Binding 0
$H$7 Node 4 Shipments 0 $H$7=$J$7 Binding 0
$H$8 Node 5 Shipments 0 $H$8=$J$8 Binding 0
$H$9 Node 6 Shipments 0 $H$9=$J$9 Binding 0
$H$10 Node 7 (destination) Shipments 0 $H$10=$J$10 Binding 0
$C$3 Node 1 - Node 2 Decision variables 3 $C$3<=$B$3 Not Binding 2
$C$4 Node 1 - Node 3 Decision variables 6 $C$4<=$B$4 Binding 0
$C$5 Node 1 - Node 4 Decision variables 5 $C$5<=$B$5 Binding 0
$C$6 Node 2 - Node 3 Decision variables 0 $C$6<=$B$6 Not Binding 2
$C$7 Node 2 - Node 5 Decision variables 3 $C$7<=$B$7 Binding 0
$C$8 Node 3 - Node 2 Decision variables 0 $C$8<=$B$8 Not Binding 2
$C$9 Node 3 - Node 4 Decision variables 0 $C$9<=$B$9 Not Binding 3
$C$10 Node 3 - Node 5 Decision variables 3 $C$10<=$B$10 Binding 0
$C$11 Node 3 - Node 6 Decision variables 3 $C$11<=$B$11 Not Binding 4
$C$12 Node 4 - Node 6 Decision variables 5 $C$12<=$B$12 Binding 0
$C$13 Node 5 - Node 6 Decision variables 0 $C$13<=$B$13 Not Binding 1
$C$14 Node 5 - Node7 Decision variables 7 $C$14<=$B$14 Not Binding 1
$C$15 Node 6 - Node 5 Decision variables 1 $C$15<=$B$15 Binding 0
$C$16 Node 6 - Node 7 Decision variables 7 $C$16<=$B$16 Binding 0
Cincinati traffic network
Arc Capacity Decision variables Unit shipped
Node In Out
x12 3 3 Node 1(origin) 11 11
x13 6 5 Node 2 4 4
x14 3 3 Node 3 5 5
x24 2 0 Node 4 6 6
x25 4 4 Node 5 6 6
x34 3 3 Node 6 11 11
x36 2 2
x42 2 1
x43 3 0
x45 2 2
x46 3 3
x52 4 0
x54 2 0
x56 6 6 Maximize x61
x61 11
Net
Shipments Supply
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0 Nodes 1,7 become transshipment node
0 = 0
Cincinati traffic network
Arc Capacity Decision variables Unit shipped
Node 1 - Node 2 5 3 Node In Out
Node 1 - Node 3 6 6 Node 1(origin) 14 14
Node 1 - Node 4 5 5 Node 2 3 3
Node 2 - Node 3 2 0 Node 3 6 6
Node 2 - Node 5 3 3 Node 4 5 5
Node 3 - Node 2 2 0 Node 5 7 7
Node 3 - Node 4 3 0 Node 6 8 8
Node 3 - Node 5 3 3 Node 7 (destination) 14 14
Node 3 - Node 6 7 3
Node 4 - Node 6 5 5
Node 5 - Node 6 1 0
Node 5 - Node7 8 7
Node 6 - Node 5 1 1
Node 6 - Node 7 7 7
Node 7 - Node 1 14 Maximize x71
Net
Shipments Supply
0 = 0
0 = 0
0 = 0
0 = 0
0 = 0 Nodes 1,7 become transshipment node
0 = 0
0 = 0

You might also like