x1 x2 x3 x4 Total 1/V V

Cc 0 0 0 0 0 #DIV/0!
of 1 1 1 1
Prob

CONS EOQ
5 4 6 0 0 >= 1
2 0 4 8 0 >= 1
4 3 7 1 0 >= 1
6 2 8 2 0 >= 1
Microsoft Excel 16.0 Answer Report
Worksheet: [Book1]Sheet2
Report Created: 31-05-2023 12:19:20
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 5 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
$F$2 CC TOTAL VALUE 0 0.2083333333

Variable Cells
Cell Name Original Value Final Value Integer
$B$2 CC X1 0 0 Contin
$C$2 CC X2 0 0 Contin
$D$2 CC X3 0 0.1666666667 Contin
$E$2 CC X4 0 0.0416666667 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$H$8 C1 CONST 1 $H$8>=$J$8 Binding 0
$H$9 C2 CONST 1 $H$9>=$J$9 Binding 0
$H$10 C3 CONST 1.2083333333 $H$10>=$J$10 Not Binding 0.208333333
$H$11 C4 CONST 1.4166666667 $H$11>=$J$11 Not Binding 0.416666667
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Book1]Sheet2
Report Created: 31-05-2023 12:19:20

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$2 CC X1 0 0.333333333 1 1E+030 0.333333333
$C$2 CC X2 0 0.666666667 1 1E+030 0.666666667
$D$2 CC X3 0.166666667 0 1 0.4 0.5
$E$2 CC X4 0.041666667 0 1 1 1

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$H$8 C1 CONST 1 0.083333333 1 0.5 0.192307692
$H$9 C2 CONST 1 0.125 1 1E+030 0.333333333
$H$10 C3 CONST 1.208333333 0 1 0.208333333 1E+030
$H$11 C4 CONST 1.416666667 0 1 0.416666667 1E+030
 X1 X2 X3 X4 TOTAL VALUE V
CC 0 0 0.166667 0.041667 0.208333333 4.8
0F 1 1 1 1
PROB

X1 X2 X3 X4 CONST EQ
C1 5 4 6 0 1 >= 1
C2 2 0 4 8 1 >= 1
C3 4 3 7 1 1.208333 >= 1
C4 6 2 8 2 1.416667 >= 1
Microsoft Excel 16.0 Answer Report
Worksheet: [ekta.xlsx]Sheet3
Report Created: 01-06-2023 15:30:28
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 27 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
$L$14 A TOTAL COST SET OBJ 408 399

Variable Cells
Cell Name Original Value Final Value Integer
$E$14 AP 1 0 Binary
$F$14 AQ 0 0 Binary
$G$14 AR 0 0 Binary
$H$14 AS 0 0 Binary
$I$14 AT 0 1 Binary
$E$15 BP 0 0 Binary
$F$15 BQ 1 0 Binary
$G$15 BR 0 1 Binary
$H$15 BS 0 0 Binary
$I$15 BT 0 0 Binary
$E$16 CP 0 0 Binary
$F$16 CQ 0 0 Binary
$G$16 CR 1 0 Binary
$H$16 CS 0 1 Binary
$I$16 CT 0 0 Binary
$E$17 DP 0 1 Binary
$F$17 DQ 0 0 Binary
$G$17 DR 0 0 Binary
$H$17 DS 1 0 Binary
$I$17 DT 0 0 Binary
$E$18 EP 0 0 Binary
$F$18 EQ 0 1 Binary
$G$18 ER 0 0 Binary
$H$18 ES 0 0 Binary
$I$18 ET 1 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$E$19 TOTAL P 1 $E$19=$E$20 Binding 0
$F$19 TOTAL Q 1 $F$19=$F$20 Binding 0
$G$19 TOTAL R 1 $G$19=$G$20 Binding 0
$H$19 TOTAL S 1 $H$19=$H$20 Binding 0
$I$19 TOTAL T 1 $I$19=$I$20 Binding 0
$J$14 A TOTAL 1 $J$14=$K$14 Binding 0
$J$15 B TOTAL 1 $J$15=$K$15 Binding 0
$J$16 C TOTAL 1 $J$16=$K$16 Binding 0
$J$17 D TOTAL 1 $J$17=$K$17 Binding 0
$J$18 E TOTAL 1 $J$18=$K$18 Binding 0
$E$14:$I$18=Binary
 JOB
