Additional Topics in Linear Programming (Problem Set 4 – 1)

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

In each of the following, assume that all variables must be

nonnegative unless otherwise indicated.
1. Maximize
 = 2x1 + 2x2
subject to
3x1 + 7x2  42
x1 + 5x2  22.

Solution: For 3x1 + 7x2  42, we get

x1 0 14
x2 6 0

For x1 + 5x2  22, we get

x1 0 22
x2 4.4 0

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

20

10

C(7, 3)
– 20 – 10 D(0, 6) 10 20
x1 A(0, 0) B(14, 0) x1

– 10

– 20

x2
Fig: Solution Space of Given Conditions

From the graph, we get the following corner points:

A = (0, 0)
B = (14, 0)
C = (7, 3)
D = (0, 6)

Table values of  = 2x1 + 2x2

Corner Objective Function Value of
Points  = 2x1 + 2x2 
A(0, 0) 2(0) + 2(0) 0
B(14, 0) 2(14) + 2(0) 28
C(7, 3) 2(7) + 2(3) 20
D(0, 6) 2(0) + 2(6) 12

 max = 28 at point (14, 0) [Ans.]

344
 Additional Topics in Linear Programming (Problem Set 4 – 1)
2. Minimize
 = – 3x1 – 3x2 + 45
subject to
x1 + x2  13
x1 + 2x2  22
2x1 + x2  20
Solution: For x1 + x2  13, we get
x1 0 13
x2 13 0
For x1 + 2x2  22, we get
x1 0 22
x2 11 0
For 2x1 + x2  20, we get
x1 0 10
x2 20 0

Putting these values, we get the following graph:

x2

20

E(0, 11) 10
D(4, 9)
C(7, 6)
– 20 – 10 10 20
x1 A(0, 0) B(10, 0) x1

– 10

– 20

x2
Fig: Solution Space of Given Conditions

345
 Bowen, Prichett & Saber’s Mathematics Manual
From the graph, we get the following corner points:
A = (0, 0)
B = (10, 0)
C = (7, 6)
D = (4, 9)
E = (0, 11)

Table values of  = – 3x1 – 3x2 + 45

Corner Objective Function Value of
Points  = – 3x1 – 3x2 + 45 
A(0, 0) – 3(0) – 3(0) + 45 45
B(10, 0) – 3(10) – 3(0) + 45 15
C(7, 6) – 3(7) – 3(6) + 45 6
D(4, 9) – 3(4) – 3(9) + 45 6
E(0, 11) – 3(0) – 3(11) + 45 12

 min = 6 at points (7, 6) and (4, 9) [Ans.]

3. Maximize
 = 6x1 + 6x2 – 4
subject to
x1 + 2x2  8
– x1 + x2  1
x1 6

Solution: For x1 + 2x2  8, we get

x1 0 8
x2 4 0

For – x1 + x2  1, we get
x1 0 – 1
x2 1 0

For x1  6, we get x1 = 6

346
 Additional Topics in Linear Programming (Problem Set 4 – 1)
Putting these values, we get the following graph:
y

10

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

–5

– 10

y
Fig: Solution Space of Given Conditions

From the graph, we get the following corner points:

A = (0, 0)
B = (6, 0)
C = (6, 1)
D = (2, 3)
E = (0, 1)

Table values of  = 6x1 + 6x2 – 4

Corner Objective Function Value of
Points  = 6x1 + 6x2 – 4 
A(0, 0) 6(0) + 6(0) – 4 –4
B(6, 0) 6(6) + 6(0) – 4 32
C(6, 1) 6(6) + 6(1) – 4 38
D(2, 3) 6(2) + 6(3) – 4 26
E(0, 1) 6(0) + 6(1) – 4 2
 max = 38 at point (6, 1) [Ans.]
347
 Bowen, Prichett & Saber’s Mathematics Manual
4. Minimize
 = – 3x1 – 4x2 + 25
subject to
x1 – 2x2  4
2x1 + 3x2  15
x2  5
Solution: For x1 – 2x2  4, we get
x1 0 4
x2 – 2 0
For 2x1 + 3x2  15, we get
x1 0 7.5
x2 5 0
For x2  5, we get x2 = 5

Putting these values, we get the following graph:

x2

20

10

A(5, 1)
– 20 – 10 10 20
x1 x1

– 10

– 20

x2
Fig: Solution Space of Given Conditions

From the graph, we get the following one optimizing corner point:
A = (5, 1)
348
 Additional Topics in Linear Programming (Problem Set 4 – 1)
Table values of  = – 3x1 – 4x2 + 25
Corner Objective Function Value of
Points  = – 3x1 – 4x2 + 25 
A(5, 1) – 3(5) – 4(1) + 25 6
 min = 6 at point (5, 1) [Ans.]
