CHAPTER 4 : LINEAR PROGRAMING

||||||||||2021/2022||||||||||||
(3 Hours L+ 5 Hours T)
TOPIC 4:LINEAR CLO/
Hour
PROGRAMMING LEARNING OUTCOMES DOMAIN
4.1 System of Linear At the end of this topic, students should be able CLO1
Inequalities to:
a) Represent the system of linear inequalities C1
graphically.
3 C1
b) Identify the feasible region.
c) Determine the system of linear inequalities C2
defined by the feasible region.

4.2 Problem At the end of this topic, students should be able CLO1
Interpretation, to:
Formulation and a) Identify the variables from the problem C1
statement.
solving.
b) Determine the objective function of the 5 CLO3/C3
problem.
c) Formulate the system of linear inequalities
C2
in economics and business problems.
d) Compute the optimal value of an objective
function using the vertices of a feasible CLO3/C3
region.

1
 4.1 SYSTEM OF LINEAR INEQUALITIES (CLO 1/C1)

1. We can express the inequalities by using the symbol ,  ,  or  .

2.
Inequalities Key words
 less than

 more than

 at most , not more than

 at least , not less than

Example 1: Express the following statements mathematically.

y is more than 2x + 1
y is less than 2x + 1
y is not less than 2x + 1
y is not more than 2x + 1

3. When we plot the graph for linear inequalities, solid line is used to represent  or  . We
use a solid line to show that all points on the line are also solutions to the problem.

4. While the broken line is used to represent  or  . We use a broken line to show that all points
on the line are not solutions to the problem.

2
FEASIBLE REGION

5. Represent the linear inequalities graphically:

a. y2 b. y2

c. y4 d. x3

e. x3 f. x2

3
6. For slant lines,

Region above

y  mx + c y  mx + c
the line
(a) OR

y
y

R R
x
x

Region below
(b) y  mx + c OR y  mx + c the line

y
y

R R x
x

4
7. Three forms of a linear equation

y = mx + c ……….gradient form
ax + by + c = 0 …..general form
x y
+ =1 ………..intercept form
a b

8. There are 2 methods to graph an inequality.

Example 2: Graph the inequality 2 x + y  10 …..…….[ Method 1 ]

Step 1 : Replace the inequality  by an

equality =  2 x + y = 10

Step 2 : Find y when x = 0

2(0) + y = 10
y = 10
Step 3 : Find x when y = 0
2 x + 0 = 10
x=5
Step 4 :  so we use solid line
Step 5 : Draw the straight line
Step 6 : Determine the region (above or
below)
Step 7 : Checking (Test point)

5
Example 3: Graph the inequality 2 x + y  10 …..…….[ Method 2 ]

Step 1 : Replace the inequality  by an

equality =  2 x + y = 10

Step 2 : Change to intercept form

2 x + y = 10...............  10
x y
+ =1
5 10

Step 3 :  so use solid line

Step 4 : Draw the straight line

Step 5 : Determine the region (above or
below)
Step 6 : Checking (Test point)

Example 4: For each of the following, graphically determine the region (R) which satisfies the
inequalities:
a. 3 y  − x + 3
METHOD 1 METHOD 2 Graph

6
 b. x + 8  2 y
METHOD 1 METHOD 2 Graph

c. 4 x − 42  6 y
METHOD 1 METHOD 2 Graph

7
 x y
d. − 1
4 5
METHOD 1 METHOD 2 Graph

1 2
e. y x
2 3
METHOD 1 METHOD 2 Graph

8
To determine the feasible region:

9. The region that satisfies a system of inequalities is called the feasible region.

10. The feasible region that is not enclosed is called an open region. Whereas, a feasible region that is
enclosed is called a closed region.

Closed region. Open region

y
y

7
R
5 1
R x
x -1
7 y=x+1
2y = 5x

Example 5: On the same graph, shade the feasible region satisfying the following system of
inequalities 4 x + 3 y  24 x+ y 4 y  2x x  4.

