CRUISE SCHOOL, ADDIS ABABA

Grade 11 Mathematics social science

Unit 10
Introduction to linear programming
Main contents
10.1 Revision on linear graphs
10.2 Graphical solutions of systems of linier inequalities
10.3 Maximum and minimum values
10.4 Real life linear programming
10.1 Revision on linear graphs
In order to determine the equation of ℓ, we peak two points P (x1, x2) and Q(x1,x2) on ℓ as shown below, we
determine the slope m of ℓ by m= =; x1#x2

ℓ
Q(x1,x2)

P (x1, x2)

)ά

EX1:- the slope of a line ℓ passing through the points P(3,-2) and Q (-1,3) is m=

=
=
=

1
 Parallel lines
Two lines are said to be parallel if their slope are equal m1=m 2, if m1 and m2 are slopes of two lines, ℓ1= ℓ2

Perpendicular lines
Two lines are perpendicular if their slopes are negative reciprocal of each other m1 and m2 are slopes of line ℓ1
and ℓ2 respectively, then m1. m2= -1 if ℓ1 Ʇ ℓ2.
Solution

a. M=4, (2,5)

Y-y1=m(x-x1)

Y-5=4(x-2)

Y-5=4x-8

y=4x-3

b. =

Y-2=-x+1

y=-x+3
c. y=mx+b, b=y-intercept
y=-2x+5
2
 10.2 Graphical solutions of systems of linier inequalities
Ex:- find the graphical solution to the system x+y≥3
2x+y≥0
Solution:- first draw the lines x+y=3 and 2x-y=0 by plotting two points for each lines.
Then shade the regions two inequalities.
The solution region is the intersection of the two inequalities.
X+Y=3, take the x-int and y-int
x-int at y=0 (3,0)
y-int at x=0 (0,3)
2x-y=0
x-int, at y=0, (0,0)
y-int, at x=0, (0,0)

2x-y=0
2x-y=0
y y
y

(1,2) solution region

X
X

X+y=3

X+y=3

To get the point of intersection we solve x+y=3

2x+y=0

3x=3

X=1

