Linear Programming & Simplex Method (Problem Set 3 – 2)

Problem Set 3 – 2
Text: E. K. Bowen, G. D. Prichett & J. C. Saber
Solutions: Muhammad Shamim

Use the three-step graphical procedure to find the optimum, as

required, assuming x  0 and y  0:
1. Subject to
4x + 3y  24
x + 2y  11.

Find max if:

(a)  = x + y.
(b)  = x + 3y.
(c)  = 3x + y.
(d)  = 2x + 1.5y.

Solution: For 4x + 3y  24, we get

x 0 6
y 8 0

For x + 2y  11, we get

x 0 11
y 5.5 0

Putting these values, we get the following graph:

299
 Bowen, Prichett & Saber’s Mathematics Manual
y

10

D(0, 5.5) 5
C(3, 4)

– 10 –5 5 10
x A(0,0) B(6,0) x

–5

– 10

y
Fig: Solution Space of Given Conditions

(a)
Table values of  = x + y
Corner Objective Function Value of
Points =x+y 
A(0, 0) 0+0 0
B(6, 0) 6+0 6
C(3, 4) 3+4 7
D(0, 5.5) 0 + 5.5 5.5

 max = 7 at point (3, 4) [Ans.]

(b)
Table values of  = x + 3y
Corner Objective Function Value of
Points  = x + 3y 
A(0, 0) 0 + 3(0) 0
B(6, 0) 6 + 3(0) 6
C(3, 4) 3 + 3(4) 15
D(0, 5.5) 0 + 3(5.5) 16.5
300
 Linear Programming & Simplex Method (Problem Set 3 – 2)
 max = 16.5 at point (0, 5.5) [Ans.]

(c)
Table values of  = 3x + y
Corner Objective Function Value of
Points  = 3x + y 
A(0, 0) 3(0) + 0 0
B(6, 0) 3(6) + 0 18
C(3, 4) 3(3) + 4 13
D(0, 5.5) 3(0) + 5.5 5.5

 max = 18 at point (6, 0) [Ans.]

(d)
Table values of  = 2x + 1.5y
Corner Objective Function Value of
Points  = 2x + 1.5y 
A(0, 0) 2(0) + 1.5(0) 0
B(6, 0) 2(6) + 1.5(0) 12
C(3, 4) 2(3) + 1.5(4) 12
D(0, 5.5) 2(0) + 1.5(5.5) 8.25
 max = 12 at points (6, 0) and (3, 4) [Ans.]

2. Subject to
3x + 7y  42
x + 5y  22.

Find max if:

(a)  = 4x + 10y.
(b)  = 2x – 3y.
(c)  = – 3x + 10y.
(d)  = 1.5x + 3.5y.

Solution: For 3x + 7y  42, we get

x 0 14
y 6 0

301
 Bowen, Prichett & Saber’s Mathematics Manual
For x + 5y  22, we get
x 0 22
y 4.4 0

Putting these values, we get the following graph:

y

20

10

C(7, 3)
– 20 – 10 D(0, 4.4) 10 20
x A(0,0) B(14,0) x

– 10

– 20

y
Fig: Solution Space of Given Conditions

(a)
Table values of  = 4x + 10y
Corner Objective Function Value of
Points  = 4x + 10y 
A(0, 0) 4(0) + 10(0) 0
B(14, 0) 4(14) + 10(0) 56
C(7, 3) 4(7) + 10(3) 58
D(0, 4.4) 4(0) + 10(4.4) 44

 max = 58 at point (7, 3) [Ans.]

302
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(b)
Table values of  = 2x – 3y
Corner Objective Function Value of
Points  = 2x – 3y 
A(0, 0) 2(0) – 3(0) 0
B(14, 0) 2(14) – 3(0) 28
C(7, 3) 2(7) – 3(3) 5
D(0, 4.4) 2(0) – 3(4.4) – 13.2
 max = 28 at point (14, 0) [Ans.]

(c)
Table values of  = – 3x + 10y
Corner Objective Function Value of
Points  = – 3x + 10y 
A(0, 0) – 3(0) + 10(0) 0
B(14, 0) – 3(6) + 10(0) – 18
C(7, 3) – 3(7) + 10(3) 9
D(0, 4.4) – 3(0) + 10(4.4) 44
 max = 44 at point (0, 4.4) [Ans.]