9
Example 6 : Shade and label the feasible region R defined by the following inequalities
x y 3
y  0, y  6, x  5, +  1, y  − x + 8.
2 8 4

10
To determine the system of linear inequalities defined by the feasible region:

Example 7: Find the system of linear inequalities defined by the following feasible regions (R).

(a)

(b)

11
(c)

(d)

12
 4.2 PROBLEM INTERPRETATION, FORMULATION AND SOLVING
(CLO 1/C1,C2 & CLO 3/C3)

Example 8 : Chef Farahin wants to make 2 types of bread, croissant and pain au chocolate. The
croissant uses 180g butter and 800g flour. While the pain au chocolate uses 150g butter
and 550g flour. She already prepared 2kg butter and 8kg flour. Find the inequalities for
this problem. Hence, sketch the feasible region.
Solution:

13
11. A linear programming problem is one in which a linear function, called the objective function, is to
be minimised or maximised subject to a set of constraints represented by a system of inequalities.

Example 9 : Amira plans to take two types of supplement. One sachets of each supplement
ingredients are summarised in the following table.

One sachet of
Nutrition Information
Suplement A Suplement B
Units of protein 16 24
Units of carbohydrate 5 7
Units of calcium 3 5
Calories 80 150

Amira wishes to determine the number of units of each supplement to take daily so that every meal
containing at least 40 units of protein, 18 units of carbohydrates and 12 units of calcium, and as few
calories as possible. Determine all the constraints and the objective function.
Solution:

WEEK 5

14
12. The optimal solution can always be found at a corner (vertex) of the feasible region.

Vertex

13. Steps in finding the maximum or minimum value of an objective function given the constraints.

(a) Sketch the feasible region, R

(b) Find the coordinates of all the vertices in the feasible region
(c) Find the value of the objective function at each of the vertices
(d) Choose the vertex that maximises or minimises the objective
function.

15
Example 10 : Find the maximum and minimum values for the function z = x − 3 y + 5 for the
following feasible region :

x + y  4; x − y  −2; x  3; y  0
Solution:

16
Example 11 : A company produces 2 types of products, Lilo and Stich. Each product needs to go
through 3 types of processes, A, B and C. The time that is required to produce a unit of
Lilo is 12 minutes of process A, 6 minutes of process B and 3 minutes of process C. For
a unit of Stich is 6, 9 and 3 minutes, respectively. The time allocated for process A is 120
hours, for process B is 90 hours and for process C is 35 hours. The profit made for each
unit of Lilo is RM 3.00, whereas the profit made for each unit of Stich is RM 5.00. Let
x be the number of units of Lilo and y the number of units of Stich.
(a) Write down all the constraints.
(b) Determine the objective function.
(c) Sketch the feasible region
(d) Determine the maximum profit and the number of units of Lilo and Stich that
need to be produced.

17
 LECTURE DRILL

A farmer has 160 hectares of land for planting tomatoes and cabbages. He must grow at least 20 hectares
of land for tomatoes and 40 hectares of land for cabbages to meet the market demands. His work force and
equipment will only allow him to plant a maximum of 60 hectares of land for tomatoes. The profit for
planting tomatoes is RM500 per hectare and for cabbages is RM800 per hectare. Let x and y be the number
of hectares of land for planting tomatoes and cabbages respectively.

(a) Determine the objective function that maximizes the profit and formulate the given information in
the form of linear programming model.
[Ans: x + y  160, x  20 , y  40 , x  60 z = 500 x + 800 y ]

(b) Plot the graph and shade the feasible region satisfying the system of inequalities in (a) on the graph
paper.
[Ans : DIY]

(c) By evaluating the objective function at each vertex of the feasible region, determine the number of
hectares of tomatoes and cabbages should be planned to maximize the profit and state the profit.
[Ans: 20 hectares tomatoes, 140 hectares cabbages]

END OF CHAPTER 4
||||||||||2021/2022||||||||||||

18