P Q R S T
A 85 75 65 125 75
B 90 78 66 132 78
C 75 66 57 114 69
D 80 72 60 120 72
E 76 64 56 112 68

CHANGING CELL
P Q R S T TOTAL
A 0 0 0 0 1 1
B 0 0 1 0 0 1
C 0 0 0 1 0 1
D 1 0 0 0 0 1
E 0 1 0 0 0 1
TOTAL 1 1 1 1 1
DEMAND 1 1 1 1 1
SUPPLY TOTAL COST (SET OBJ)
1 399
1
1
1
1
Microsoft Excel 16.0 Answer Report
Worksheet: [EKTA SINGH.xlsx]Sheet4
Report Created: 02-06-2023 10:43:29
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 22 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
$K$14 PROG 1 TC 330 260

Variable Cells
Cell Name Original Value Final Value Integer
$D$14 PROG 1 A 1 0 Binary
$E$14 PROG 1 B 0 0 Binary
$F$14 PROG 1 C 0 1 Binary
$G$14 PROG 1 D 0 0 Binary
$H$14 PROG 1 E 0 0 Binary
$D$15 PROG 2 A 0 0 Binary
$E$15 PROG 2 B 1 0 Binary
$F$15 PROG 2 C 0 0 Binary
$G$15 PROG 2 D 0 1 Binary
$H$15 PROG 2 E 0 0 Binary
$D$16 PROG 3 A 0 1 Binary
$E$16 PROG 3 B 0 0 Binary
$F$16 PROG 3 C 1 0 Binary
$G$16 PROG 3 D 0 0 Binary
$H$16 PROG 3 E 0 0 Binary
$D$17 DUMMY A 0 0 Binary
$E$17 DUMMY B 0 0 Binary
$F$17 DUMMY C 0 0 Binary
$G$17 DUMMY D 1 0 Binary
$H$17 DUMMY E 0 1 Binary
$D$18 DUMMY A 0 0 Binary
$E$18 DUMMY B 0 1 Binary
$F$18 DUMMY C 0 0 Binary
$G$18 DUMMY D 0 0 Binary
$H$18 DUMMY E 1 0 Binary
Constraints
Cell Name Cell Value Formula Status Slack
$D$19 TOTAL A 1 $D$19=$D$20 Binding 0
$E$19 TOTAL B 1 $E$19=$E$20 Binding 0
$F$19 TOTAL C 1 $F$19=$F$20 Binding 0
$G$19 TOTAL D 1 $G$19=$G$20 Binding 0
$H$19 TOTAL E 1 $H$19=$H$20 Binding 0
$I$14 PROG 1 TOTAL 1 $I$14=$J$14 Binding 0
$I$15 PROG 2 TOTAL 1 $I$15=$J$15 Binding 0
$I$16 PROG 3 TOTAL 1 $I$16=$J$16 Binding 0
$I$17 DUMMY TOTAL 1 $I$17=$J$17 Binding 0
$I$18 DUMMY TOTAL 1 $I$18=$J$18 Binding 0
$D$14:$H$18=Binary
 A B C D E
PROG 1 120 100 80 90 130
PROG 2 80 90 110 70 110
PROG 3 110 140 120 130 160
DUMMY 0 0 0 0 0
DUMMY 0 0 0 0

A B C D E TOTAL SUPPLY
PROG 1 0 0 1 0 0 1 1
PROG 2 0 0 0 1 0 1 1
PROG 3 1 0 0 0 0 1 1
DUMMY 1 0 0 0 0 1 1 1
DUMMY 2 0 1 0 0 0 1 1
TOTAL 1 1 1 1 1
DEMAND 1 1 1 1 1
 1. SET OBJECTIVE