5. Maximize
 = x1 + 2x2
subject to
– x1 + x2  0
x1 + x2  18
x1  12
Solution: For – x1 + x2  0, we get
x1 0 0
x2 0 0
For x1 + x2  18, we get
x1 0 18
x2 18 0
For x1  12, we get x1 = 12
Putting these values, we get the following graph:
y

20

10
A(9, 9)

–20 – 10 10 20
x x

– 10

– 20
y
Fig: Solution Space of Given Conditions
349
 Bowen, Prichett & Saber’s Mathematics Manual
From the graph, we get the following one optimizing corner point:
A = (9, 9)

Table values of  = x1 + 2x2

Corner Objective Function Value of
Points  = x1 + 2x2 
A(9, 9) 9 + 2(9) 27
 max = 27 at point (9, 9) [Ans.]

6 Try yourself.

7 Try yourself.

8. Maximize
 = 4x1 + 6x2

subject to
x1 + x2  5
2x1 + 3x2  12.

Solution: For x1 + x2  5, we get

x1 0 5
x2 5 0

For 2x1 + 3x2  12, we get

x1 0 6
x2 4 0

350
 Additional Topics in Linear Programming (Problem Set 4 – 1)
Putting these values, we get the following graph:
y

10

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

–5

– 10

y
Fig: Solution Space of Given Conditions

From the graph, we get the following two optimizing corner points:
A = (0, 4)
B = (3, 2)

Table values of  = 4x1 + 6x2

Corner Objective Function Value of
Points  = 4x1 + 6x2 
A(0, 4) 4(0) + 6(4) 24
B(3, 2) 4(3) + 6(2) 24

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

9. Maximize
 = 1.5x1 + 3.5x2
subject to
3x1 + 7x2  42
x1 + 5x2  22.
351
 Bowen, Prichett & Saber’s Mathematics Manual
Solution: For 3x1 + 7x2  42, we get
x1 0 14
x2 6 0
For x1 + 5x2  22, we get
x1 0 22
x2 4.4 0
Putting these values, we get the following graph:
y

20

10

B = (7, 3)
–20 – 10 10 20
x A = (14, 0) x

– 10

– 20

y
Fig: Solution Space of Given Conditions

From the graph, we get the following two optimizing corner points:
A = (14, 0)
B = (7, 3)

Table values of  = 1.5x1 + 3.5x2

Corner Objective Function Value of
Points  = 1.5x1 + 3.5x2 
A(14, 0) 1.5(14) + 3.5(0) 21
B(7, 3) 1.5(7) + 3.5(3) 21
 max = 21 at points (14, 0) and (7, 3) [Ans.]
352
 Additional Topics in Linear Programming (Problem Set 4 – 1)
10. Maximize
 = x1 + x2
subject to
x1 + x2  7
– x1 + x2  1
x1 5

Solution: For x1 + x2  7, we get

x1 0 7
x2 7 0
For – x1 + x2  1, we get
x1 0 – 1
x2 1 0
For x1  5, we get x1 = 5.

Putting these values, we get the following graph:

y

20

10

B = (3, 4) A = (5, 2)
–20 – 10 10 20
x A= x

– 10

– 20

y
Fig: Solution Space of Given Conditions

353
 Bowen, Prichett & Saber’s Mathematics Manual
From the graph, we get the following two optimizing corner points:
A = (5, 2)
B = (3, 4)

Table values of  = x1 + x2
Corner Objective Function Value of
Points  = x1 + x2 
A(5, 2) 5+2 7
B(3, 4) 3+4 7

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

11. Maximize
 = x1 – x2
subject to
x1 – x2  4
x1 5

Solution: For x1 – x2  4, we get

x1 0 4
x2 – 4 0
For x1  5, we get x1 = 5.

354
 Additional Topics in Linear Programming (Problem Set 4 – 1)
Putting these values, we get the following graph:
y

20

10

B = (5, 1)
–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 = (4, 0)
B = (5, 1)

Table values of  = x1 – x2
Corner Objective Function Value of
Points  = x1 – x2 
A(4, 0) 4–0 4
B(5, 1) 5–1 4

 max = 4 at points (4, 0) and (5, 1) [Ans.]

12 Try yourself.

355
 Bowen, Prichett & Saber’s Mathematics Manual
13. Maximize
 = 2x1 + 3x2
subject to
– 2x1 + x2  2
x2  6

Solution: For – 2x1 + x2  2, we get

x1 0 – 1
x2 2 0
For x2  6, we get x2 = 6.

Putting these values, we get the following graph:

y

20

10

–20 – 10 10 20
x x

– 10

– 20

y
Fig: Solution Space of Given Conditions

From the graph, we get unbounded solution space.

So this problem has unbounded solution. [Ans.]

14 to 18 Try yourself.
356