Xi # of cars of type i to be produced; i = 1 if family thrillseeker and 2 if classy cruiser

Max 3600 X1 + 5400 X2

s. t.
6 X1 + 10.5 X2 <= 48000 (labour-hours available)
2 X1 + X2 <= 10000 (doors available)
X2 <= 3500 (demand for classy cruiser)
X1, X2 >= 0
Microsoft Excel 15.0 Sensitivity Report
Worksheet: [Solver.xlsx]Wyndor
Report Created: 8/11/2021 6:56:08 PM Reduced cost is an opportunit

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$D$14 Optimal Solutions X1 2 0 3000 4500 3000 If 0 <= c1 <= 7500, then the cu
$E$14 Optimal Solutions X2 6 0 5000 1E+030 3000 If c2 >= 2000. the current opti

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$H$18 Constraint 1 Coefficients 2 0 4 1E+030 2 If b1 >= 2, then the current op
$H$19 Constraint 2 Coefficients 6 3000 6 3 3 If 3 <= b2 <= 9, then the curre
$H$20 Constraint 3 Coefficients 18 1000 18 6 6 If 12 <= b3 <= 24, the the curr

Shadow price is the marginal benefit that you can derive by adding a unit resource
 Reduced cost is an opportunity cost

When we change the coefficients of the o

If 0 <= c1 <= 7500, then the current optimal solution would still be optimal same. As a result, we can identify a range
current optimal solution will still remain op
If c2 >= 2000. the current optimal solution would still be optimal change only one objective coefficient at a
same. The constr

When wa change the RHS of the constraint

we substantially change the value of the
If b1 >= 2, then the current optimal solution would still be feasible optimal. As a result, we can only obtain r
If 3 <= b2 <= 9, then the current optimal solution would still be feasible solution can be feasible. We ca
If 12 <= b3 <= 24, the the current optimal solution would still be feasible

e by adding a unit resource

we change the coefficients of the objective function, the feasible region remains the
s a result, we can identify a range for each objective function coefficient in which the
ptimal solution will still remain optimal. Note that in this sensitivity analysis, we would
only one objective coefficient at a time, and the remaining coefficents will remain the
same. The constraints also remain the same

change the RHS of the constraints, the feasible region also changes. The means that if
stantially change the value of the RHS, the current optimal solution will no longer be
l. As a result, we can only obtain ranges of the RHS within which the current optimal
solution can be feasible. We cannot guarantee optimality in this range.
Microsoft Excel 15.0 Sensitivity Report
Worksheet: [Solver.xlsx]Wyndor
Report Created: 8/11/2021 7:42:00 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$D$14 Optimal Solutions X1 2 0 3000 4500 3000
$E$14 Optimal Solutions X2 6 0 5000 1E+030 3000

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$H$18 Constraint 1 Coefficients 2 0 4 1E+030 2
$H$19 Constraint 2 Coefficients 12 1500 12 6 6
$H$20 Constraint 3 Coefficients 18 1000 18 6 6
2 X2 <= 12
X2 <= 6

2X2 < = 14
X2 <= 7
Microsoft Excel 15.0 Sensitivity Report
Worksheet: [Solver.xlsx]Wyndor
Report Created: 8/13/2021 10:44:35 AM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$O$14 Optimal Solution Y1 0 2 4 1E+030 2
$P$14 Optimal Solution Y2 3000 0 6 3 3
$Q$14 Optimal Solution Y3 1000 0 18 6 6

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$S$18 Constraint 1 Coefficients W 3000 2 3000 4500 3000
$S$19 Constraint 2 Coefficients W 5000 6 5000 1E+030 3000
Xi # of batches of product i to be manufactured; i = 1, 2
Primal Problem
Max 3000 X1 + 5000 X2 Max 3000 X1 + 5000 X2
subject to (s.t.) s. t.
X1 <= 4 (plant 1) X1 + 0 X2 <= 4
2 X2 <= 12 (or) X2 <= 6 (plant 2) 0 X1 + X2 <= 6
3 X1 + 2 X2 <= 18 (plant 3) 3 X1 + 2 X2 <= 18
X1, X2 >= 0 X1, X2 >= 0

