3.3 Problem Set 3 - 3
3.3 Problem Set 3 - 3
Problem Set 3 – 3
Text: E. K. Bowen, G. D. Prichett & J. C. Saber
Solutions: Muhammad Shamim
20
10
B(6, 6)
– 20 – 10 A(8, 2) 10 20
x x
– 10
– 20
y
Fig: Solution Space of Given Conditions
From the graph, we get the following two optimizing corner points:
A = (8, 2)
B = (6, 6)
(a)
Table values of = 5x + 2y
Corner Objective Function Value of
Points = 5x + 2y
A(8, 2) 5(8) + 2(2) 44
B(6, 6) 5(6) + 2(6) 42
334
Linear Programming & Simplex Method (Problem Set 3 – 3)
(b)
Table values of = x + 7y
Corner Objective Function Value of
Points = x + 7y
A(8, 2) 8 + 7(2) 22
B(6, 6) 6 + 7(6) 48
(c)
Table values of = 4x + 2y
Corner Objective Function Value of
Points = 4x + 2y
A(8, 2) 4(8) + 2(2) 36
B(6, 6) 4(6) + 2(6) 36
max = 36 at points (8, 2) and (6, 6) [Ans.]
min = 36 at points (8, 2) and (6, 6) [Ans.]
2. Subject to
2x + 4y 36
x + y 12
– 2x + y = 0.
335
Bowen, Prichett & Saber’s Mathematics Manual
For x + y 12, we get
x 0 12
y 12 0
For – 2x + y = 0, we get
x 0 0
y 0 0
Putting these values, we get the following graph:
y
20
10
B(4, 8)
A(18/5, 36/5)
– 20 – 10 10 20
x x
– 10
– 20
y
Fig: Solution Space of Given Conditions
From the graph, we get the following two optimizing corner points:
A = (18/5, 36/5)
B = (4, 8)
(a)
Table values of = 7x + 4y
Corner Objective Function Value of
Points = 7x + 4y
A(18/5, 36/5) 7(18/5) + 4(36/5) 54
B(4, 8) 7(4) + 4(8) 60
336
Linear Programming & Simplex Method (Problem Set 3 – 3)
max = 60 at point (4, 8) [Ans.]
min = 54 at point (18/5, 36/5) [Ans.]
(b)
Table values of = 3x + 8y
Corner Objective Function Value of
Points = 3x + 8y
A(18/5, 36/5) 3(18/5) + 8(36/5) 342/5
B(4, 8) 3(4) + 8(8) 76
(c)
Table values of = 4x + 2y
Corner Objective Function Value of
Points = 4x + 2y
A(18/5, 36/5) 4(18/5) + 2(36/5) 144/5
B(4, 8) 4(4) + 2(8) 32
3. Subject to
x + 3y 24
x + y 10
2x + y = 18
4x – 3y = 16.
337
Bowen, Prichett & Saber’s Mathematics Manual
Solution: For x + 3y 24, we get
x 0 24
y 8 0
For x + y 10, we get
x 0 10
y 10 0
For 2x + y = 18, we get
x 0 9
y 18 0
For 4x – 3y = 16, we get
x 0 4
y – 5.33 0
20
10
– 20 – 10 A(7, 4) 10 20
x x
– 10
– 20
y
Fig: Solution Space of Given Conditions
From the graph, we get the following one optimizing corner point:
A = (7, 4)
338
Linear Programming & Simplex Method (Problem Set 3 – 3)
(a)
Table values of = 5x + 2y
Corner Objective Function Value of
Points = 5x + 2y
A(7, 4) 5(7) + 2(4) 43
(b)
Table values of = x + 7y
Corner Objective Function Value of
Points = x + 7y
A(7, 4) 7 + 7(4) 35
(c)
Table values of = 4x + 2y
Corner Objective Function Value of
Points = 4x + 2y
A(7, 4) 4(7) + 2(4) 36
max = 36 at point (7, 4) [Ans.]
min = 36 at point (7, 4) [Ans.]
4. Subject to
2x + 4y 36
x + y 12
– 2x + y = 0
– x + 2y = 12.
For – 2x + y = 0, we get
x 0 0
y 0 0
20
10
– 20 – 10 A(4, 8) 10 20
x x
– 10
– 20
y
Fig: Solution Space of Given Conditions
From the graph, we get the following one optimizing corner point:
A = (4, 8)
340
Linear Programming & Simplex Method (Problem Set 3 – 3)
(a)
Table values of = 7x + 4y
Corner Objective Function Value of
Points = 7x + 4y
A(4, 8) 7(4) + 4(8) 60
(b)
Table values of = 3x + 8y
Corner Objective Function Value of
Points = 3x + 8y
A(4, 8) 3(4) + 8(8) 76
(c)
Table values of = 4x + 2y
Corner Objective Function Value of
Points = 4x + 2y
A(4, 8) 4(4) + 2(8) 32
5. Subject to
x + 3y 24
x + y 10
2x + y = 18
5x + y = 20.
Find max if:
(a) = 5x + 2y.
(b) = x + 7y.
(c) = 4x + 2y.
341
Bowen, Prichett & Saber’s Mathematics Manual
Solution: In this Problem 5, the feasible solution set is empty, so there is
no maximum or minimum value.
6. Subject to
2x + 4y 36
x + y 12
– 2x + y = 0
– x + y = 10.
Find max if:
(a) = 7x + 4y.
(b) = 3x + 8y.
(c) = 4x + 2y.
Solution: In this Problem 5, the feasible solution set is empty, so there is
no maximum or minimum value.
7 to 18 Try yourself.
342