Answers to Chapter 6

Exercise 6A
1

Number of boxes of gold assortment x

Number of boxes of silver assortment y
Objective: maximise P 80x 60y
Constraints
time to make chocolate, 30x 20y 300 60 which simplifies to 3x 2y 1800
time to wrap and pack 12x 15y 200 60 which simplifies to 4x 5y 4000
At least twice as many silver as gold 2x y
non-negativity x, y 0
In summary: maximise P 80x 60y
subject to
3x 2y 1800
4x 5y 4000
2x y
x, y 0
number of type A x
number of type B y
Objective: minimise c 6x 10y
Constraints
Display must be at least 30 m long x 1.5y 30 which simplifies to 2x 3y 60
At least twice as many x as y 2y x
At least six type B y 6
non-negativity x, y 0
In summary: minimise c 6x 10y
subject to:
2x 3y 60
2y x
y6
x, y 0
Number of games of Cludopoly x
Number of games of Trivscrab y
Objective: maximise P 1.5x 2.5y
Constraints
First machine:
5x 8y 10 60 which simplifies to 5x 8y 600
Second machine:
8x 4y 10 60 which simplifies to 2x y 150
At most 3 times as many x as y 3y x
non-negativity x, y 0
In summary: maximise P 1.5x 2.5y
subject to:
5x 8y 600
2x y 150
3y x
x, y 0
Number of type 1 bookcases x
Number of type 2 bookcases y
Objective: maximise S 40x 60y
Constraints
budget
150x 250y 3000 which simplifies to 3x 5y 60
floor space
15x 12y 240 which simplifies to 5x 4y 80
At most _31 of all bookcases to be type 2 y _31 (x y) which simplifies to 2y x
At least 8 type 1 x 8
non-negativity x, y 0
In summary: maximise S 40x 60y
subject to:
3x 5y 60
5x 4y 80
2y x
x8
x, y 0

All units now in minutes.

All units now in minutes.

ANSWERS

Let x number of kg of indoor feed and y number of kg of outdoor feed

Objective: maximise P 7x 6y
Constraints
Amount of A
10x 20y 5 1000 which simplifies to x 2y 500
All units now in grams.
Amount of B
20x 10y 5 1000 which simplifies to 2x y 500
Amount of C
20x 20y 6 100 which simplifies to x y 300
At most 3 times as much y as x y 3x
At least 50 kg of x
x 50
non-negativity y 0 (x 0 is unnecessary because of the previous constraint)
In summary: maximise P 7x 6y
subject to
x 2y 500
2x y 500
x y 300
y 3x
x 50
y0
number of A smoothies x
number of B smoothies y
number of C smoothies z
Objective: maximise P 60x 65y 55z
Constraints
oranges
x _21 y 2z 50
which simplifies to 2x y 4z 100
raspberries
10x 40y 15z 1000 which simplifies to 2x 8y 3z 200
kiwi fruit
2x 3y 2 100
apples
2x _21 y 2z 60
which simplifies to 4x y 4z 120
non-negativity
x, y, z 0
In summary: maximise P 60x 65y 55z
subject to:
2x y 4z 100
2x 8y 3z 200
2x 3y z 100
4x y 4z 120
x, y , z 0
Let number of hours of work for factory R x
Let number of hours of work for factory S y
Objective: minimise C 300x 400y
Constraints
milk
1000x 800y 20 000
which simplifies to 5x 4y 100
yoghurt
200x 300y 6000
which simplifies to 2x 3y 60
At least _31 of total time for R x _31 (x y) which simplifies to 2x y
At least _31 of total time for S y _31 (x y)
non-negativity
x, y 0
In summary: minimise C 300x 400y
subject to:
5x 4y 100
2x 3y 60
2x y
2y x
x, y 0

which simplifies to 2y x

ANSWERS

Exercise 6B
1

c
30
28
26
24
22
20
18
16
14
12
10
8
6
4
2
0

x3

8
7

f c 28

2x 3y

6
5

2f 3c 60

4
3
2

3x 4y 24

y1

1
0

R
(feasible region)

9 10 x

f 2c 36

0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 f
y

x 200

5
R

y 2x

480

20

2x y

18
16

400

14
320

12

y 10

10

240

y 80

x y 400

80
0
3

80

160

240

320

400

5x 6y 60
0

2x 3y 18

8 10 12 14 16 18 20 x

y 2x 3

y
7

x y 20

y5

480

yx

1
0

160

y3

3
0

9 10 x

2
1
0

y 6 2x
0

8 x

Exercise 6C
1