(d)
Table values of  = 1.5x + 3.5y
Corner Objective Function Value of
Points  = 1.5x + 3.5y 
A(0, 0) 1.5(0) + 3.5(0) 0
B(14, 0) 1.5(14) + 3.5(0) 21
C(7, 3) 1.5(7) + 3.5(3) 21
D(0, 4.4) 1.5(0) + 3.5(4.4) 15.4
 max = 21 at points (14, 0) and (7, 3) [Ans.]

3. Subject to
2x + 3y  12
5x + y  17.

Find min if:

(a)  = x + 2y.
(b)  = 5x + 7y.
303
 Bowen, Prichett & Saber’s Mathematics Manual
(c)  = 8x + y.
(d)  = 5x + y.

Solution: For 2x + 3y  12, we get

x 0 6
y 4 0

For 5x + y  17, we get

x 0 3.4
y 17 0

Putting these values, we get the following graph:

y

20
C(0, 17)

10

– 20 – 10 B(3, 2)10 20
x A(6, 0) x

– 10

– 20

y
Fig: Solution Space of Given Conditions

(a)
Table values of  = x + 2y
Corner Objective Function Value of
Points  = x + 2y 
A(6, 0) 6 + 2(0) 6

304
 Linear Programming & Simplex Method (Problem Set 3 – 2)
B(3, 2) 3 + 2(2) 7
C(0, 17) 0 + 2(17) 34
 min = 6 at point (6, 0) [Ans.]
(b)
Table values of  = 5x + 7y
Corner Objective Function Value of
Points  = 5x + 7y 
A(6, 0) 5(6) + 7(0) 30
B(3, 2) 5(3) + 7(2) 29
C(0, 17) 5(0) + 7(17) 119
 min = 29 at point (3, 2) [Ans.]
(c)
Table values of  = 8x + y
Corner Objective Function Value of
Points  = 8x + y 
A(6, 0) 8(6) + 0 48
B(3, 2) 8(3) + 2 26
C(0, 17) 8(0) + 17 17
 min = 17 at point (0, 17) [Ans.]

(d)
Table values of  = 5x + y
Corner Objective Function Value of
Points  = 5x + y 
A(6, 0) 5(6) + 0 30
B(3, 2) 5(3) + 2 17
C(0, 17) 5(0) + 17 17
 min = 17 at points (3, 2) and (0, 17) [Ans.]

4. Subject to
4x + 5y  30
3x + 2y  19.

Find min if:

(a)  = 2x + 8y.
(b)  = 4x + 2y.
305
 Bowen, Prichett & Saber’s Mathematics Manual
(c)  = 2x + 2y.
(d)  = 8x + 10y.

Solution: For 4x + 5y  30, we get

x 0 7.5
y 6 0

For 3x + 2y  19, we get

x 0 6.33
y 9.5 0

Putting these values, we get the following graph:

y

10
C(0, 9.5)

B(5, 2)
– 10 –5 5 10
x A(7.5, 0) x

–5

– 10

y
Fig: Solution Space of Given Conditions

(a)
Table values of  = 2x + 8y
Corner Objective Function Value of
Points  = 2x + 8y 
A(7.5, 0) 2(7.5) + 8(0) 15

306
 Linear Programming & Simplex Method (Problem Set 3 – 2)
B(5, 2) 2(5) + 8(2) 26
C(0, 9.5) 2(0) + 8(9.5) 76
 min = 15 at point (7.5, 0) [Ans.]
(b)
Table values of  = 4x + 2y
Corner Objective Function Value of
Points  = 4x + 2y 
A(7.5, 0) 4(7.5) + 2(0) 30
B(5, 2) 4(5) + 2(2) 24
C(0, 9.5) 4(0) + 2(9.5) 19
 min = 19 at point (0, 9.5) [Ans.]
(c)
Table values of  = 2x + 2y
Corner Objective Function Value of
Points  = 2x + 2y 
A(7.5, 0) 2(7.5) + 2(0) 15
B(5, 2) 2(5) + 2(2) 14
C(0, 9.5) 2(0) + 2(9.5) 19
 min = 14 at point (5, 2) [Ans.]