TC 2. MAXMIN
260 3. CHANGING CELL
4. ADD CONSTRAINTS
5. SIMPLE LP
Microsoft Excel 16.0 Answer Report
Worksheet: [EKTA SINGH.xlsx]Sheet6
Report Created: 02-06-2023 11:14:57
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.063 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
$X$21 A SET OBJ 360 1200

Variable Cells
Cell Name Original Value Final Value Integer
$Q$21 A A 1 150 Contin
$R$21 A B 1 0 Contin
$S$21 A X 1 300 Contin
$T$21 A Y 1 150 Contin
$U$21 A Z 1 0 Contin
$Q$22 B A 1 300 Contin
$R$22 B B 1 450 Contin
$S$22 B X 1 0 Contin
$T$22 B Y 1 0 Contin
$U$22 B Z 1 0 Contin
$Q$23 X A 1 0 Contin
$R$23 X B 1 0 Contin
$S$23 X X 1 300 Contin
$T$23 X Y 1 0 Contin
$U$23 X Z 1 150 Contin
$Q$24 Y A 1 0 Contin
$R$24 Y B 1 0 Contin
$S$24 Y X 1 0 Contin
$T$24 Y Y 1 450 Contin
$U$24 Y Z 1 0 Contin
$Q$25 Z A 1 0 Contin
$R$25 Z B 1 0 Contin
$S$25 Z X 1 0 Contin
$T$25 Z Y 1 0 Contin
$U$25 Z Z 1 450 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$Q$26 TOTAL A 450 $Q$26=$Q$27 Binding 0
$R$26 TOTAL B 450 $R$26=$R$27 Binding 0
$S$26 TOTAL X 600 $S$26=$S$27 Binding 0
$T$26 TOTAL Y 600 $T$26=$T$27 Binding 0
$U$26 TOTAL Z 600 $U$26=$U$27 Binding 0
$V$21 A 600 $V$21>=$W$21 Binding 0
$V$22 B 750 $V$22>=$W$22 Binding 0
$V$23 X 450 $V$23>=$W$23 Binding 0
$V$24 Y 450 $V$24>=$W$24 Binding 0
$V$25 Z 450 $V$25>=$W$25 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [EKTA SINGH.xlsx]Sheet6
Report Created: 02-06-2023 11:14:58

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$Q$21 A A 150 0 0 4 1
$R$21 A B 0 66 65 1E+030 66
$S$21 A X 300 0 1 1 2
$T$21 A Y 150 0 3 1 1
$U$21 A Z 0 13 15 1E+030 13
$Q$22 B A 300 0 1 1 4
$R$22 B B 450 0 0 7 1E+030
$S$22 B X 0 1 3 1E+030 1
$T$22 B Y 0 1 5 1E+030 1
$U$22 B Z 0 22 25 1E+030 22
$Q$23 X A 0 4 3 1E+030 4
$R$23 X B 0 17 15 1E+030 17
$S$23 X X 300 0 0 2 1
$T$23 X Y 0 21 23 1E+030 21
$U$23 X Z 150 0 1 1 2
$Q$24 Y A 0 28 25 1E+030 28
$R$24 Y B 0 7 3 1E+030 7
$S$24 Y X 0 3 1 1E+030 3
$T$24 Y Y 450 0 0 1 1E+030
$U$24 Y Z 0 4 3 1E+030 4
$Q$25 Z A 0 47 45 1E+030 47
$R$25 Z B 0 58 55 1E+030 58
$S$25 Z X 0 66 65 1E+030 66
$T$25 Z Y 0 2 3 1E+030 2
$U$25 Z Z 450 0 0 2 1

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$Q$26 TOTAL A 450 -3 450 150 0
$R$26 TOTAL B 450 -4 450 150 0
$S$26 TOTAL X 600 -2 600 150 0
$T$26 TOTAL Y 600 0 600 1E+030 0
$U$26 TOTAL Z 600 -1 600 150 0
$V$21 A 600 3 600 0 150
$V$22 B 750 4 750 0 150
$V$23 X 450 2 450 0 150
$V$24 Y 450 0 450 0 1E+030
$V$25 Z 450 1 450 0 150
 P Q R S
