CHAPTER 4 : LINEAR PROGRAMMING

TUTORIAL
LINEAR PROGRAMMING

4.1 GRAPH SOLE

1 Determine the system of inequalities that can be define the feasible region, R in the following
graph:
a) y b) y

7
24
5
R
16
15
R
3.5 5 10 x x
0 12 16 45

c) y d) y

9
8 (2,8)
4
R R
1 4

–3 x
1

x
2 4

4.2 SOLE GRAPH

2. Shade the feasible region satisfying the following system of inequalities:
a) 2 x + 2 y  50, b) x + y  50,
5 x + y  45, y + 3x  90,
− x + y  70. x  0,
y  0.
c) x + y  10, d) − 4 x + 5 y  20,
y + x  2, x  0,
− 2 x + y  10, y − 12  x,
x  3, 13 y + 5 x  5.
y  0.

Mathematics Unit KMJ | Page 20

 CHAPTER 4 : LINEAR PROGRAMMING

4.3 PROBLEM FORMULATION

3. Azizan Cinema has a theatre that can seat a maximum of 300 customers. For each of adult and
child ticket sold profits of RM5 and RM3 was made respectively. The manager reserves at
most 100 seats for children. However, at least 2 times as many children ticket sold than adult
ticket. Formulate the objective function and determine the constraints, if the manager wants to
maximise profit.

4. SMK Hebat students want to suprise their teachers for Teachers’ Day celebration this year.
Male teachers will get a Parkor fountain pen each and female teachers will get a Thermosh
mug each. Due to budget constraint, the Students’ Association Board (who is handling the
present suprise) are only allowed to spend RM5000 this year and use a 40m2 coloured paper
as a wrapper for the presents. The cost for a Parkor fountain pen is RM20 and for a Thermosh
mug is RM10. To make things worse, the supplier’s store had been robbed and they only be
able to supply the students with less than 100 Thermosh mugs. 60cm2 of paper wrap is needed
to wrap a pen and another 75cm2 of paper wrap for a mug. The female students of the Board
reserves at least 20 fountain pens for their favourite teachers. If they want to minimise the
cost, formulate the objective function and determine the constraints.

5. A famous mobile phone manufacturer, Slamshung want to release two new models which are
Galaxy e4 and Snote 3π. Due to a very good demand for Galaxy e3 last year, they are planning
to launch as many as 3000 unit of limited-edition Galaxy e4. Snote 3π-1 doesn’t penetrate the
market well last year so they want to play it safe by releasing as many as 100 unit of limited-
edition Snote 3π. According to a survey, 25 times as many people prefer Galaxy e4 than Snote
3π. They can be profitted RM5000 for each unit of Galaxy e4 sold while RM300 for each unit
of Snote 3π sold. Formulate the objective function and determine the constraints, if they wish
to maximise the profit.

Mathematics Unit KMJ | Page 21

 CHAPTER 4 : LINEAR PROGRAMMING

4.4 PROBLEM SOLVING

6. A ice cream seller mixes three kinds of fruits i.e. cashew, hazelnut and pistachios in his recipe.
The table below shows the mixture.

Weight of
Weight of Weight of
Mixture pistachios
cashew (gram) hazelnut (gram)
(gram)
Ice
10 6 100
cream A
Ice
15 24 25
cream B

The nut seller has 75 kilogram of cashew, 36 kilogram of hazelnut and 52.5 kilograms of
pistachios. The profit of each package of Ice cream A and Ice cream B mixture respectively
are RM0.50 and RM0.60. Let x be the number of packages for Ice cream A mixture and y be
the number of packages for Ice cream B mixture,

a) Determine the objective function and formulate the system of inequalities satisfying the
given constraints.
b) Sketch the feasible region satisfying the systems of inequalities.
c) Find the number of packages of each grade of mixture that will realize maximum profit.
State the profit.