(d)
Table values of  = 5x + y
Corner Objective Function Value of
Points  = 8x + 10y 
A(7.5, 0) 8(7.5) + 10(0) 60
B(5, 2) 8(5) + 10(2) 60
C(0, 9.5) 8(0) + 10(9.5) 95
 min = 60 at points (7.5, 0) and (5, 2) [Ans.]

5. Subject to
3x + y  9
x+y5
x 4
y  4.

Find max if:

(a)  = 0.3x + 0.5y.
307
 Bowen, Prichett & Saber’s Mathematics Manual
(b)  = 2x + y.
(c)  = 5x + y.
(d)  = 3x + 3y.
Solution: For 3x + y  9, we get
x 0 3
y 9 0

For x + y  5, we get
x 0 5
y 5 0

Putting these values, we get the following graph:

y

10

5
E(0, 4)
D(5, 2)
C(5, 2)
– 10 –5 5 10
x A(0, 0) B(3, 0) x

–5

– 10

y
Fig: Solution Space of Given Conditions
From the graph, we get five corner points as follows:
A = (0, 0)
B = (3, 0)
C = (2, 3)
D = (1, 4)
E = (0, 4)
308
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(a)
Table values of  = 0.3x + 0.5y
Corner Objective Function Value of
Points  = 0.3x + 0.5y 
A(0, 0) 0.3(0) + 0.5(0) 0
B(3, 0) 0.3(3) + 0.5(0) 0.9
C(2, 3) 0.3(2) + 0.5(3) 2.1
D(1, 4) 0.3(1) + 0.5(4) 2.3
E(0, 4) 0.3(0) + 0.5(4) 2
 max = 2.3 at point (1, 4) [Ans.]
(b)
Table values of  = 2x + y
Corner Objective Function Value of
Points  = 2x + y 
A(0, 0) 2(0) + 0 0
B(3, 0) 2(3) + 0 6
C(2, 3) 2(2) + 3 7
D(1, 4) 2(1) + 4 6
E(0, 4) 2(0) + 4 4

 max = 7 at point (2, 3) [Ans.]

(c)
Table values of  = 5x + y
Corner Objective Function Value of
Points  = 5x + y 
A(0, 0) 5(0) + 0 0
B(3, 0) 5(3) + 0 15
C(2, 3) 5(2) + 3 13
D(1, 4) 5(1) + 4 9
E(0, 4) 5(0) + 4 4
 max = 15 at point (3, 0) [Ans.]

309
 Bowen, Prichett & Saber’s Mathematics Manual
(d)
Table values of  = 3x + 3y
Corner Objective Function Value of
Points  = 3x + 3y 
A(0, 0) 3(0) + 3(0) 0
B(3, 0) 3(3) + 3(0) 9
C(2, 3) 3(2) + 3(3) 15
D(1, 4) 3(1) + 3(4) 15
E(0, 4) 3(0) + 3(4) 12

 max = 15 at points (2, 3) and (1, 4) [Ans.]

6. Subject to
x + y  13
x + 2y  22
2x + y  20
x  4.

Find max if:

(a)  = 5x + 8y.
(b)  = 4x – y.
(c)  = – 2x + 7y.
(d)  = 5x + 10y.
Solution: For x + y  13, we get
x 0 13
y 13 0

For x + 2y  22, we get

x 0 22
y 11 0

For 2x + y  20, we get

x 0 10
y 20 0

310
 Linear Programming & Simplex Method (Problem Set 3 – 2)
Putting these values, we get the following graph:
y

20

D(0, 11) 10
C(4, 9)

– 20 – 10 10 20
x A(0, 0) B(4, 0) x

– 10

– 20

y
Fig: Solution Space of Given Conditions
From the graph, we get four corner points as follows:
A = (0, 0)
B = (4, 0)
C = (4, 9)
D = (0, 11)

(a)
Table values of  = 5x + 8y
Corner Objective Function Value of
Points  = 5x + 8y 
A(0, 0) 5(0) + 8(0) 0
B(4, 0) 5(4) + 8(0) 20
C(4, 9) 5(4) + 8(9) 92
D(0, 11) 5(0) + 8(11) 88

 max = 92 at point (4, 9) [Ans.]

311
 Bowen, Prichett & Saber’s Mathematics Manual
(b)
Table values of  = 4x – y
Corner Objective Function Value of
Points  = 4x – y 
A(0, 0) 4(0) – 0 0
B(4, 0) 4(4) – 0 16
C(4, 9) 4(4) – 9 7
D(0, 11) 4(0) – 11 – 11

 max = 16 at point (4, 0) [Ans.]