A 2 4 6 11
B 10 8 7 5
C 13 3 9 12
D 4 6 8 3

A B X Y Z CAPACITY
A 0 65 1 3 15
B 1 0 3 5 25
X 1 15 0 23 1
Y 25 3 1 0 3
Z 45 55 65 3

REPL.
 A B X Y Z CAPACITY
A 0 65 1 3 15 600
B 1 0 3 5 25 750
X 3 15 0 23 1 450
Y 25 3 1 0 3 450
Z 45 55 65 3 0 450
REPLA. 450 450 600 600 600

A B X Y
A 150 0 300 150
B 300 450 0 0
X 0 0 300 0
Y 0 0 0 450
Z 0 0 0 0
TOTAL 450 450 600 600
REPLA. 450 450 600 600
Z CAPACITY SET OBJ
0 600 600 1200
0 750 750
150 450 450
0 450 450
450 450 450
600
600
Microsoft Excel 16.0 Answer Report
Worksheet: [EKTA SINGH.xlsx]Sheet5
Report Created: 03-06-2023 10:40:43
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 15 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
$K$4 SUPPLY TOTAL 111 950

Variable Cells
Cell Name Original Value Final Value Integer
$D$14 A P 1 25 Contin
$E$14 A Q 1 5 Contin
$F$14 A R 1 20 Contin
$G$14 A S 1 0 Contin
$H$14 A T 1 0 Contin
$D$15 B P 1 0 Contin
$E$15 B Q 1 0 Contin
$F$15 B R 1 70 Contin
$G$15 B S 1 0 Contin
$H$15 B T 1 0 Contin
$D$16 C P 1 0 Contin
$E$16 C Q 1 30 Contin
$F$16 C R 1 0 Contin
$G$16 C S 1 0 Contin
$H$16 C T 1 0 Contin
$D$17 D P 1 0 Contin
$E$17 D Q 1 0 Contin
$F$17 D R 1 15 Contin
$G$17 D S 1 20 Contin
$H$17 D T 1 15 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$D$18 P 25 $D$18=$D$19 Binding 0
$E$18 Q 35 $E$18=$E$19 Binding 0
$F$18 R 105 $F$18=$F$19 Binding 0
$G$18 S 20 $G$18=$G$19 Binding 0
$H$18 T 15 $H$18=$H$19 Binding 0
$I$14 A SUPPLY 50 $I$14>=$J$14 Binding 0
$I$15 B SUPPLY 70 $I$15>=$J$15 Binding 0
$I$16 C SUPPLY 30 $I$16>=$J$16 Binding 0
$I$17 D SUPPLY 50 $I$17>=$J$17 Binding 0
NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [EKTA SINGH.xlsx]Sheet5
Report Created: 03-06-2023 10:40:44

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$D$14 AP 25 0 2 0 1E+030
$E$14 AQ 5 0 4 0 1
$F$14 AR 20 0 6 2 0
$G$14 AS 0 10 11 1E+030 10
$H$14 AT 0 2 0 1E+030 2
$D$15 BP 0 7 10 1E+030 7
$E$15 BQ 0 3 8 1E+030 3
$F$15 BR 70 0 7 1 2
$G$15 BS 0 3 5 1E+030 3
$H$15 BT 0 1 0 1E+030 1
$D$16 CP 0 12 13 1E+030 12
$E$16 CQ 30 0 3 1 1E+030
$F$16 CR 0 4 9 1E+030 4
$G$16 CS 0 12 12 1E+030 12
$H$16 CT 0 3 0 1E+030 3
$D$17 DP 0 0 4 1E+030 0
$E$17 DQ 0 0 6 1E+030 0
$F$17 DR 15 0 8 0 1
$G$17 DS 20 0 3 3 1E+030
$H$17 DT 15 0 0 1 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$18 P 25 1 25 5 0
$E$18 Q 35 3 35 1E+030 0
$F$18 R 105 5 105 5 0
$G$18 S 20 0 20 5 0
$H$18 T 15 -3 15 5 0
$I$14 A SUPPLY 50 1 50 0 5
$I$15 B SUPPLY 70 2 70 0 5
$I$16 C SUPPLY 30 0 30 0 1E+030
$I$17 D SUPPLY 50 3 50 0 5
 DESTINATION