7. Singapore Matriculation College Mathematics Department want to produce their own tutorial
book for Mathematics and Statistics students next year. They have been given a 60-days
deadline for drafting and editing and printing respectively by the senate for them to publish
the books. The table shows the production time and cost requirement for each tutorial book.

Production Time (Days)

Production Cost
Book Drafting &
Printing (SGD/unit)
Editing
MAT-036 9 2 4.5
STA-024 3 4 1.5

a) Determine the objective function and formulate the system of inequalities satisfying the
given constraints.
b) Sketch the feasible region satisfying the systems of inequalities in (a).

Mathematics Unit KMJ | Page 22

 CHAPTER 4 : LINEAR PROGRAMMING

c) Find the number of book for each subject that will minimise the cost. State the minimum
cost.

8. Chef Ainan is going to make a new recipe of chocolate cakes and cheese cakes. Each cheese
cake needs 10 eggs while each chocolate cake need 5 eggs. Chef Ainan reckons that by
limiting the amount of cakes he’s baking, it will attract more customer so he decided to make
no more than 10 chocolate cakes and at least 3 cheese cakes. He can make profit of RM 9 and
RM 6 by selling each chocolate and cheese cake respectively. He wants to make maximum
profit but he is limited to 100 eggs.
a) Formulate the given information in the form of linear programming model.
b) Shade the feasible region satisfying the system of inequalities in part (a).
c) Determine the number of cakes needed in order to achieve his goal.

9. The table below shows two new products of SyahirPharm. Each product has their own recipe
as follows.

GamatOK TongkatAliWow! Stock

Nutrients
(grams) (grams) (grams)
Iron 20 40 1200
Beta-
70 90 3150
carotene
Vitamin F 40 20 1360
Cost RM0.70 RM0.40

a) Determine the objective function and formulate the system of inequalities satisfying the
given constraints.
b) Sketch the feasible region satisfying the systems of inequalities.
c) By evaluating the objective function at each vertex of the feasible region, find the number
of grams of each type of product that should be produced to minimise the cost. Hence,
find the minimum cost.

Mathematics Unit KMJ | Page 23

 CHAPTER 4 : LINEAR PROGRAMMING

PAST YEAR EXAMINATION QUESTIONS

2004/2005
10. A young entrepreneur’s company produces bread and cakes. A loaf of bread contains 1 unit
of ingredient A, 1 unit of ingredient B and 2 units of ingredient C while a cake contains 5
units of ingredient A, 2 units of ingredient B and 1 unit of ingredient C. The selling price of
a loaf of bread and a cake is RM 0.80 and RM 2.00 respectively. An expert baker suggests
that the total ingredient should consist of 150 units of ingredient A, 90 units of ingredient B
and 120 units of ingredient C. Assume that X represents the number of bread and Y
represents the number of cakes.

a) Determine the objective function and formulate the system of inequalities that satisfies
the given constraints. [4 marks]

b) Sketch the feasible region that satisfies the system of inequalities in part (a).
[4 marks]

c) By evaluating the objective function at each vertex of the feasible region, find the
number of bread and cakes to be produced to maximise the total revenue. Hence, find
the maximum total revenue. [4 marks]

2005/2006

11. Determine the system of inequalities satisfying the feasible region R in the following
figure:

20

R
8
x
5 8 20

[6 marks]

Mathematics Unit KMJ | Page 24

 CHAPTER 4 : LINEAR PROGRAMMING

12. A publishing company produces two types of books X and Y. The company has a
production time of 3 hours 30 minutes for evaluation process and 3 hours for printing
process. The production time and cost requirements for each book are given in the
following table.

Production Time (minute) Production Cost

Book Evaluation Process Printing Process (RM/unit)
X 4 6 10
Y 5 3 15
a) Determine the objective function and formulate the system of inequalities satisfying the
given constraints. [3 marks]
b) Sketch the feasible region that satisfies the system of inequalities in (a). [4 marks]
c) By using corner point method, determine the number of each book to minimise the cost.
Hence, state the minimum cost. [5 marks]