Decision Variables X1 X2 X1 >= 4 is equivalent to -X1 <= -4

Optimal Solutions 2 6 Max f(x) = Min - f(x)

Objective Coefficients 3000 5000 Z 36000

Constraint 1 Coefficients 1 0 2 <= 4

Constraint 2 Coefficients 0 2 12 <= 12
Constraint 3 Coefficients 3 2 18 <= 18

b2 b2
4 30000 10 33000
5 33000 11 34500
6 36000 12 36000
7 39000 13 37500
8 42000 14 39000
rimal Problem Dual Problem
3000 X1 + 5000 X2 Min 4 Y1 + 6 Y2 + 18 Y3
s. t. The number of variables in the primal =
X1 + 0 X2 <= 4 Y1 + 0 Y2 + 3 Y3 >= 3000 The number of constraints in the prima
0 X1 + X2 <= 6 0 Y1 + Y2 + 2 Y3 >= 5000
3 X1 + 2 X2 <= 18 Y1, Y2, Y3 >= 0
X1, X2 >= 0

equivalent to -X1 <= -4 Decision Variables Y1 Y2 Y3

x f(x) = Min - f(x) Optimal Solution 0 3000 1000
W
Objective Coefficients 4 6 18 36000

Constraint 1 Coefficients 1 0 3 3000

Constraint 2 Coefficients 0 1 2 5000
umber of variables in the primal = the number of constraints in the dual
umber of constraints in the primal = the number of variables in the dual

>= 3000
>= 5000
Xi Dosage in kilorads of beam i to be administered; i = 1, 2

Min 0.4 X1 + 0.5 X2

s. t.
0.3 X1 + 0.1 X2 <= 2.7 (critical region)
0.5 X1 + 0.5 X2 = 6 (tumor region)
0.6 X1 + 0.4 X2 >= 6 (center of the tumor)
X1, X2 >= 0

Decision Variables X1 X2
Optimal Solution 7.5 4.5
Z
Objective Coefficients 0.4 0.5 5.25

Constraint 1 Coefficients 0.3 0.1 2.7 <=

Constraint 2 Coefficients 0.5 0.5 6 =
Constraint 3 Coefficients 0.6 0.4 6.3 >=
2.7
6
6
Xi # of agents neededin shift i,i = 1, 2,… 5

Min 170 X1 + 160 X2 + 175 X3 + 180 X4 + 195 X5

s. t.
X1 >= 48 (6 am to 8 am)
X1 + X2 >= 79 (8 am to 10 am) These two constraints are redundant
X1 + X2 >= 65 (10 am to noon) constraints. You can get rid of one
X1 + X2 + X3 >= 87 (noon - 2 pm)
X2 + X3 >= 64 (2 pm - 4 pm)
X3 + X4 >= 73 (4 pm - 6 pm)
X3 + X4 >= 82 (6 pm - 8 pm)
X4 >= 43 (8 pm - 10 pm)
X4 + X5 >= 52 (10 pm - midnight)
X5 >= 15 (midnight to 6 am)
X2, X3 >= 0

Decision Variables X1 X2 X3 X4 X5
Optimal Solution 48 31 39 43 15

Objective Coefficients 170 160 175 180 195

Constraint 1 Coefficients 1
Constraint 2 Coefficients 1 1
Constraint 3 Coefficients 1 1 1
Constraint 4 Coefficients 1 1
Constraint 5 Coefficients 1 1
Constraint 6 Coefficients 1
Constraint 7 Coefficients 1 1
Constraint 8 Coefficients 1
X >= 10
X <= 10

Z
30610

48 >= 48
79 >= 79
118 >= 87
70 >= 64
82 >= 82
43 >= 43
58 >= 52
15 >= 15
 Product 1 Product 2 Resource Available