(c)
Table values of  = – 2x + 7y
Corner Objective Function Value of
Points  = – 2x + 7y 
A(0, 0) – 2(0) + 7(0) 0
B(4, 0) – 2(4) + 7(0) –8
C(4, 9) – 2(4) + 7(9) 55
D(0, 11) – 2(0) + 7(11) 77

 max = 77 at point (0, 11) [Ans.]

(d)
Table values of  = 5x + 10y
Corner Objective Function Value of
Points  = 5x + 10y 
A(0, 0) 5(0) + 10(0) 0
B(4, 0) 5(4) + 10(0) 20
C(4, 9) 5(4) + 10(9) 110
D(0, 11) 5(0) + 10(11) 110

 max = 110 at points (4, 9) and (0, 11). [Ans.]

7. Subject to
x + 3y  24
2x + y  18
3x + 4y  52
312
 Linear Programming & Simplex Method (Problem Set 3 – 2)
Find min if:
(a)  = x + y.
(b)  = 4x + 3y.
(c)  = 6x + 2y.
(d)  = 6x + 8y.
Solution: For x + 3y  24, we get
x 0 24
y 8 0
For 2x + y  18, we get
x 0 9
y 18 0
For 3x + 4y  52, we get
x 0 17.33
y 13 0

Putting these values, we get the following graph:

y

20
D(0, 18)

10 C(4, 10)

B(12, 4)
– 20 – 10 10 20 A(24, 0)
x x

– 10

– 20

y
Fig: Solution Space of Given Conditions
313
 Bowen, Prichett & Saber’s Mathematics Manual
From the graph, we get four corner points as follows:
A = (24, 0)
B = (12, 4)
C = (4, 10)
D = (0, 18)

(a)
Table values of  = x + y
Corner Objective Function Value of
Points =x+y 
A(24, 0) 24 + 0 24
B(12, 4) 12 + 4 16
C(4, 10) 4 + 10 14
D(0, 18) 0 + 17 18

 min = 14 at point (4, 10) [Ans.]

(b)
Table values of  = 4x + 3y
Corner Objective Function Value of
Points  = 4x + 3y 
A(24, 0) 4(24) + 3(0) 96
B(12, 4) 4(12) + 3(4) 60
C(4, 10) 4(4) + 3(10) 46
D(0, 18) 4(0) + 3(18) 54

 min = 46 at point (4, 10) [Ans.]

(c)
Table values of  = – 2x + 7y
Corner Objective Function Value of
Points  = 6x + 2y 
A(24, 0) 6(24) + 2(0) 144
B(12, 4) 6(12) + 2(4) 80
C(4, 10) 6(4) + 2(10) 44
D(0, 18) 6(0) + 2(18) 36

 min = 36 at point (0, 18) [Ans.]

314
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(d)
Table values of  = 6x + 8y
Corner Objective Function Value of
Points  = 6x + 8y 
A(24, 0) 6(24) + 8(0) 144
B(12, 4) 6(12) + 8(4) 104
C(4, 10) 6(4) + 8(10) 104
D(0, 18) 6(0) + 8(18) 144

 min = 104 at points (12, 4) and (4, 10). [Ans.]

8. Subject to
4x + y  16
3x + 2y  24
x–y0
Find min if:
(a)  = 2x + y.
(b)  = x + 2y.
(c)  = 8x + 2y.
(d)  = 6x + 4y.

Solution: For 4x + y  16, we get

x 0 4
y 16 0
For 3x + 2y  24, we get
x 0 8
y 12 0
For x – y  0, we get
x 0 0
y 0 0

315
 Bowen, Prichett & Saber’s Mathematics Manual
Putting these values, we get the following graph:
y

20
D(0, 16)

10
C(8/5, 48/5)
B(24/5, 24/5)
– 20 – 10 10 20
x A(8, 0) x

– 10

– 20

y
Fig: Solution Space of Given Conditions

From the graph, we get four corner points as follows:

A = (8, 0)
B = (24/5, 24/5)
C = (8/5, 48/5)
D = (0, 16)