2006/2007

13. On the same graph, shade the feasible region satisfying the following system of
inequalities

4 x + 3 y  24
x+ y4
2x  y
x4

[7 marks]

14. Miss Maria sells her home-made biscuits. As a start, she makes two types of biscuits which
are Biscuit A and Biscuits B. She is capable of making at most 15 kilograms (kg) of
biscuits per day. Miss Maria makes Biscuit A at least 25 % of Biscuit B. At the same time
she has an agreement to supply at least 5 kg of Biscuit B per day. The cost of producing
1kg of Biscuit A and 1kg of Biscuit B are RM3.00 and RM4.50 respectively. The profit
obtained for producing 1kg of Biscuit A and 1kg of Biscuit B are RM10.00 and RM13.00
respectively. Assume that x is the weight (kilogram per day) of Biscuit A and y is the
weight (kilogram per day) of Biscuit B.

a) State the objective function to minimise the cost and formulate the system of
inequalities satisfying the given constraints. [3 marks]
b) Sketch the feasible region satisfying the system of inequalities in part (a).
[4 marks]
c) Determine the weight (kilogram per day) to minimise the cost and state the minimum
cost by evaluating the objective function at each vertex of the feasible region. Hence,
find the profit obtained. [5 marks]

Mathematics Unit KMJ | Page 25

 CHAPTER 4 : LINEAR PROGRAMMING

2007/2008

15. Find the system of inequalities satisfying the feasible region R given in the graph below:
y

14
(2,10)
10

R
4 (6,2)

x
0 7 12
[6 marks]

16. A chemical company produces two brands of fertilizer. Regular Brand and Super Brand.
Regular Brands contains the mixture of materials A,B and C in the ratio of 1:3:6 (by weight)
and Super Brand contains the mixture of materials A,B and C in the ratio 3:4:3. Each month
the company receives supply of 6,9 and 12 tonnes of material A,B and C respectively. The
profits obtained for producing each tonne of Regular Brand fertilizer and each tonne of
Super Brand fertilizer are RM150 and RM240 respectively. The materials requirement and
the profit for each brand are given in the following table.

Material(tonne) Profit
Brand
A B C (RM/tonne)
Regular
0.1 0.3 0.6 150
Brand
Super Brand 0.3 0.4 0.3 240
Supply 6 9 12

Assume that x is the number of tonne for Regular Brand and y is the number tonne for
Super Brand fertilizer.

a) Determine the objective function to maximise the profit and formulate the system of
inequalities satisfying the given constraints. [4 marks]
b) Sketch the feasible region satisfying the system of inequalities in part (a).

[4 marks]

c) By evaluating the objective function at each vertex of the feasible region, determine the
number of tonne for each brand of fertilizer to maximise the profit. Hence, state the
maximum profit obtained. [5 marks]

Mathematics Unit KMJ | Page 26

 CHAPTER 4 : LINEAR PROGRAMMING

2008/2009

17. On the same graph, sketch the graph and shade the feasible region satisfying the following
system of inequalities:
2 x + 5 y  20
− 2 x + y  10
x + y  13
x 1
y2

[6 marks]

18. A company produces 500 products of M and N. The minimum capital allocated is RM500.
The cost of producing a unit of product M and N are RM2 and RM1 respectively. At least
200 units of product N must be produced, while not more than 250 units for product M.
The selling price per unit of product M and N are RM5.50 and RM3.80 respectively.
Assume x and y represent the number of units of product M and N produced respectively.

a) Formulate the given information in the form of linear programming model.

[4 marks]

b) Shade the feasible region satisfying the system of inequalities in part (a).
[4 marks]

c) Determine the number of units of products M and N that will maximise sales and state
the maximum sales. [5 marks]

Mathematics Unit KMJ | Page 27

 CHAPTER 4 : LINEAR PROGRAMMING

2009/2010

