Tricycle Bicycle Child seats

unit profit 100 300 50

Resources used Resources available
Capital 300 1200 120 93000 < 93000
Storage 0.5 1 0.5 101 < 101

Tricycle Bicycle Child seats Total Profit

Order size 94 54 0 25600
Sessional 1 question
P1 P2
unit profit 6 9
Resources used Resources available
Machine1 1 4 60 > 60
Machine2 1 1 20 > 20
Machine3 5 4 86.66667 < 140

X1 x2 Total Profit 160

Product 6.666667 13.33333
 464 513 654 867 0 75
352 416 690 791 0 125
M 682 388 685 0 100

80 65 70 85
Total ShippedSupply
0 0 50 25 75 = 75
0 65 0 60 125 = 125
80 0 20 0 100 = 100

80 65 70 85 136635
= = = =
80 65 70 85
41 27 28 24 0
40 29 1000 23 0
37 30 27 21 0

0 30 30 0 15 75 = 75
0 0 0 15 60 75 = 75
20 0 0 25 0 45 = 45

20 30 30 40 75 3260
= = = = =
20 30 30 40 75
 Product 1 Product 2 Product 3 Product 4
COST per d Plant 1 820 810 840 960
Plant 2 800 870 30000 920
Plant 3 740 900 810 840

0 0 1 0 1 <= 2
1 0 0 1 2 <= 2
0 1 0 0 1= 1

1 1 1 1 ###
= = = =
1 1 1 1
13 16 12 11
15 1000 13 20
5 7 10 6
0 0 0 0

0 0 0 1 1 1
0 0 1 0 1 1
1 0 0 0 1 1
0 1 0 0 1 1

1 1 1 1
1 1 1 1 29
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Sover example LP.xlsx]Sheet3
Report Created: 17/10/2019 10:38:31

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$10 2.5 0 4 1E+030 4
$D$10 0 8 8 1E+030 8

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$G$6 2.5 0 2 0.5 1E+030
$G$7 5 2 5 1E+030 1
 4 8 3

1 1 0 2.5 2
2 0 1 5 5

2.5 0 0 10
Given
X1 X2 >= 0
Z 4 3 Maximize
Material 6 4 <= 48 lb
Labour 4 8 <= 80 hr 14

12
Solution
Intercepts X1 X2 10
Material 0 12 48
8 0 48 8

Labour 0 10 80
6
20 0 80
4
2
2

0
0 5 10 15 20
 1 7 6
2 5 8

62

Materi a l
Labour

10 15 20 25
Microsoft Excel 16.0 Answer Report
Worksheet: [Sover example LP.xlsx]Sheet4
Report Created: 30/09/2019 11:43:56
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.062 Seconds.
Iterations: 4 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
$F$8 >= 0 550

Variable Cells
Cell Name Original Value Final Value Integer
$B$8 x1 0 7.5 Contin
$C$8 x2 0 5 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$E$4 c1 30 $E$4>=$G$4 Binding 0
$E$5 c2 12.5 $E$5>=$G$5 Not Binding 0.5
$E$6 c3 20 $E$6>=$G$6 Binding 0
40 60

2 1 0 70
1 1 0 40
1 3 0 90

0 0 0
Q 3.4-7 Page 85
x1 x2
Z 40 50
c1 2 3 30 >= 30
c2 1 1 12.5 >= 12
c3 2 1 20 >= 20

7.5 5 550
20
intercepts
19
0 10 30
18
15 0 30
17
0 12 12
12 0 12 16

0 20 20 15
10 0 20 14
13
12
11
10
0 4 200
9
5 0 200
8
7
0 8 400
6
10 0 400
5
4
3
2
1
0
0 1 2 3 4 5 6
 Col umn C
Col umn C
Col umn C
s ol ution

4 5 6 7 8 9 10 11 12 13 14 15
Session question 1

2 20 5 -0.05714 0.142857 40
3 15 2 0.428571 -0.57143 60

1 5 15 -0.01818 0.054545 50
2 20 5 0.072727 -0.01818 40

1 5 15 -0.0093 0.069767 50
3 15 2 0.069767 -0.02326 60
6.285714
-17.1429

1.272727 4 8 28.36364
2.909091

3.72093 4 8 31.62791
2.093023

0 4 8 64
8

0 4 8 240
30