a Need intersection of 4x y 1400 and 3x 2y 1200

(320, 120)
m 760
b (0, 400)

N 1600

Objective line passes through (400, 0) and (100, 0).

c Need intersection of x 3y 1200 and 3x 2y 1200

P 514_72
( 171_73, 342_76 )
d (350, 0)

Q 2100

Objective line passes through (200, 0) and (0, 400).

Objective line passes through (200, 0) and (0, 200).

Objective line passes through (100, 0) and (0, 600).

ANSWERS

4
5

a (0, 90)
E 90
b Need intersection of 6y x and 3x 7y 420
(100.8, 16.8)
F 168
c Need intersection of 9x 10y 900 3x 7y 420
8
9
7
__
__
__
, 3211
G 32111
( 6311
)
d Same intersection as in b (100.8, 16.8) H 201.6
a Need intersection of 3x y 60 and 5y 3x
J 56_32
( 16_32, 10 )
b Need intersection of y 4x and 9x 5y 450
15
2
17
__
__
__
, 6229
K 7729
( 1529
)
c Need intersection of 3x y 60 and y 4x
L 85_75
( 8_74, 34_72 )
d Need intersection of 9x 5y 450 and 5y 3x
(37.5, 22.5)
m 97.5
a C
b A
c B
d D
e C
f
y
a

Objective line passes through (80, 0) and (0, 60).

Objective line passes through (120, 0) and (0, 20).

Objective line passes through (10, 0) and (0, 60).

Objective line passes through (40, 0) and (0, 80).

g B
b

h D

Vertices

C 3x 2y

(0, 160)

320

(40, 80)

280

120

(90, 30)

330

100

(180, 0)

540

160
140

2x y 160

x y 120

60
40

B (90, 30)

20
O

x 3y 180
20 40 60 80 100 120 140 160 180 200 x

C1 x y
(objective for (c))

C1 2x 3y
(objective for (c))

C 3x 2y
(objective for (b))
6

b i

y 5x

70
60

ii

23
(10 40
59 , 53 59 )

50

14x 9y 630

40

(6 23 ,

2y x

2
1
(34 37
, 17 37
)
1
2
(13 3 , 6 3 )

20
10
O

33 13 )
R

30

P x 3y
5

10 15 20 25 30 35 40 45 x
4x y 60
Q 6x y

so minimum is (40, 80) value of C 280

c (90, 30)
C1 270
d C2 is parallel to x + y 120 so all points from A to B
are optimal points.

A (40, 80)

80

( 13_31, 6_32 )
2
1
__
__
, 1737
( 3437
)

P 33_31
13
__
Q 22137

ANSWERS

y 10x

x 120

450
400
350

(33 13 , 333 13 )

300
250
2y x 100

200

R
5
(5 19
, 52 12
19 )

150

(120 , 160)
(120 , 110)

100
50

x 2y

2x y 400

20 40 60 80 100 120 140 160 180 200 x

z 5x y
z 760
18
__
z 7819

b i (120, 160)
5
12
__
__
ii ( 519
, 5219
)

c Optimal point ( 33_31, 333_31 ) optimal value of x 2y 700

8

x 50

y 3x

500

y
30

450

25

400

20

2x y 500

350

2y x

15

300

10
7x 6y 2100

250

200

150
x 2y 500

x y 300

50

2x 3y 60
5

10 15 20 25 30 35 40 x
5x 4y 100

100

y 2x

50 100 150 200 250 300 350 400 450 500 x

Objective line passes through (0, 15) and (20, 0).

Intersection of 2x 3y 60 5x 4y 100
( 8_47, 14_27 ) value 8285_57

Objective line passes through (0, 350) and (300, 0).

Maximum point is (200, 100). Pmax 2000.

Exercise 6D
1

Maximum integer value

(5, 1) 3x 2y 17

10
1
8

4xx 3y 24
2

6
4

3x 4y 24

2
O

5 10
10 x x 5y
1

3x 2y
2

ANSWERS

30

200

28

180

26

160

24

y 4x

140

4x y 28

22

120

20

100

18

80

16

60

Ob

14

40

iv e
ject 2y

5x

12

20

10

2y x
R

5x 4y 800

20 40 60 80 100 120 140 160 180 200 x

e
tiv
jec y

2x

Solving 2y x and 5x 4y 800 simultaneously gives

( 114_72, 57_71 )
Test integer values nearby.

Ob

10 12 14 16 18 x

5x 6y 60
Minimum integer value (6, 6) 2x y 18

Point

2y x

5x 4y 800

5x 2y

