0% found this document useful (0 votes)
54 views4 pages

Cell Name Original Value Final Value

The document is a report from Microsoft Excel that summarizes the results of using Solver to find an optimal solution that satisfies all constraints for allocating machines to locations. Solver was able to find a solution in 21 iterations over 0.047 seconds that allocated machines to locations in a way that satisfied all constraints and achieved an optimal objective value of 16. The report provides details on the solver settings used, the values of decision variables and objective function before and after solving, as well as information on constraints and their statuses.
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
0% found this document useful (0 votes)
54 views4 pages

Cell Name Original Value Final Value

The document is a report from Microsoft Excel that summarizes the results of using Solver to find an optimal solution that satisfies all constraints for allocating machines to locations. Solver was able to find a solution in 21 iterations over 0.047 seconds that allocated machines to locations in a way that satisfied all constraints and achieved an optimal objective value of 16. The report provides details on the solver settings used, the values of decision variables and objective function before and after solving, as well as information on constraints and their statuses.
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/ 4

Microsoft Excel 16.

0 Answer Report
Worksheet: [ANSWER.xlsx]Sheet1
Report Created: 25-09-2019 14:05:50
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 21 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$22 Objectibve 0 16

Variable Cells
Cell Name Original Value Final Value Integer
$C$13 Location 0 0 Binary
$D$13 0 0 Binary
$E$13 0 1 Binary
$F$13 0 0 Binary
$G$13 0 0 Binary
$C$14 Location 0 0 Binary
$D$14 0 1 Binary
$E$14 0 0 Binary
$F$14 0 0 Binary
$G$14 0 0 Binary
$C$15 Location 0 1 Binary
$D$15 0 0 Binary
$E$15 0 0 Binary
$F$15 0 0 Binary
$G$15 0 0 Binary
$C$16 Location 0 0 Binary
$D$16 0 0 Binary
$E$16 0 0 Binary
$F$16 0 1 Binary
$G$16 0 0 Binary
$C$17 Location 0 0 Binary
$D$17 0 0 Binary
$E$17 0 0 Binary
$F$17 0 0 Binary
$G$17 0 1 Binary
Constraints
Cell Name Cell Value Formula Status Slack
$C$18 sumof location Location 1 $C$18=$C$19 Binding 0
$D$18 sumof location 1 $D$18=$D$19 Binding 0
$E$18 sumof location 1 $E$18=$E$19 Binding 0
$F$18 sumof location 1 $F$18=$F$19 Binding 0
$G$18 sumof location 1 $G$18=$G$19 Binding 0
$H$13 SUM of machine in a loctaion 1 $H$13=$I$13 Binding 0
$H$14 SUM of machine in a loctaion 1 $H$14=$I$14 Binding 0
$H$15 SUM of machine in a loctaion 1 $H$15=$I$15 Binding 0
$H$16 SUM of machine in a loctaion 1 $H$16=$I$16 Binding 0
$H$17 SUM of machine in a loctaion 1 $H$17=$I$17 Binding 0
$C$13:$G$17=Binary
j
Location
Machine 1 2 3 4 5
i 1 13 16 12 14 15
2 15 1000 13 20 16
3 4 7 10 6 7
4 0 0 0 0 0
5 0 0 0 0 0

Location
Machine 1 2 3 4 5
1 0 0 0 1 0
2 0 0 1 0 0
3 1 0 0 0 0
4 0 1 0 0 0
5 0 0 0 0 1
sumof location 1 1 1 1 1
GOAL 1 1 1 1 1

Objective 31
SUM of machine in a loctaion Goal
1 1
1 1
1 1
1 1
1 1

You might also like