Frame parts 1 3 200
Electrical parts 2 2 300
Profit / unit $1 $2 no profit after 60 units of product 2

Xi # of units of product i to be assembled; i = 1, 2

Max X1 + 2 X2
s. t.
X1 + 3 X2 <= 200 (frame parts)
X1 + X2 <= 150 (electrical parts)
X2 <= 60 (no profit after 60 units)
X1, X2 >= 0 (non-negartivity constraint)

Decisions Variables X1 X2
Optimal Solutions 125 25
Z
Objective Coefficients 1 2 175

Constraint 1 Coefficients 1 3 200 <= 200

Constraint 2 Coefficients 1 1 150 <= 150
Xij Acreage of crop i allocated in kibbutz j; i = 1 if sugar beets, 2 if cotton and 3 if sorghum; j = 1, 2, 3

Max 1000 (X11 + X12 + X13) + 750 (X21 + X22 + X23) + 250 (X31 + X32 + X33)
s. t.
X11 + X21 + X31 <= 400 (usable land in kibbutz 1)
X12 + X22 + X32 <= 600 (usable land in kibbutz 2)
X13 + X23 + X33 <= 300 (usable land in kibbutz 3)

3 X11 + 2 X21 + X31 <= 600 (water allocation for kibbutz 1)

3 X12 + 2 X22 + X32 <= 800 (water allocation for kibbutz 2)
3 X13 + 2 X23 + X33 <= 375 (water allocation for kibbutz 3)

X11 + X12 + X13 <= 600 (max quota for sugar beets)
X21 + X22 + X23 <= 500 (max quota for cotton)
X31 + X32 + X33 <= 325 (max quota for sorghum)