19. Find the system of inequalities satisfying the feasible region R in the following graph.

y
8

3  7 10 
 , 
3 3 
(2,2)

1 R
x
4 6

[6 marks]

20. A company manufactures two products namely product A and product B. The production
of these two products involves the following three processess: fabricating, assembling
and painting. The weekly capacity for these processes are 72 hours, 30 hours and 40
hours respectively. Every unit of product A requires 2 hours of fabricating, 1 hour of
assembling and 1 hour of painting. Every unit of product B requires 3 hours of
fabricating, 1 hour of assembling and 2 hour of painting. The profit obtained from the
sale of each unit of product A and product B are RM15 and RM20 respectively.
The work-hours requirement and the profit for each unit for each unit of product A and
product B are summarized in the following table.

Work-hours per unit Profit

Product
Fabricating Assembling Painting (RM/unit)
A 2 1 1 15
B 3 1 2 20

Mathematics Unit KMJ | Page 28

 CHAPTER 4 : LINEAR PROGRAMMING

Assume that the company can sell all the products it produces and let x be the number of
product A produced and y be the number of unit of product B prodeced.
a) Determine the objective function to maximise the profit and formulate the given
information in the form of linear programming model. [4 marks]
b) Shade the feasible region satisfying the system of inequalities in part (a).
[4 marks]
c) By evaluating the objective function at each vertex of the feasible region, determine
the number of unit of each product that will maximise the weekly profit. Hence, state
the maximum profit obtained. [4 marks]

Mathematics Unit KMJ | Page 29

 CHAPTER 4 : LINEAR PROGRAMMING

SUGGESTED ANSWERS
1. GRAPH SOLE
a) x, y  5, b) x + y  16,
2 y + x  10, y + 2 x  24,
y + 2 x  7. 3 y + x  45,
x  0,
y  0.
c) y − 3x  9, d) y − 2 x  4,
y  4, y + 2 x  8,
x + y 1 x  2.
x  0.
2. SOLE GRAPH
a) y b) y
70
90

50
R 45

25
x
R
x
30 50
-70 9 25
c) y d) y

12
10

R 4

R 5
2 13

x x
5 2 3 10 1
-12 -5

Mathematics Unit KMJ | Page 30

 CHAPTER 4 : LINEAR PROGRAMMING

3) Maximise P = 5 x + 3 y,
Subject to
x + y  300,
y  2 x,
y  100,
x, y  0.
4) Minimise C = 20 x + 10 y, ,
Subject to
20 x + 10 y  5000,
60 x + 75 y  400 000,
x  20,
y  100,
x, y  0.

5) Maximise P = 5000 x + 300 y, ,

Subject to
x  3000,
y  100,
x  25 y,
x, y  0,

6) a)Maximise P = 0.5 x + 0.6 y,

Subject to
2 x + 3 y  15000,
x + 4 y  6000,
4 x + y  2100,
x , y  0.

MATHEMATICS UNIT KMJPage 31

 CHAPTER 4: LINEAR PROGRAMMING

b)
x

5000

2100
1500 (160,1460)

R
y
525 6000 7500

c) Thus, maximum profit of RM956.00 made when there are 160 packages of Ice cream
A and 1460 packages of Ice cream B.
7) a)Minimise C = 4.5 x + 1.5 y,
Subject to
3x + y  20,
x + 2 y  30,
x, y  0.
b)
x

20
(2,14)
15

R
y
8 30

c) Thus, minimum cost of SGD22.5 is made when there are 0 unit of MAT-036 book and
15 units of STA-024 book published.

8) a)Maximise P = 9 x + 6 y,
Subject to
x + 2 y  20,
x  10,
y  3,
x, y  0.

Mathematics Unit KMJ | Page 32

 CHAPTER 4: LINEAR PROGRAMMING

b)
x
(0,10)
10

(10,5)
R
3
(0,3) (10,3)
y
10 20