(a)
Table values of  = 2x + y
Corner Objective Function Value of
Points  = 2x + y 
A(8, 0) 2(8) + 0 16
B(24/5, 24/5) 2(24/5) + 24/5 72/5
C(8/5, 48/5) 2(8/5) + 48/5 64/5
D(0, 16) 2(0) + 16 16

 min = 64/5 at point (8/5, 48/5) [Ans.]

316
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(b)
Table values of  = x + 2y
Corner Objective Function Value of
Points  = x + 2y 
A(8, 0) 8 + 2(0) 8
B(24/5, 24/5) 24/5 + 2(24/5) 72/5
C(8/5, 48/5) 8/5 + 2(48/5) 104/5
D(0, 16) 0 + 2(16) 32
 min = 8 at point (8, 0) [Ans.]

(c)
Table values of  = 8x + 2y
Corner Objective Function Value of
Points  = 8x + 2y 
A(8, 0) 8(8) + 2(0) 64
B(24/5, 24/5) 8(24/5) + 2(24/5) 48
C(8/5, 48/5) 8(8/5) + 2(48/5) 32
D(0, 16) 8(0) + 2(16) 32
 min = 32 at points (8/5, 48/5) and (0.16) [Ans.]

(d)
Table values of  = 6x + 4y
Corner Objective Function Value of
Points  = 6x + 4y 
A(8, 0) 6(8) + 4(0) 48
B(24/5, 24/5) 6(24/5) + 4(24/5) 48
C(8/5, 48/5) 6(8/5) + 4(48/5) 48
D(0, 16) 6(0) + 4(16) 64
 min = 48 at points (8, 0), (24/5, 24/5) and (8/5, 48/5). [Ans.]

9. Subject to
2x + y  8
6x + 10y  60
Find max and min if:
(a)  = 3x + 2y.
(b)  = 10x + y.
317
 Bowen, Prichett & Saber’s Mathematics Manual
Solution: For 2x + y  8, we get
x 0 4
y 8 0
For 6x + 10y  60, we get
x 0 10
y 6 0

Putting these values, we get the following graph:

y

10
C(0, 8)

D(0, 6) 5 B(0, 6)

– 10 –5 5 10
x E(0, 0) F(4, 0) A(10, 0) x

–5

– 10

y
Fig: Solution Space of Given Conditions

From the graph, we get four corner points as follows:

A = (10, 0)
B = (10/7, 36/7)
C = (0, 8)
D = (0, 6)
E = (0, 0)
F = (4, 0)

318
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(a)
Table values of  = 3x + 2y
Corner Objective Function Value of
Points  = 3x + 2y 
A(10, 0) 3(10) + 2(0) 30
B(10/7, 36/7) 3(10/7) + 2(36/7) 102/7
C(0, 8) 3(0) + 2(8) 16
D(0, 6) 3(0) + 2(6) 12
E(0, 0) 3(0) + 2(0) 0
F(4, 0) 3(4) + 2(0) 12
 max = 30 at point (10, 0) [Ans.]
 min = 12 at point (4, 0) [Ans.]

(b)
Table values of  = 10x + y
Corner Objective Function Value of
Points  = 10x + y 
A(10, 0) 10(10) + 0 100
B(10/7, 36/7) 10(10/7) + 36/7 136/7
C(0, 8) 10(0) + 8 8
D(0, 6) 10(0) + 6 6
E(0, 0) 10(0) + 0 0
F(4, 0) 10(4) + 0 40
 max = 100 at point (10, 0) [Ans.]
 min = 136/7 at point (10/7, 36/7) [Ans.]

10. Subject to
0.15x + 0.10y  15
x+y  120
0.4x  32.
Find max and min if:
(a)  = 0.20x + 0.15y.
(b)  = 0.15x + 0.20y.
(c)  = 0.1x + 0.1y.
319
 Bowen, Prichett & Saber’s Mathematics Manual
Solution: For 0.15x + 0.10y  15, we get
x 0 100
y 150 0
For x + y  120, we get
x 0 120
y 120 0
For 0.4x  32, we get
0.4x = 32
 x = 32/0.4
 x = 80

Putting these values, we get the following graph:

y

200

100
C(60, 60)
B(80, 40)
– 200 – 100 A(80, 30) 100 200
x x

– 100

– 200

y
Fig: Solution Space of Given Conditions

From the graph, we get the following three optimizing corner points:
A = (80, 30)
B = (80, 40)
C = (60, 60)