(114, 57)

684

(114, 58)

(115, 57)

(115, 58)

so optimal point is (114, 57) value 684

4

Solving 3x 16y 2400

3x 5y 1500
9
7
__
__
simultaneously gives ( 36311
, 8111
)
Taking integer point

yx

300
250
200

3x 5y 1500

150

100

O
5

3x 16y 2400

Objective
2x y

50

100 200 300 400 500 600 700 800 x

(363, 82)

(364, 81)

(364, 82)

4x 5y 4000 3x 2y 1800 80x 60y

700

Point

600

(142, 685)

52 460

(142, 686)

52 520

(143, 685)

52 540

(143, 686)

500
400

300

100
O

4x 5y 4000

e
tiv
jec 3y
Ob x
4

200

200

400

600

800

1000

3x 2y 1800

3x 5y 1500

Intersection of 4x 5y 4000 and 3x 2y 1800

gives ( 142_76, 685_75 )
Testing nearby integer points

y 2x

800

3x 16y 2400

So optimal integer point is (363, 82)

Value 808

y
900

Point
(363, 81)

so maximum integer solution is 52 540 pennies at (143, 685).

ANSWERS

y
22
20
18
16
14
12
10
8
6
4
2
O

Intersection of 2x 3y 60 and y 6
(21, 6)
cost c 6x 10y
so minimum cost 6 21 60
186

x 2y

R
y6
2x 3y 60
2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 x
Objective
6x 10y

Intersection of 5x 8y 600
6
10
__
__
2x y 150 giving ( 5411
, 4011
)

160
140

2x y 150

120
100
80
60

6
(54 11
,

40

Points

5x 8y 600

2x y 150

1.5x 2y

(54, 40)

161

(54, 41)

163

(55, 40)

162.5

(55, 41)

so maximum value is 163 at (54, 41).

40 10
11 )
x 3y

20
O

20 40 60 80 100 120 140 x

5x 8y 600

Objective
1.5x 2y
8

Intersection of 3x 5y 60
8
4
__
__
5x 4y 80 giving ( 1213
, 413
)

y
x8

20
16

2y x

12
8

Points

3x 5y 60

5x 4y 80

40x 60y

(12, 4)

720

(12, 5)

(13, 4)

(13, 5)

Maximum value is 720 at (12, 4).

4
O

R
4

12

3x 5y 60

16

20

Objective line 5x 4y 80
40x 60y

Mixed exercise 6E
1

a flour:
200x 200y 2800 so x y 14
fruit:
125x 50y 1000 so 5x 2y 40
b Cooking time 50x 30y 480 so 5x 3y 48

ANSWERS

20
18

d P 3.5x + 1.5y
e Integer solution required (6, 5)
f Pmax 28.50

5x 2y 40

16
14
12

8
6
4

5x 3y 48
e
lin
tive 5y
jec
.
Ob x 1
3.5

10

2
O
2

x y 14

8 10 12 14 16 18 20 x

5x 4y 350
b cost: 6x 4.8y 420
c Display 30x 2 20y 3x 4y
e Integer solution required (43, 33).

y
90

5x 4y 350

80
70

3x 4y

60
50
40
30
20

R
Objective
3x 2y
x y 80

10
O
3

a i

Total number of people

54x 24y 432 so 9x 4y 72
ii number of adults x y 12
iii number of large coaches x 7
c minimise C 336x 252y
84(4x 3y)
d Objective line passes through (0, 4) (3, 0)
e Integer coordinates needed (7, 3)
cost 3108

10 20 30 40 50 60 70 80 90 x

y
18

9x 4y 72

x7

16
14
12
10
8
6
R

x y 12

2
O

Objective
84(4x 3y)

10 12 x

ANSWERS

4x 5y 47
y 2x 8
4y y 8 0
x, y 0
b Solving simultaneous equations

For example where x and y

types of car to be hired
number of people etc
5 a 2_21x + 3y 300 [5x + 6y 600]
5x + 2y 400
2y 150 [ y 75]
b Maximise P 2x + 4y
c
y
c i

y 2x 8
4x 5y 47
3
__
, 4_73
614

ii (6, 4)

(30, 75) P 360

200
180

5x 2y 400

160
140
120
100
y 75

80
60
40
20
O

R
Ob

jec

2 12 x 3y 300

tiv

20 40 60 80 100 120 140 x

d The optimal point is at the intersection of y 75 and 2_21x + 3y 300.

So the constraint 5x + 2y 400 is not at its limit.
At (30, 75) 5x + 2y 300 so 100 minutes are unused.