Customer 1 Customer 2 Customer 3 Customer 4 Gap Supply

Plant 1 0 0 500 100 0 600= 600

Plant 2 250 330 0 0 120 700= 700
Plant 3 0 50 0 450 0 500= 500
Customer 1 Customer 2 Customer 3 Customer 4 GAP Supply =
Plant 1 18 16 10 14 0 600
Plant 2 14 13 15 18 0 700 250 380 500 550 120 1800
Plant 3 15 12 12 16 0 500 = = = = =
Demand 250 380 500 550 Demand 250 380 500 550 120

Cost 21990
Microsoft Excel 16.0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 01-03-2024 20:47:50
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 10 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$O$14 Cost = 21990 21990

Variable Cells
Cell Name Original Value Final Value Integer
$K$4 Plant 1 Customer 1 0 0Contin
$L$4 Plant 1 Customer 2 0 0Contin
$M$4 Plant 1 Customer 3 500 500Contin
$N$4 Plant 1 Customer 4 100 100Contin
$O$4 Plant 1 Gap 0 0Contin
$K$5 Plant 2 Customer 1 250 250Contin
$L$5 Plant 2 Customer 2 330 330Contin
$M$5 Plant 2 Customer 3 0 0Contin
$N$5 Plant 2 Customer 4 0 0Contin
$O$5 Plant 2 Gap 120 120Contin
$K$6 Plant 3 Customer 1 0 0Contin
$L$6 Plant 3 Customer 2 50 50Contin
$M$6 Plant 3 Customer 3 0 0Contin
$N$6 Plant 3 Customer 4 450 450Contin
$O$6 Plant 3 Gap 0 0Contin

Constraints
Cell Name Cell Value Formula Status Slack
$K$9 Plant 2 Customer 1 250$K$9=$K$11 Binding 0
$L$9 Plant 2 Customer 2 380$L$9=$L$11 Binding 0
$M$9 Plant 2 Customer 3 500$M$9=$M$11 Binding 0
$N$9 Plant 2 Customer 4 550$N$9=$N$11 Binding 0
$O$9 Plant 2 Gap 120$O$9=$O$11 Binding 0
$Q$4 Plant 1 600$Q$4=$S$4 Binding 0
$Q$5 Plant 2 700$Q$5=$S$5 Binding 0
$Q$6 Plant 3 500$Q$6=$S$6 Binding 0
 DC1 DC2 DC3 Gap Supply
Boston 50 0 250 0 300= 300
Toronto 150 300 0 50 500= 500

200 300 250 50

= = = =
Demand 200 300 250 50

DC1 DC2 DC3 Gap Supply Transportation Cost 3050

Boston 5 6 4 0 <= 300
Toronto 6 3 7 0 <= 500

<= <= <= <=

Demand 200 300 250 50
Microsoft Excel 16.0 Answer Report
Worksheet: [Book1]Sheet4
Report Created: 01-03-2024 22:28:15
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 7 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$N$11 Transportation Cost = 3050 3050

Variable Cells
Cell Name Original Value Final Value Integer
$L$3 Boston DC1 50 50Contin
$M$3 Boston DC2 0 0Contin
$N$3 Boston DC3 250 250Contin
$O$3 Boston Gap 0 0Contin
$L$4 Toronto DC1 150 150Contin
$M$4 Toronto DC2 300 300Contin
$N$4 Toronto DC3 0 0Contin
$O$4 Toronto Gap 50 50Contin

Constraints
Cell Name Cell Value Formula Status Slack
$L$6 DC1 200$L$6=$L$8 Binding 0
$M$6 DC2 300$M$6=$M$8 Binding 0
$N$6 DC3 250$N$6=$N$8 Binding 0
$O$6 Gap 50$O$6=$O$8 Binding 0
$Q$3 Boston 300$Q$3=$S$3 Binding 0
$Q$4 Toronto 500$Q$4=$S$4 Binding 0
 A B Z
1200 900 5197.2973
Values 1.8918919 3.2522523

Constraints 140 60 460= 460

25 90 340= 340
Microsoft Excel 16.0 Answer Report
Worksheet: [Assignment 1st.xlsx]Sheet6
Report Created: 04-03-2024 20:31:52
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 2 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
$O$3 Z 5197.297297 5197.297297

Variable Cells
Cell Name Original Value Final Value Integer
$L$4 Values A 1.891891892 1.891891892Contin
$M$4 Values B 3.252252252 3.252252252Contin

Constraints
Cell Name Cell Value Formula Status Slack
$N$6 Constraints 460$N$6=$P$6 Binding 0
$N$7 340$N$7=$P$7 Binding 0
 Distribution Centre
D1 D2 D3 D4 Requirement
P1 2 3 11 7 6
Plant P2 1 2 6 1 1
P3 5 8 15 9 10
gap 0 0 0 0 1
Supply 7 5 3 3

Distribution Centre
D1 D2 D3 D4 Requirement
P1 0 5 1 0 6 = 6
Plant P2 0 0 1 0 1 = 1
P3 7 0 0 3 10 = 10
gap 0 0 1 0 1 = 1
7 5 3 3
= = = = =
Supply 7 5 3 3

Cost 94
Microsoft Excel 16.0 Answer Report
Worksheet: [Assignment 1st.xlsx]Question 4
Report Created: 04-03-2024 21:44:43
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 11 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
$M$23 Cost = 94 94

Variable Cells
Cell Name Original Value Final Value Integer
$L$13 P1 D1 0 0Contin
$M$13 P1 D2 5 5Contin
$N$13 P1 D3 1 1Contin
$O$13 P1 D4 0 0Contin
$L$14 P2 D1 0 0Contin
$M$14 P2 D2 0 0Contin
$N$14 P2 D3 1 1Contin
$O$14 P2 D4 0 0Contin
$L$15 P3 D1 7 7Contin
$M$15 P3 D2 0 0Contin
$N$15 P3 D3 0 0Contin
$O$15 P3 D4 3 3Contin
$L$16 gap D1 0 0Contin
$M$16 gap D2 0 0Contin
$N$16 gap D3 1 1Contin
$O$16 gap D4 0 0Contin

Constraints
Cell Name Cell Value Formula Status Slack
$L$17 D1 7$L$17=$L$19 Binding 0
$M$17 D2 5$M$17=$M$19 Binding 0
$N$17 D3 3$N$17=$N$19 Binding 0
$O$17 D4 3$O$17=$O$19 Binding 0
$P$13 P1 6$P$13=$S$13 Binding 0
$P$14 P2 1$P$14=$S$14 Binding 0
$P$15 P3 10$P$15=$S$15 Binding 0
$P$16 gap 1$P$16=$S$16 Binding 0
 M1 M2 Profit
3 4 110
Values 10 20

Constraints
Polishing 2 5 120= 120
Ggrinding 4 2 80= 80
Microsoft Excel 16.0 Answer Report
Worksheet: [Assignment 1st.xlsx]Sheet4
Report Created: 04-03-2024 22:15:48
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 2 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
$O$3 Profit 110 110

Variable Cells
Cell Name Original Value Final Value Integer
$K$4 Values M1 10 10Contin
$L$4 Values M2 20 20Contin

Constraints
Cell Name Cell Value Formula Status Slack
$N$7 Polishing 120$N$7=$P$7 Binding 0
$N$8 Ggrinding 80$N$8=$P$8 Binding 0