320
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(a)
Table values of  = 0.20x + 0.15y
Corner Objective Function Value of
Points  = 0.20x + 0.15y 
A(80, 30) 0.20(80) + 0.15(30) 20.50
B(80, 40) 0.20(80) + 0.15(40) 22.00
C(60, 60) 0.20(60) + 0.15(60) 21.00

 max = 22 at point (80, 40) [Ans.]

 min = 20.50 at point (80, 30) [Ans.]

(b)
Table values of  = 0.15x + 0.20y
Corner Objective Function Value of
Points  = 0.15x + 0.20y 
A(80, 30) 0.15(80) + 0.20(30) 18
B(80, 40) 0.15(80) + 0.20(40) 20
C(60, 60) 0.15(60) + 0.20(60) 21
 max = 20 at point (80, 40) [Ans.]
 min = 18 at point (80, 30) [Ans.]

(c)
Table values of  = 0.1x + 0.1y
Corner Objective Function Value of
Points  = 0.1x + 0.1y 
A(80, 30) 0.1(80) + 0.1(30) 11
B(80, 40) 0.1(80) + 0.1(40) 12
C(60, 60) 0.1(60) + 0.1(60) 12
 max = 12 at points (80, 40) and (60, 60) [Ans.]
 min = 11 at point (80, 30) [Ans.]

321
 Bowen, Prichett & Saber’s Mathematics Manual
11. Subject to
2x + 4y  36
x + y  12.
Find max and min if:
(a)  = 3x + 5y.
(b)  = 6x + 2y.
(c)  = 3x + 3y.

Solution: For 2x + 4y  36, we get

x 0 18
y 9 0
For x + y  12, we get
x 0 12
y 12 0

Putting these values, we get the following graph:

y

20

A(0, 12)
10
B(0, 9)
C(6, 6)
– 20 – 10 10 20
x x

– 10

– 20

y
Fig: Solution Space of Given Conditions

322
 Linear Programming & Simplex Method (Problem Set 3 – 2)
From the graph, we get the following three optimizing corner points:
A = (0, 12)
B = (0, 9)
C = (6, 6)

(a)
Table values of  = 3x + 5y
Corner Objective Function Value of
Points  = 3x + 5y 
A(0, 12) 3(0) + 5(12) 60
B(0, 9) 3(0) + 5(9) 45
C(6, 6) 3(6) + 5(6) 48

 max = 60 at point (0, 12) [Ans.]

 min = 45 at point (0, 9) [Ans.]

(b)
Table values of  = 6x + 2y
Corner Objective Function Value of
Points  = 6x + 2y 
A(0, 12) 6(0) + 2(12) 24
B(0, 9) 6(0) + 2(9) 18
C(6, 6) 6(6) + 2(6) 48

 max = 48 at point (6, 6) [Ans.]

 min = 18 at point (0, 9) [Ans.]

(c)
Table values of  = 3x + 3y
Corner Objective Function Value of
Points  = 3x + 3y 
A(0, 12) 3(0) + 3(12) 36
B(0, 9) 3(0) + 3(9) 27
C(6, 6) 3(6) + 3(6) 36
 max = 36 at points (0, 12) and (6, 6) [Ans.]
 min = 27 at point (0, 9) [Ans.]
323
 Bowen, Prichett & Saber’s Mathematics Manual
12. Subject to
2x + 4y  36
x + y  12
– 2x + y  0.
Find max and min if:
(a)  = 3x + 5y.
(b)  = 6x + 2y.
(c)  = 3x + 3y.
Solution: For 2x + 4y  36, we get
x 0 18
y 9 0
For x + y  12, we get
x 0 12
y 12 0
For – 2x + y  0, we get x = 0, y = 0.
Putting these values, we get the following graph:
y

20

A(0, 12)
10
B(0, 9)
C(6, 6)
– 20 – 10 10 20
x x

– 10

– 20

y
Fig: Solution Space of Given Conditions
324
 Linear Programming & Simplex Method (Problem Set 3 – 2)
From the graph, we get the following four optimizing corner points:
A = (0, 12)
B = (0, 9)
C = (6, 6)
D = (4, 8)
(a)
Table values of  = 3x + 5y
Corner Objective Function Value of
Points  = 3x + 5y 
A(0, 12) 3(0) + 5(12) 60
B(0, 9) 3(0) + 5(9) 45
C(6, 6) 3(6) + 5(6) 48
D(4, 8) 3(4) + 5(8) 52
 max = 60 at point (0, 12) [Ans.]
 min = 45 at point (0, 9) [Ans.]