c) Thus, maximum profit of RM120 is made when there are 10 chocolate cake and 5
cheese cakes sold by Chef Ainan.

9) a) Minimise C = 0.7 x + 0.4 y,

Subject to
x + 2 y  6,
5 x + y  10,
2 x + y  8,
x, y  0.
b)
x

68

35
30 (18,21)
(27,14)
R
y
34 45 60

c) Thus, minimum cost of RM1.20 is made when there are 0 gram of GamatOK and
30 grams of TongkatAliWow! is produced.

Mathematics Unit KMJ | Page 33

 CHAPTER 4: LINEAR PROGRAMMING

10. Maximise P = 0.8 x + 2 y,

Subject to
2 x + 5 y  150,
x + 2 y  90,
2 x + y  120,
x , y  0.

120
2 x + y = 120

45 x + 2 y = 90
30
R x + 5 y = 150
y
60 90 150

The maximum revenue is RM80. To maximise the revenue 50 units of bread and 20 units
of cakes should be produced.

11.
y + x  20,
y  2 x − 16,
x  5,
y  8.
12.
Minimise C = 10 x + 15 y,
Subject to
4 x + 5 y  210,
6 x + 3 y  180,
x , y  0.

Mathematics Unit KMJ | Page 34

 CHAPTER 4: LINEAR PROGRAMMING

60
6 x + 3 y = 180

42
R 4 x + 5 y = 210
y
30 52.5

The minimum cost is RM300. To minimise the cost, 30 units of Book A and 0 unit of
Book B have to be published.
13.
x x=4

8 2x = y

4 R
4 x + 3 y = 24
x+ y =4
y
4 6

14.
Maximise C = 3x + 4.5 y,
Subject to
x + y  15,
x  0.25 y,
y  5,
x  0.

Mathematics Unit KMJ | Page 35

 CHAPTER 4: LINEAR PROGRAMMING

x + y = 15

R y=5

x = 0.25 y
y

The minimum cost is RM26.25. To minimise the cost 1.25 kilos of Biscuit A and 5 kilos
of Biscuit B should be made. The profit obtained is RM77.50.

15.
7 y + 4 x  28,
y + 2 x  14,
6 y + 5 x  60,
3 y  x,
x  2,
y  0.
16.
Maximise P = 150 x + 240 y,
Subject to
0.1x + 0.3 y  6,
0.3 x + 0.4 y  9,
0.6 x + 0.3 y  12,
x, y  0.

40 0.6x+0.3y=12

22.5
0.3x+0.4y=9
20
0.1x+0.3y=6
R
y
20 30 60

Mathematics Unit KMJ | Page 36

 CHAPTER 4: LINEAR PROGRAMMING

The maximum profit is RM 5220. To maximise the profit 6 tonnes Regular Brand and 18
tonnes Super Brand fertilizer should be produced.

17.
x
x=1
13
-2x+y=10

x+y=13
4 R
y=2
2x+5y=20
y
10 13

18.
Maximise P = 5.5 x + 3.8 y,
Subject to
x + y  500,
2 x + y  500,
x  250,
y  200,
x, y  0.

500 x+y=500
x=250

R
200
y=200
2x+y=500
y
250 500

The maximum profit is RM2325. To maximise the profit 250 units of product M and 250
units of product N should be sold.

Mathematics Unit KMJ | Page 37

 CHAPTER 4: LINEAR PROGRAMMING

19.
y + 2 x  8,
2 y + x  6,
y − x  1,
y  2,
y  0,
x  0.
20.
Maximise P = 15 x + 20 y,
Subject to
2 x + 3 y  72,
x + y  30,
x + 2 y  40,
x , y  0.

30
x + y  30
24
2 x + 3 y  72
20 (20,10)
R x + 2 y  40
y
30 36 40

To maximise the profit, 20 units of product A and 10 units of product B have to be

produced. The maximised profit is RM500.

Mathematics Unit KMJ | Page 38