(X11 + X21 + X31) / 400 = (X12 + X22 + X32 ) / 600 = (X13 + X23 + X33) / 300 (Proportionality constrain
600 (X11 + X21 + X31) - 400 (X12 + X22 + X32) =0 A-B=0
300 (X12 + X22 + X32) - 600 (X13 + X23 + X33) = 0 B-C=0

Xij >= 0; I = 1, 2, 3 and j = 1, 2, 3

Solution Matrix

Profit/acreWater Crop/Kib 1 2 3
1000 3 Sugar Beets 133.3333 100 25
750 2 Cotton 100 250 150
250 1 Sorghum 0 0 0

233.3333 350 175

<= <= <=
400 600 300

=SUM(G30:=SUM(H30:=SUM(I30:I32)

Kibbutzim 1 600 <= 600 =SUMPRODUCT(E30:E32,

Kibbutzim 2 800 <= 800 =SUMPRODUCT(E30:E32,
Kibbutzim 3 375 <= 375 =SUMPRODUCT(E30:E32,

A=B 0= 0 =3*SUM(G30:G32)-2*SUM
B=C 0= 0 =SUM(H30:H32)-2*SUM(
sorghum; j = 1, 2, 3 I=

(Proportionality constraint) A = B = C

Z 633333.3
=D30*SUM(G30:I30)+D31*SUM(G31:I31)+D32*SUM(G32:I32)

258.3333 <= 600 =SUM(G30:I30)

500 <= 500 =SUM(G31:I31)
0 <= 325 =SUM(G32:I32)

=SUMPRODUCT(E30:E32,G30:G32)
=SUMPRODUCT(E30:E32,H30:H32)
=SUMPRODUCT(E30:E32,I30:I32)

=3*SUM(G30:G32)-2*SUM(H30:H32)
=SUM(H30:H32)-2*SUM(I30:I32)
Xij Tonnage of cargo i allocated in compartment j; i = 1, 2, 3, 4; and j = 1 for front, 2 for center and 3 for bac

Max 320 (X11 + X12 + X13) + 400 (X21 + X22 + X23) + 360 (X31 + X32 + X33) + 290 (X41 + X42 + X43)
s.t.
X11 + X21 + X31 + X41 <= 12 (weight constrait for front compartment)
X12 + X22 + X32 + X42 <= 18 (weight constrait for center compartment)
X13 + X23 + X33 + X43 <= 10 (weight constrait for back compartment)

500 X11 + 700 X21 + 600 X31 + 400 X41 <= 7000 (volume constraint for front compartment)
500 X12 + 700 X22 + 600 X32 + 400 X42 <= 9000 (volume constraint for center compartment)
500 X13 + 700 23 + 600 X33 + 400 X43 <= 5000 (volume constraint for back compartment)

X11 + X12 + X13 <= 20 (weight constraint for cargo 1)

X21 + X22 + X23 <= 16 (weight constraint for cargo 2)
X31 + X32 + X33 <= 25 (weight constraint for cargo 3)
X41 + X42 + X43 <= 13 (weight constraint for cargo 4)

(X11 + X21 + X31 + X41) / 12 = (X12 + X22+ X32 + X42) / 18 = (X13 + X23 + X33 + X43) / 10 (proportion

Xij >= 0; i = 1, 2, 3, 4 and j = 1, 2,3

Solution Matrix

Volume Profit Cargo/Compartment Front Center Back

500 320 1 0 15.5 0
700 400 2 7.333333 0.833333 3.333333
600 360 3 0 0 0
400 290 4 4.666667 1.666667 6.666667

12 18 10
<= <= <=
12 18 10
=SUM(F27:=SUM(G27:=SUM(H27:H30)

Front 7000 <= 7000 =SUMPRODUCT(C27:C30,F

Center 9000 <= 9000 =SUMPRODUCT(C27:C30,G
Back 5000 <= 5000 =SUMPRODUCT(C27:C30,H

A=B 0= 0 =3 * SUM(F27:F30)-2*SUM
B=C 0= 0 =5*SUM(G27:G30)-9*SUM
t, 2 for center and 3 for back

(X41 + X42 + X43)

compartment)
r compartment)
ompartment)

33 + X43) / 10 (proportionality constraint) A = B = C

Z 13330
=D27*SUM(F27:H27)+D28*SUM(F28:H28)+D29*SUM(F29:H29)+D30*SUM(F30:H30)

15.5 <= 20 =SUM(F27:H27)

11.5 <= 16 =SUM(F28:H28)
0 <= 25 =SUM(F29:H29)
13 <= 13 =SUM(F30:H30)

=SUMPRODUCT(C27:C30,F27:F30)
=SUMPRODUCT(C27:C30,G27:G30)
=SUMPRODUCT(C27:C30,H27:H30)

=3 * SUM(F27:F30)-2*SUM(G27:G30)
=5*SUM(G27:G30)-9*SUM(H27:H30)
Xi # of servings (in grams) of food type i; i = 1 for steak and 2 for potatoes

Min 4 X1 + 2 X2
s. t.
5 X1 + 15 X2 >= 50 (Carbohydrates)
20 X1 + 5 X2 >= 40 (Protein)
15 X1 + 2 X2 <= 60 (Fat)
X1, X2 >= 0 (non-negativity constraint)

Decision Variable X1 X2
Optimal Solution 1.272727 2.909091
Z
Objective Coefficient 4 2 10.90909

Constraint 1 Coefficient 5 15 50 >= 50

Constraint 2 Coefficient 20 5 40 >= 40
Constraint 3 Coefficient 15 2 24.90909 <= 60
 Xij # of hours assigned to operator i on day j; i = 1 if KC, 2 if DH, 3 if HB, 4 if SC, 5 if KS and 6 if NK;

Min 10 (X11 + X12 + X13 + X14 + X15) + 10.1 (X21 + X22 + X23 + X24 + X25) + 9.9 (X31 + X32 + X33 +
9.8 (X41 + X42 + X43 + X44 + X45) + 10.8 (X51 + X52 + X53 + X54 + X55) + 11.3 (X61 + X62 + X6
s. t.
X11 + X12 + X13 + X14 + X15 >= 8 (Min work hours for KC)
X21 + X22 + X23 + X24 + X25 >= 8 (Min work hours for DH)
X31 + X32 + X33 + X34 + X35 >= 8 (Min work hours for HB)
X41 + X42 + X43 + X44 + X45 >= 8 (Min work hours for SC)
Xi1 + Xi2 + Xi3 + Xi4 + Xi5 >= 8; i = 1, 2, 3, 4 (Min work hours for undergrad operators)
Xi1 + Xi2 + Xi3 + Xi4 + Xi5 >=7; i = 5, 6 (Min work hours for grad operators)

X1j + X2j + X3j + X4j + X5j + X6j = 14; j = 1, 2,…, 5 (Total working hours for a day)

Xij <= Aij; i = 1, 2, …, 6 and j = 1, 2, … 5 (Max availability constraint) Aij is the matrix given in th

Xij >= 0; i = 1, 2, …, 6 and j = 1, 2, … 5 (non-negativity)

0 Xij
Mon Tue Wed Thu Fri
10 0 1 1
10.1 0 2 2
0 3 <= 3
0 4 4
0 5 5
6 6

Solution Matrix

Z 709.6
=C38*SUM(E38:I38)+C39*SUM(E39:I39)+C40*SUM(E40:I40)+C41*SUM(E41:I41)+C

Wages Op / Day Mon Tue Wed Thu Fri

10 KC 3 0 2 0 4
10.1 DH 0 2 0 6 0
9.9 HB 4 7 4 0 4
9.8 SC 5 5 5 0 5
10.8 KS 2 0 3 2 0
11.3 NK 0 0 0 6 1

14 14 14 14 14
 = = = = =
14 14 14 14 14

=SUM(E38:=SUM(F38:=SUM(G38:=SUM(H38:=SUM(I38:I43)

Availability Matrix

Op / Day Mon Tue Wed Thu Fri

KC 6 0 6 0 6
DH 0 6 0 6 0
HB 4 8 4 0 4
Sc 5 5 5 0 5
KS 3 0 3 8 0
NK 0 0 0 6 2
HB, 4 if SC, 5 if KS and 6 if NK; and j = 1 if Mon, 2 if Tue, 3 if Wed, 4 if Thu and 5 if Sat

+ X25) + 9.9 (X31 + X32 + X33 + X34 + 10∑24_(𝑗=1)^5▒𝑋1𝑗+10.1∑_(𝑗=1)^5

X35)+ ▒𝑋2𝑗
+ X55) + 11.3 (X61 + X62 + X63 + X64 + X65)

∑24_(𝑗=1)^5▒ 〖𝑋𝑖𝑗≥ 8;𝑖=1, 2, 3, 4 〗

undergrad operators)

hours for a day)

nt) Aij is the matrix given in the table

X12 >= 0 X12 <= 0 X12 = 0

Aij
Mon Tue Wed Thu Fri

40:I40)+C41*SUM(E41:I41)+C42*SUM(E42:I42)+C43*SUM(E43:I43)

9 >= 8 =SUM(E38:I38)
8 >= 8 =SUM(E39:I39)
19 >= 8 =SUM(E40:I40)
20 >= 8 =SUM(E41:I41)
7 >= 7 =SUM(E42:I42)
7 >= 7 =SUM(E43:I43)
Xi Amount to be invested in venture i; i = 1, 2, 3, 4
Y Amount to be borrowed
Return Function Revenue Function
Max 0.03 X1 + 0.01 X2 + 0.1 X3 + 0.05 X4 - 0.1 Y 1.03 X1 + 1.01 X2 + 1.1 X3 + 1.05 X4 - 1.1
s. t.
X = 100000 + Y (or) X - Y = 100000
X1 + X2 + X3 + X4 <= X (or) X1 + X2 + X3 + X4 - X <= 0 (total investment)
X1 >= 0.3 X (or) X1 - 0.3 X >= 0 (Investment in venture 1)
X2 <= 0.15 X (or) X2 - 0.15 X <= 0 (Investment in venture 2)
X3 <= 50000 (Investment in We are introducing redundancy in the model as we
X3 <= 0.1 X (or) X3 - 0.1 X <= 0 venture 3) two constraints will have the low
X4 >= 0.5 X (or) X4 - 0.5 X >= 0 (Investment in venture 4)
Y <= 0.6 X3 (or) Y - 0.6 X3 <= 0 (Amount to be borrowed)
(3 X1 + 10 X2 + 5 X3 + X4) / (X1 + X2 + X3 + X4) <= 4
(3 X1 - 4 X1 + 10 X2 - 4 X2 + 5 X3 - 4 X3 + X4 - 4 X4) <= 0 (or) -X1 + 6 X2 + X3 - 3 X4 <= 0 (Risk constraint)
Xi >= 0; i = 1, 2, 3, 4
Y >= 0

Decision Variables X1 X2 X3 X4
Optimal Solution 30000 0 10000 60000

Objective Coefficients 0.03 0.01 0.1 0.05

Constraint 1 Coefficients 1
Constraint 2 Coefficients 1
Constraint 3 Coefficients 1
Constraint 4 Coefficients 1
Constraint 5 Coefficients 1
Constraint 6 Coefficients -0.6
Constraint 7 Coefficients -1 6 1 -3
Constraint 8 Coefficients 1 1 1 1
X1+X2+X3+X4 <=X
Revenue Function
2 + 1.1 X3 + 1.05 X4 - 1.1 Y

ndancy in the model as we have no idea which of the

nstraints will have the lower value

X4 <= 0 (Risk constraint)

Y X
0 100000

-0.1 0Z 4900 =SUMPRODUCT($E$25:$J$25,E22:J22)

-0.3 0 >= 0 =SUMPRODUCT($E$22:$J$22,E27:J27)

-0.15 -15000 <= 0 =SUMPRODUCT($E$22:$J$22,E28:J28)
-0.5 10000 >= 0 =SUMPRODUCT($E$22:$J$22,E29:J29)
10000 <= 50000 =SUMPRODUCT($E$22:$J$22,E30:J30)
-0.1 0 <= 0 =SUMPRODUCT($E$22:$J$22,E31:J31)
1 -6000 <= 0 =SUMPRODUCT($E$22:$J$22,E32:J32)
-200000 <= 0 =SUMPRODUCT($E$22:$J$22,E33:J33)
-1 0 <= 0 =SUMPRODUCT($E$22:$J$22,E34:J34)
25:$J$25,E22:J22)

22:$J$22,E27:J27)
22:$J$22,E28:J28)
22:$J$22,E29:J29)
22:$J$22,E30:J30)
22:$J$22,E31:J31)
22:$J$22,E32:J32)
22:$J$22,E33:J33)
22:$J$22,E34:J34)
Xi equals 1 if item i is chosen and 0 otherwise; i = 1, 2, 3, 5

Max 100 X1 + 200 X2 + 800 X3 + 50 X4

s. t.
15 X1 + 5 X2 + 30 X3 + 7 X4 <= 50 (weight constraint)

Decision Variable X1 X2 X3 X4
Optimal Solution 1 1 1 0
Z
Objective Coefficients 100 200 800 50 1100

Constraint Coefficients 15 5 30 7 50
<= 50
Xi Fraction of item i to be packed; i = 1, 2, 3, 4

Max 100 X1 + 200 X2 + 800 X3 + 50 X4

s. t.
15 X1 + 5 X2 + 30 X3 + 7 X4 <= 50 (weight constraint)
Xi <= 1; i = 1, 2, 3, 4 (upper bound on the decision variables)
Xi >= 0; i = 1, 2, 3, 4 (non-negativity constraint)

Decision Variable X1 X2 X3 X4
Optimal Solution 0.533333 1 1 1
Z
Objective Coefficients 100 200 800 50 1103.333

Constraint Coefficients 15 5 30 7 50 <=

50