(b)
Table values of  = 6x + 2y
Corner Objective Function Value of
Points  = 6x + 2y 
A(0, 12) 6(0) + 2(12) 24
B(0, 9) 6(0) + 2(9) 18
C(6, 6) 6(6) + 2(6) 48
D(4, 8) 6(4) + 2(8) 40

 max = 40 at point (4, 8) [Ans.]

 min = 18 at point (0, 9) [Ans.]

(c)
Table values of  = 3x + 3y
Corner Objective Function Value of
Points  = 3x + 3y 
A(0, 12) 3(0) + 3(12) 36
B(0, 9) 3(0) + 3(9) 27
C(6, 6) 3(6) + 3(6) 36
D(4, 8) 3(4) + 3(8) 36
325
 Bowen, Prichett & Saber’s Mathematics Manual
 max = 36 at points (0, 12) and (4, 8) [Ans.]
 min = 27 at point (0, 9) [Ans.]

13. Subject to
2x + 4y  36
x + y  12
x – 2y  0.
Find max and min if:
(a)  = 3x + 5y.
(b)  = 6x + 2y.
(c)  = 3x + 3y.
Solution: Same to Problem 11.

14. Subject to
2x + 4y  36
x + y  12
x – 2y  0.
Find max and min if:
(a)  = 3x + 5y.
(b)  = 6x + 2y.
(c)  = 3x + 3y.
Solution: In this Problem 14, the feasible solution set is empty, so there
is no maximum or minimum value.

15. Subject to
2x + 3y  24
2x – y  8
– 2x + 3y  12.
Find max and min if:
(a)  = 6x + y – 7.
(b)  = – 3x + 7y + 10.
(c)  = – x – 3y + 25.
(d)  = 8x – 4y + 18.
326
 Linear Programming & Simplex Method (Problem Set 3 – 2)
Solution: For 2x + 3y  24, we get
x 0 12
y 8 0
For 2x – y  8, we get
x 0 4
y –8 0
For – 2x + 3y  12, we get
x 0 –6
y 4 0

Putting these values, we get the following graph:

y

10

5 D(3, 6)
E(0, 4) C(6, 4)

– 10 –5 5 10
x A(0, 0) B(4, 0) x

–5

– 10

y
Fig: Solution Space of Given Conditions

From the graph, we get the following five optimizing corner points:
A = (0, 0)
B = (4, 0)
C = (6, 4)
D = (3, 6)
E = (0, 4)
327
 Bowen, Prichett & Saber’s Mathematics Manual
(a)
Table values of  = 6x + y – 7
Corner Objective Function Value of
Points  = 6x + y – 7 
A(0, 0) 6(0) + 0 – 7 –7
B(4, 0) 6(4) + 0 – 7 17
C(6, 4) 6(6) + 4 – 7 33
D(3, 6) 6(3) + 6 – 7 17
E(0, 4) 6(0) + 4 – 7 –3
 max = 33 at point (6, 4) [Ans.]
 min = – 7 at point (0, 0) [Ans.]

(b)
Table values of  = – 3x + 7y + 10
Corner Objective Function Value of
Points  = – 3x + 7y + 10 
A(0, 0) – 3(0) + 7(0) + 10 10
B(4, 0) – 3(4) + 7(0) + 10 –2
C(6, 4) – 3(6) + 7(4) + 10 20
D(3, 6) – 3(3) + 7(6) + 10 43
E(0, 4) – 3(0) + 7(4) + 10 38
 max = 43 at point (3, 6) [Ans.]
 min = – 2 at point (4, 0) [Ans.]

(c)
Table values of  = – x – 3y + 25
Corner Objective Function Value of
Points  = – x – 3y + 25 
A(0, 0) – 0 – 3(0) + 25 25
B(4, 0) – 4 – 3(0) + 25 21
C(6, 4) – 6 – 3(4) + 25 7
D(3, 6) – 3 – 3(6) + 25 4
E(0, 4) – 0 – 3(4) + 25 13
 max = 25 at point (0, 0) [Ans.]
 min = 4 at point (3, 6) [Ans.]
