0% found this document useful (0 votes)
38 viewsLinear Programming Notes
maths linear programming
Uploaded by
MonaCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
38 viewsLinear Programming Notes
maths linear programming
Uploaded by
MonaCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
/ 24
1, Basic Properties of Inequalities
(a) If a>bandb>c, thena>c
Chapter 25 Linear Programming v1 7/9/2017
| &) If re : | ve ato
ac > be when ce > ¢
3) If a>b, th >
Ge oe ee a= | a| >)
. (@) If a #0, thena’ > 0. (In general, @2380")
a .
| (©) If a>b>0,thend<} Comay var Ty A
ab —
2. For an inequality in one unknown, the values of the unknown that satisfy the inequality |
are called the solutions of the inequality. They can be represented graphically on a
number line. For example,
| Graphical representation of x€1
— —;—|—
Revise Chapter 5 (Equation of straight line) and Chapter 16 (Inequalities) before the start of this
chapter! Sel* AS X+1837 ol Ff O-3X+ 20 7
Chapter 25 Linear Programming vi 7/9/2017
Kae, X=lan 2 y
Linear Inequalities in Two Unknowns
Linear inequalities in two unknowns are inequalities which can be represented in the form
Ax + By + C>0, Ax + By + C<0, Ax + By + C2 0 or Ax + By + CSO, where A, B and C are real
numbers, with 4 and B not both equal to zero.
Example I: Consider the linear inequality in two unknowns 2x —3y <8
(a) Determine which of the followings are solutions of the inequality.
(0.0), (4,0), (1,3), © 1,4), 2, =D, 4,3)
ENEMYS =0 4], Ae
SG
HS 2), LD ,(1,H&
(b) Write down 4 more solutions for the inequality. (43 )
CL C# p, CL 2) (+ 2) Sho
Gorraily , Fee are mote see soluPen
Consider ieTize yen SOF equal: it
‘The straight line sivides the coordinate plane into two parts,
one above the li and one below the line.
Each partis cal 2d a half-plane. The straight line itselfis
called the boun lary line of each half-plane.
Bounclowy i = \
Every point in the half-plane above the line satisfies the inequality x + y>1
The graph of #6H54is the half-plane above the line as
shown by the shaded region, { t
Dashed line is used to indicate that all points on the line do
not satisfy the inequality. A solid line will be used for the "
graph of x+y 21.Consider a point (-1, 3) in the shaded
region, since -1 +3 = 2> 1, the point (-1, 3) satisfies the
inequality x+y>1 with eg, sige (2,8)
Chapter 25 Linear Programming v1 7/9/2017
a" > vee solid ino’ Ed ep ey
y= 1 |
each of the following inequalities graphically, ——~ ¢ Ss <= y
(b) x4+y<8 7 _ of
x+y=8 Sar dotted fra
6
a Chapter 25 Linear Programming v1 7/9/2017
Example 3: The shaded region in the figure represents the solutions of an inequality. Find the
inequality.
@) Chapter 25 Linear Programming v1 7/9/2017
Solving Systems of Linear Inequal ‘Two Unknowns Graphically
x+ys8
x-y<6
For x+y <8 the solution is For x —
Consider the system oFinatin|
<6, the solution is
Yrarer
So the solution is shown in the figure. K=0
Example 4: Write down the system of inequalities that is represented by the wolfe, Chapter 25 Linear Programming v1 7/9/2017
Example 5: Solve each of the following system of inequalities graphically.
: 3
o BS
For xt s.
gis Ss nak ye
Qx-y<3
(b) | xty22
ys3
Tov 2x-y =
Exercise 25.1 (1, 2, 8 13, 18, 19, 30, 31, 32)
st a
op
Ds i O There oe sone
So. Cocustra iets Chapler 25 Linear Programming v1 79/2017
@ To achieve 5 taigst
(max win
A linear function in Cteiton in the form P = ax + by +c, where a, b and ¢
are constants, and a, b are both non-zero. For example, P = 14x —Sy is a linear function in x and y.
Clearly, the value of P depends on the values of x and y. If the values of x and y are restricted, then
P will also be restricted. For examples, 0. x < 20and0< y $10. Each restriction is called the
‘constraint. An that satisfies all the given constraints is called a
example, (12, 9) (x.y) a
4 OW fearon
Example 6: A supermarket is having a sale. Each customer can buy each and pears
at $1.5 each. Each customer is allowed to buy at most 24 oranges and 20 pears each time. Mrs.
Chan plans to use at most $60 to buy the fruits.
(a) Let x be the number of oranges and y be the number of pears.
Complete the following inequalities. | 7
{ ( x s2y Oe, 4 ore
|. For
3 Osxs x20 catenins
Osys ) ie 20
< 60 y ee ©
x,y are integers Ie
(b) Draw and
B41 Sy abo
Ye) (@) Find the maximum number of fruits that Mrs. Chan can buy.
2\cehe You will lear to find it inthis chapter. The method of finding the optimum values of a
linear function under some constraints is called linear programming. The linear
functions we want to optimize are called @byjectiVe ahetions; while the variables x and y
are called decision variables. Rk
( tarde
tgp =, TOS
si p 4. Sho crims
moe / K+ Y= co Chapter 25 Linear Programming v1 7/9/2017
Example 7:
(a) Here is the solution of the following
x+2ys12
ySx43
x20
yl
(b) Find the maximum and minimum values of the linear function C =x + y subject to the
constraints in (a).
‘Method 1: Method of Sliding Line
(i) First draw x + y = 0 which is parallel to the graph of the objective function C =x + y.
‘Then move the line in a parallel direction to obtain the optimum values of C.
(i) C attains its maximum and minimum value at points Q(10,1) and P(O, 1) respectively.
Maximum value of C = 10+1= 11
Minimum value of C=0+1=1 vee Chapter 25 Linear Programming v1 7/9/2017
tN
‘The objective function always attains its maximum ahd minimum values at the vertices of the
shaded region,
thod.
The optimum values of C can be found by substituting the coordinates of all vertices into the
objective function.
Thus, (at P(0, 1), C= 0+ 14. : i
at S(0, 3), C= 04373 Ws by
at RQ, 5), C= 24557 , {
at Q(10, 1), C= 10+1 511 :
Maximum value of C= 10+1= 11
Minimum value of C = 0+ 1
Sees se Se Sse Se Se Se Se S| | =
In general, we can follow the steps to solve a real-life problem of linear programming.
I Step 1: Identify the decision variables x and y. I
Step 2: Set up the system of inequalities for the constraints.
|] step 3: Sotve the system of inequalities graphically and shade the region of feasible solution. I
Step 4: Write down the objective function f(x, »)
I seep 5: Find the optimal solution of the objective function by the method we learned in the
J _. Bee sesion I
The studies of linear programming can help people to find out the best planning or scheduling to
achieve the best outcomes.
Question: Which method do you prefer? What is the drawback/ limitation of the methods? Remeek Met Qs car be
Solve d Chapter 25 Linear Programming v1 7/9/2017
= = f
checkin var ceus
Example 8: The figure shows folble region bounded by three straight lines. Find the
‘maximum and the minimum values of P=3x+y-+3in the feasible region if x and y are
ani ini peszty ts
a) numbers, é «
(Qa) x4 QY2 62 nes ;
CAE (4,25 P FX 13 2
At Ci,>, P H34343=4
At (26,05) ,P =3l2s)40¥
43
[M4
=Nl.
(bp x are a aes eer
yey 3x+ 9 t3= 3 IM
ma \ oO \ 4 i
\ $A.
gi esa
ie at (-1,-. -
aa P=3C-243=—2y 1p
4 =3(rv)t43 210
Max at (2,1). >) max AP ° e yy
‘Sliding (Ine aed when»
D Liy ere irtegens ARP
‘> Re verter Cy @.5 ,04)) w
not 2 7
Ww
< Chapter 25 Linear Programming v1 7/9/2017
Example 9: The figure shows the graph of three lines:
L xt RL -2x+8andL, :y=~2.
(a) Write down the system of inequalities that determine the shaded region.
yene
y = x+¥
YS 2x 4k
(b) Write down the vertices of the bounded region.
C-t0,-2), (5-2), 0,8
(©) Find the maximum value of P = 2x + 3y under the constraints in (a).
AF (-10,-, P =-2> -6 =-26
OF (S,-%) P= M-6& =¥
M (0,9, Poa ayy
2. Max valet 4 wy, STA arty
Chapter 25 Linear Programming v1 7/9/2017
Example 10; The storage volume of a cargo is,60 m*s‘The storage volume of a box of television
is 1m’ and the storage volume of a box of refrigerator is 2m*. The number of television to be put
inio the cargo should be at most twice that ofthe reftigeratoy/The profit of transporting a box of
television and a box of refrigerator are $80 and $120 respectively. —
ob) « A
(a) Let.xbe the number of boxes of television and y be the number of boxes of refrigerator to
be transported, Set up the constraints for the above cases.
> Kary s bo
x Sty
AX fp Yore aleges
x>o
yee
(b) Draw and shade the feasible region that represents the constraints in (a).
x>0
oO.
ad te 2 Be
(©) Find the ong, profit of transporting a cargo of television and refrigerator.
up P= Sox+ roy, Tu wens 5
ie eee edi pobit
At Go, rs), P = SoBo VF 120) =4tf200 ‘Peo
Bt (0,30r/P = (20 (or = $3bou Chapter 25 Linear Programming v1 7/9/2017 Chapter 25 Linear Programming v1 7/9/2017
Example 11: [HKCEE 2009]
16. (a) In Figure 5, the straight lines Z, and L., are perpendicular to each other. The equations of
the straight lines L,and L, arex=8and y=10 respectively. It is given that Z, and L, intersect
at the point (12, 24) while L, and L, intersect at the point (8, 16).
(i) Find the equations of Z, and L, »
(ii) In Figure 5, the shaded region (including
the boundary) represents the solution of
a system of inequalities. Write down the
system of inequalities. (6 marks)
4 Chapter 25 Linear Programming v1 7/9/2017
(b) There are two kinds of dining tables placed in a restaurant: square tables and round tables.
‘The manager of the restaurant wants to place at least 8 square tables and 10 round tables.
Moreover, the number of round tables placed is not more than 2 times that of the square
tables placed. Each square table occupies a floor area of 4 m? and each round table occupies a
floor area of 8 m’. The floor area occupied by the dining tables in the restaurant is at most
240m?. On a certain day/ine profits on a square table and a round table are $4000 and $6000
respectively. The manager claims that the total profit on the dining tables can exceed S
$230 000 that day. Do you agree? Explain your answer. (5 marks) J
Gt ¥ be Ha uo } Geen talks |
Ma be +B ne, 4 vounal fables,
xf
vy De
Yerx
Gedy ©,
Keg are a tagess
let PHee P= How + Coooy., Fe @)
at (bow, P > “ow (lo) -+beoe (ts) = $230.0
A C24), P = bewoliry -+ bose (ou) = £9206
At (8.4) -P = 4evv(9) bem (4) =$ Odsan
Bt (S10 (PP =Kew (8) +bow(io) = FL.
2. Max pedo = evr S r3v,ony
L Ant ree Chapter 25 Linear Programming v1 7/9/2017
Example 12: [HKCEE 1998]
Miss Chan makes cookies and cakes for a school fair. The ingredients needed to make a tray of
cookies and a tray of cakes are as follows:
Flour Sugar Eggs
Cookies 0.32kg 0.24kg 2
Cakes _0.28kg 0.36kg 10
Miss Chan has 4.48kg of flour, 4.32kg of sugar and 100 eggs, from which she makes x trays of
cookies and y trays of cakes.
(a) Write down the inequalities that represent the constraints on x and y. Let R be the region of
points representing ordered pairs (x, y) which satisfy these inequalities. Draw and shade the
region R in Figure 11. (7 marks)
(b)_ The profit from selling a tray of cookies is $90, and that from selling a tray of cookies is $120,
Ifx and y are integers, find the maximum possible profit. (4 marks)
@) 0.3% +0.&y C448
O.Wx« oaby <&3r
e+ Y Sem
X20
Yze
Kk, Yowe integers
16 Chapter 25 Linear Programming v1 7/9/2017
De OY tay
§
>t Yo
Oder 0.36,
¢g ee
Figure 11 . ;
(>) Let P= Fox vizoy, gr 032% 40.2hy
Dron Tox PREY = 0
Fox +i2oy = 3be.
8. Bee Fy arr
mox at (6,8)
F mae pat = P06 + '20(95
= $1500 ,
cod Chapter 25 Linear Programming vl 7/9/2017
llaneous
Example 13: [HKCEE 1996]
9.
In Figure 4, R is the region (including the boundary) bounded by the three straight lines
Li: 3x +2y—7=0, Lo: 3x—Sy+7=Oand Ls : 2x-y-7=0.
Ly and L2 intersect at A (1 , 2). Lo and Ls intersect at B (6 , 5).
(a) Find the coordinates of C at which L; and Ls intersect.
(b) Write down the three inequalities which define the region R.
(c)_ Find the maximum value of 2x ~ 2y ~ 7 where ( x , y) is any point in the region R.
(a) ‘
b)
Cc)
Byt2y-1 =e (6 marks)
ax-y-t =e , bs
C+*Q.-\), ca) oo
foe ea US fr ome ove 5
TYR T OS Cn at cornet Tm
at Gs. P= un)
max 5» 1 (MH) 19
Chapter 25 Linear Programming v1 7/9/2017 Chapter 25 Linear Programming v1 7/9/2017
Example 14: Mrs. Wong is going to prepare two drinks for sale. The ingredients and profits for
‘making and selling a cup of each drink are given below:
Juice@miy | Fruit (g)
Drink A 100 25 [
Drink B 150 20
je O\L- object
(us Fore
Mrs. Wong has 4.5 L of. ince 950 g of fruit. Suppose she prepares x cups of drink A and y cups
N
of drink B. tay
Ue
(a) Set up the constraints for the above situation.
loo + So
, P= Uso
AF Ger P= 456
bt Gow P= Se
Somoe peRh = 450%
aft (yo, P=o-
[vox Soy > Yop
Lsxazoy >4ro Chapter 25 Linear Programming v1 7/9/2017
Example 15: A construction company hires coaches and vans to take the workers from home to
the construction site. The capacity and rent of each kind of transportation mode are given below:
Coach Van
Capacity 48 16
Rent (8) 500 200
The company has 200 workers and the number vans should be at least twice that of the coach,
‘Suppose the company hires x coaches and y vans. abe riby
(a) Write down the constraints for the above situation.
48x + ‘by 2 20s
y ZUM
yr oO
ae
x.y ore integes
(b) Draw and mark the feasible solution.
i | | f f
bx42y 22
sess Bete re | : ye 2%
Ani
(©) Find the minimum cost of the rent.
let C = Seox+ 2ooy
ee
he, SK+Yy oo
me Rami af (2,7) Chapter 25 Linear Programming v1 7/9/2017
Example 16: Solve the following inequalities by using the method of tabulation.
(a)x° -7x7 +7x415>0
Wher x=3 ) S1607IW+E <0
x3 & « facty %
ee x 8 er
ST Jers BDO Pere ees
38
= DO bes “Gea pews
= OS) KH) a
ox 48
X< -t |-t