UNIT CELL P Q R S T SUPPLY

A 2 4 6 11 0 50
B 10 8 7 5 0 70
C 13 3 9 12 0 30
D 4 6 8 3 0 50
DEMAND 25 35 105 20 15

P Q R S T SUPPLY
A 25 5 20 0 0 50 50
B 0 0 70 0 0 70 70
C 0 30 0 0 0 30 30
D 0 0 15 20 15 50 50
25 35 105 20 15
DEMAND 25 35 105 20 15
TOTAL
950
Microsoft Excel 16.0 Answer Report
Worksheet: [EKTA SINGH.xlsx]Sheet9
Report Created: 03-06-2023 11:01:23
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 12 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
$J$12 TOTAL 400 124

Variable Cells
Cell Name Original Value Final Value Integer
$D$16 A A 1 0 Contin
$E$16 A B 0 0 Contin
$F$16 A C 0 1 Contin
$G$16 A D 0 0 Contin
$D$17 B A 0 0 Contin
$E$17 B B 1 0 Contin
$F$17 B C 0 0 Contin
$G$17 B D 0 1 Contin
$D$18 C A 0 0 Contin
$E$18 C B 0 1 Contin
$F$18 C C 1 0 Contin
$G$18 C D 0 0 Contin
$D$19 D A 0 1 Contin
$E$19 D B 0 0 Contin
$F$19 D C 0 0 Contin
$G$19 D D 1 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$D$20 A 1 $D$20=$D$21 Binding 0
$E$20 B 1 $E$20=$E$21 Binding 0
$F$20 C 1 $F$20=$F$21 Binding 0
$G$20 D 1 $G$20=$G$21 Binding 0
$H$16 A 1 $H$16=$I$16 Binding 0
$H$17 B 1 $H$17=$I$17 Binding 0
$H$18 C 1 $H$18=$I$18 Binding 0
$H$19 D 1 $H$19=$I$19 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [EKTA SINGH.xlsx]Sheet9
Report Created: 03-06-2023 11:01:24

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$D$16 A A 0 60 100 1E+030 60
$E$16 A B 0 5 45 1E+030 5
$F$16 A C 1 0 15 21 1E+030
$G$16 A D 0 0 39 5 21
$D$17 B A 0 0 40 5 21
$E$17 B B 0 60 100 1E+030 60
$F$17 B C 0 34 49 1E+030 34
$G$17 B D 1 0 39 21 5
$D$18 C A 0 50 81 1E+030 50
$E$18 C B 1 0 31 29 1E+030
$F$18 C C 0 94 100 1E+030 94
$G$18 C D 0 29 59 1E+030 29
$D$19 D A 1 0 39 21 5
$E$19 D B 0 0 39 5 29
$F$19 D C 0 21 35 1E+030 21
$G$19 D D 0 62 100 1E+030 62

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$20 A 1 31 1 0 1
$E$20 B 1 31 1 0 1
$F$20 C 1 6 1 0 1
$G$20 D 1 30 1 0 1
$H$16 A 1 9 1 1 0
$H$17 B 1 9 1 1 0
$H$18 C 1 0 1 0 1E+030
$H$19 D 1 8 1 1 0
TRAVELLING SALESMEN PROBLEM

TO A B C D
FROM TOTAL
A 100 45 15 39 15
B 40 100 49 39 39
C 81 31 100 59 31
D 39 39 35 100 39
124

TO A B C D SUPPLY
FROM
A 0 0 1 0 1 1
B 0 0 0 1 1 1
C 0 1 0 0 1 1
D 1 0 0 0 1 1
1 1 1 1
DEMAND 1 1 1 1