3
 Y=2(1)=2

)1,2( ‫؞‬
Definition 10.1
The point of intersection of two or more boundary lines of a solution region is called
a vertex or (corner point) of the solution.

EX:- solve the following system of linear inequalities.

2x+y≤22
x+y≤13
2x+5y≤50
x≥0
y≥0
(x≥0,y≥0 are known as non-negative inequalities) (or non-negative requirements)

2x+y=22
A B
C 2x+5y=50
Solution region

Note: - we may have solution region unbounded.

Corner points are A (0,10)
B (5,8)
C (9,4)

4
D (10,0)
E (0, 0)
Note: - in the above example the solution region is bounded.
Exercise: - find the graphical solution
a. 2x+3≤4
x≥0
y≥0
b. X-y≤2
X+y≥2
X+2y≤8
x≤4
x≥0
y≥0
Maximum and minimum values
many applications in business and economics involves a process called
optimization, in which you are asked to find the maximum or the minimum
value of the quantity. We call the optimization strategy a linier programming.
Many optimization problems involve maximizing or minimizing a linear
function (the objective function) subject to one or more linear inequalities or
inequalities (constraints)
Ex1. Find the values of x and y which will maximize the value of the objective
function.
Z=f(x,y)=2x+5y, the subject to linear constraints,
3x+2y≤6
-2x+4y≤8
x≥0
y≥0
Solution
Draw the boundary lines for each of the constraints and shade according to
the inequalities.
Y y

(1/2, 9/4)

5
 C 2
(1/2, 9/4)

A B2

3x+2y=6

2 y=0

3x+2y=6 feasible region

X=0

A(0,10) B(2,0) C(0,2) D(1/2, 9/4) are called vertices of the feasible region.

Vertex point Value of z=2x+5y

A()0,0 Z=2(0) +5(0)=0

B(2,0) Z=2(2) +5(0)=4

C(0,2) Z=2(0) +5(2)=10

D(1/2, 9/4) Z=2(1/2) +5(9/4)=49/4

Comparing the value of z, you get the maximum value of z=49/2 obtained at (1/2 9/4).

We have the minimum value z=0 at (0,).

Ex2:- draw the boundary line for each of the constraints, i.e 2x+5y=10, x=0 y=0

A(0,0) B(0,2) and C (5,0) are vertices of the feasible region.

Vertex point Value of z=2x+5y

A(0,0) Z=6(0) +10(0)=0

B(2,0) Z=6(0) +10(2)=20

C(5,0) Z=6(5) +10(0)=30

Comparing the value of z, you have the maximum value of z=30 obtained at (5,0).

We have the minimum value z=0 at (0,0).

Ex3 a company produce two types of tables, table A and table B. it takes 2hrs of cutting time and 4hrs of
assembling to produce table A. it takes 10hrs of cutting time and 3hrs of assembling to produce table B. the
company has at most 112hrs of cutting labour and 54hrs of assembly labor pe week. The company’s profit
is birr 60 for each table A produced and birr 170 for each table B produced. How many of each types of table
should the company produce in order to maximize profit?

Solution

6
 Table A (x) Table B (y) Time

Cutting time 2 10 112

Assembling 4 3 54

Profit 60 170
Objective function Z=60x+170Y, subject to constraints, 2x+10Y≤112

4x+3y≤54

x≥0

y≥0

Draw the boundary lines for each constraints and shade according to the inequalities.

Y y

B 2 Feasible region

A C 5 x

2x+5y=10 2x+5y=10

X=0

Solving 4x+3y=54 and 2x+10y=112 simultaneously we get (6,10).

A (0, 0) B (0,112), C (6, 10), and D (13.5,0) are corner points.

Vertex point Value of z=2x+5y

A(0,0) Z=60(0) +170(112)=1904

B(2,0) Z=60(6) +170(112)=2060

C(5,0) Z=60(13.5) +170(0)=810

Comparing the value of z, you get the maximum of z=2060 obtained at (6,10), that means when we produce
6 table A and 10 table B we have minimum value z=0 at (0,0).

EX4:- the officers of a high school senior class are planning to rent busses and vans for a class trip. Each buss
can transport 36 students require 4 supervisors and costs birr 1000 to rent. Each van can transport 6

7
students requires 1 supervisor and require birr 150 to rent. The officers must plan to accommodate atleast
420 students. Since only 48 parents have volunteered o serve as supervisors, the officers must plan to use at
most 48 supervisors.

How many vehicles of each type should the officers rent in order to minimize the transportation cost?

What is the minimum transportation cost?

bus (x) van (y) Number of passengers

Students 36 6 420
supervisors 4 1 48

Cost (birr) 1000 150

Objective function z=1000x+150y

Subject to constraints

36x+6y≥420

4x+y≤48

x≥0

y≥0

Draw the boundary lines for each constraints and shade according to the inequalities.

Exercise

1. Find the maximum and minimum values of the objective function to the given constraints.
a. Objective function z=3x+2y
Subject to x≥0
y≥0

8
 x+3y≤15
4x+y≤16
b. Objective function z=3x+4y
Subject to x≥1
y≥0
3x-4y≤12
x+2y≥4
2. Find the optimal solution of the following real life linear programming problems.
a. Ahadu Company produces two models of radios. Model A requires 20min of work on assembly
line I and 10mn of work on assembly line ii. Model B requires 10mn of work on assembly line I
and 15mn of work on assembly line ii. At most 22hrs of assembly on line I and 25hrs of assembly
on line ii are available per week. It is anticipated that ahadu company will realize a profit of birr
10 on model A and a profit of birr 14 on model B. How many radios of each model should be
produced per week in order to maximize ahadu’s profit?
3. Farming cooperative mixes two brands of cattle feed. Brand x costs birr 25 per bag and contains 2
units of nutritional element A,2 units of nutritional element B, and 2 units of element C. brand Y
costs birr 20 per bag and contain 1 units of nutritional element A, 9 Units of element B, and 3 units
of element c. the minimum requirements of nutrients A, B and C are 12, 36 and 24 units
respectively. Find the numbers of bags of each brand that should be mixed to produce a mixture
having a minimum cost.