328
 Linear Programming & Simplex Method (Problem Set 3 – 2)
(d)
Table values of  = 8x – 4y + 18
Corner Objective Function Value of
Points  = 8x – 4y + 18 
A(0, 0) 8(0) – 4(0) + 18 18
B(4, 0) 8(4) – 4(0) + 18 50
C(6, 4) 8(6) – 4(4) + 18 50
D(3, 6) 8(3) – 4(6) + 18 18
E(0, 4) 8(0) – 4(4) + 18 2
 max = 50 at points (4, 0) and (6, 4) [Ans.]
 min = 2 at point (0, 4) [Ans.]

16. Subject to
0.15x + 0.10y  15
x+y  120
0.4x  32.

Find max and min if:

(a)  = 0.3x – 0.2y + 0.75.
(b)  = – 0.6x + 0.5y – 0.80.
(c)  = – 0.7x – 0.9y + 2.50.
(d)  = 0.4x + 0.4y – 0.30.

Solution: For 0.15x + 0.10y  15, we get

x 0 100
y 150 0
For x + y  120, we get
x 0 120
y 120 0

For 0.4x  32, we get 0.4x = 32  x = 32/0.4 = 80

329
 Bowen, Prichett & Saber’s Mathematics Manual
Putting these values, we get the following graph:

150
y

100

50

D(80, 40)
– 100 – 50 50 100 C(120, 0)
x A(0, 0) B(100, 0) x

– 50

– 100

y
Fig: Solution Space of Given Conditions

From the graph, we get the following four optimizing corner points:
A = (0, 0)
B = (100, 0)
C = (120, 0)
D = (80, 40)
(a)
Table values of  = 0.3x – 0.2y + 0.75
Corner Objective Function Value of
Points  = 0.3x – 0.2y + 0.75 
A(0, 0) 0.3(0) – 0.2(0) + 0.75 0.75
B(100, 0) 0.3(100) – 0.2(0) + 0.75 30.75
C(120, 0) 0.3(120) – 0.2(0) + 0.75 36.75
D(80, 40) 0.3(80) – 0.2(40) + 0.75 16.75

330
 Linear Programming & Simplex Method (Problem Set 3 – 2)
 max = 36.75 at point (120, 0) [Ans.]
 min = 16.75 at point (80, 40) [Ans.]

(b)
Table values of  = – 0.6x + 0.5y – 0.80
Corner Objective Function Value of
Points  = – 0.6x + 0.5y – 0.80 
A(0, 0) – 0.6(0) + 0.5(0) – 0.80 – 0.80
B(100, 0) – 0.6(100) + 0.5(0) – 0.80 – 59.2
C(120, 0) – 0.6(120) + 0.5(0) – 0.80 – 72.8
D(80, 40) – 0.6(80) + 0.5(40) – 0.80 – 28.8
 max = – 28.8 at point (80, 40) [Ans.]
 min = – 72.8 at point (120, 0) [Ans.]

(c)
Table values of  = – 0.7x – 0.9y + 2.50
Corner Objective Function Value of
Points  = – 0.7x – 0.9y + 2.50 
A(0, 0) – 0.7(0) – 0.9(0) + 2.50 2.5
B(100, 0) – 0.7(100) – 0.9(0) + 2.50 – 67.5
C(120, 0) – 0.7(120) – 0.9(0) + 2.50 – 81.5
D(80, 40) – 0.7(80) – 0.9(40) + 2.50 – 89.5
 max = – 67.5 at point (100, 0) [Ans.]
 min = – 89.5 at point (80, 40) [Ans.]

(d)
Table values of  = 0.4x + 0.4y – 0.30
Corner Objective Function Value of
Points  = 0.4x + 0.4y – 0.30 
A(0, 0) 0.4(0) + 0.4(0) – 0.30 – 0.30
B(100, 0) 0.4(100) + 0.4(0) – 0.30 39.7
C(120, 0) 0.4(120) + 0.4(0) – 0.30 47.7
D(80, 40) 0.4(80) + 0.4(40) – 0.30 47.7
 max = 47.7 at points (120, 0) and (80, 40) [Ans.]
 min = 39.7 at point (100, 0) [Ans.]
331
 Bowen, Prichett & Saber’s Mathematics Manual
17 to 24 Try yourself.

332