1 My Modules Form 5 (Version 2011) Topic: 21 Arrogance in by NgKL (M.Ed.,B.Sc.Hons.,Dip.Ed.,Dip.Edu.Mgt.&Lship,Cert.N PQH.) Exercise 10.1 - Use the origin O(0.0) as the reference point to determine and then to shade the region of inequality in which the origin is in. Write the inequality of this region. - For a straight line ax + by = c, 2 (a). y y = 2x + 3
3
x 0
(b) y
! x + y = 15 x 0 ! (c). y x 0 y = 3x 7 "
(d). y x #$ 0 2x + y + 4 = 0
- %
(e). y x = y 4 x 0
(f). y
y & ! !
0 x
(g) y
' 12 3x = 2 y x 0 % (h) y x = 2
x #$ 0 SUMMAR Exa!"le 1# y x = 4 Exa!"le $# x y = 1 Exa!"le %# $y ( 3) * & 0 Exa!"le &# ' * 3) & $y +hade the region , on each of the following graphs that satisfies the linear inequalities gi-en. 1) 2y x; y + x 6; x 0 y y + x = 6 $y & ) 0 x 2) y x 2; y 5;, x 0 y y x = 2 y = 5
0 x %' x 4; y 2x+1; y + x 3 0 y x = 4 y = 2x + 1 ) 0 y + x 3 = 0 &' ( x; y 0; 2y + x + 5 0 y x 0 2y + x + 5 = 0 y = x 10.$. Mathe!atical State!ents an) Linear Inequalities 3 y ax + by c ax + by = c
ax + by c c x 0 y ax + by c ax + by = c
c ax + by c
x 0 .f * + 0 .f * , 0 y y x 4 y x = 4
y x 4 % 0 x y x y 1 2x y = 1 x y 1
0 - 1 y 2y + 3x 1 = 0 2y + 3x 4 0 2
0 2y + 3x 1 0
y ' * 3) = 2y 3 3x 2y 3
0
' * 3) $y x x x Exercise 10.1.$ -o. Mathe!atical State!ent Inequalit( -o. Mathe!atical State!ent Inequalit( . y is !ore than x y > x ". /he !axi!u! -alue of x is k y k $. y is less than x y < x 0. /he !ini!u! -alue of x is k x k 3. y is not !ore than x y x 1. Su! of x and y is not !ore than k x + y kx %. y is not less than x y x 0. y is !ore than x by at least k y k x !. y is at least 2 times of x y kx . y is not !ore than 2 times of x y kx '. y is at the !ost 2 times of x y kx $. y must excee) x by at least k y k x Write the equalities3 beside x 0 and y 03 which describe the following situations. . /he price of an e)ercise boo2 is '0 sen and the price of a pen is ,4.00. 5 student wants to buy ) e)ercise boo2s and y pens which satisfy the following conditions. .. 5t least 3 pens are bought. ... total number of e)ercise boo2s and pens bought must not e)ceed 0. .... 5mount spent is at the most ,40.00 $. 5n apple is priced 00 sen and an orange is '0 sen. 5 housewife has bought ) apples and y oranges which satisfy the following conditions. .. 5t least 0 apples are bought. ... /he total number of oranges and apples are not more than $0. .... /he number of apples e)ceed two times the number of oranges. .6. 5mount spent is at the most ,4!0. 3. 5 man has ,410 in coins. 7e has at least ,4! in twenty sen coins and at least ,4%0 in fifty sen coins. /he fifty sen coins are two times more than the twenty sen coins in number. 8i-en the number of twenty sen coins is x and the number of fifty sen coins is y. Write three inequalities that satisfy the abo-e conditions. %. 5 ba2ery shop sells two types of bread9 :read 5 and :read :. 5 piece of :read 5 costs ,4$.$0 while a piece of :read : costs ,4$.!0. /he pieces of :read 5 and :read : sold are x and y respecti-ely. /he following condition conditions must be satisfied. .. /he sale of :read 5 is at most ,4.'0. ... /he total number of bread sold is less than !00. .... /he total sale of the types of bread is at least ,4%00
10.% .*/ecti0e Functions 4 Exercise 10.$ /o determine the ob;ecti-e or the goal of decision-ma2er or to ma2e decision that refers to optimum (ma)imise or minimise) quantity of k and is written in; ax + by = k, 1here a, b an) k are constants. <etermine the ob;ecti-e function ax + by = k in each of the following situations. . /he production costs of two 2inds of ca2e3 5 and : are '0 sen and 00 sen per piece respecti-ely. .f a company produces x pieces of ca2e 5 and y pieces of ca2e :3 form an ob;ecti-e function for the total cost of production. 5nswer9 $. +amad buys x units of hand phones and y units of watches as pri=es for a competition. /he costs of a hand phone and a watch are ,4%00 and ,43!0 respecti-ely. >orm an ob;ecti-e function for the total e)penditure.
5nswer9 3. /he daily wages of a s2illed and a non s2illed wor2er are ,400 and ,4!0 respecti-ely. .f a contractor employs x s2illed wor2ers and y non-s2illed wor2ers3 form an ob;ecti-e function for the total wage of the wor2ers. 5nswer9 %. 5 shop has sold x units of washing machines and y units of refrigerators in a certain month. /he profits obtained from each unit of them are ,4$!0 and ,4300 respecti-ely. >orm an ob;ecti-e function for the total ma)imum profit. 5nswer9 10.& Sol0ing 2ro*le! Relate) to Linear 2rogra!!ing ?inear programming is a technique to determine the o"ti!u! (ma)imum or minimum) of a linear function in two -ariables under certain constraints or conditions. /he possible solutions to the problem are 2nown as feasible solutios. /he linear function for which the optimum -alue is to be determined is 2nown as the o*/ecti0e function. Four ste"s in sol0ing a linear "rogra!!ing "ro*le!. . Write the linear inequalities and equations that describe the situations3 conditions or constraints of the problem. $. <raw the graphs of the equations described and shade the region of feasible solutions. 3. >orm and draw the ob;ecti-e function. %. <etermine graphically the optimum -alue of the ob;ecti-e function.
1. /he price of one ream of white paper and that of newsprint paper are ,40 and ,4% respecti-ely. @ohan buys x reams of white paper and y reams of newsprint paper based on the following conditionsA .. /he number of reams of white paper is not more than that of newsprint paper. ... @ohan buys at most !0 reams of paper. .... @ohan has at least ,4$00 to buy all the paper. (a) Write the three inequalities3 other than x 0 and y 03 that describe the situations. (b) Using a scale of $ cm to 0 reams for x-axis and $cm to ! cm for y-a)is3 construct and shade the region of feasible solutions3 , that satisfies all the abo-e constraints. (c) :y using the graphs in (b) find (i) the minimum number of white paper need to buy if the number of newsprint paper is $! reams3 (ii) the ma)imum cost @ohan has to spend to buy all the paper. 5 Exercise 10.% Exercise 10.& $. 5 factory has x long buses and y short buses to pro-ide transport for its wor2ers. /he factory has '00 wor2ers. /he capacities of a long bus and a short bus are %0 and 30 passengers respecti-ely. 8i-en the number of long buses is at the most $ and the total number of buses is not more than $0. (a) Write down three inequalities3 other than x > 0 and y > 03 which satisfy all the abo-e conditions. B3 mar2sC (b) Using the scale of cm to $ buses on both a)es3 construct and shade the region , that satisfies all the abo-e conditions. B3 mar2sC (c) >rom the graph3 determine the daily minimum and ma)imum operation costs if the daily operation costs for the long and short buses are ,430 and ,4$0 respecti-ely. B% mar2sC 3. /he number of >orm . and >orm % students admitted into a residential school are x and y students respecti-ely. +election of these students are based on the following criteria9 .9 /he number of >orm % students e)ceeds the number of >orm . students by not more than !0. ..9 /he number of >orm % students is at least D of the number of >orm . students. ...9 /he total number of >orm . students is not more than $!0. (a) Write down the three inequalities in x and y which satisfy the abo-e criteria. B3 mar2sC (b) :y using a scale of $ cm to 00 students on both the x-a)is and y-a)is3 construct and shade the region , which is defined by the abo-e criteria. B3 mar2sC (c) /he monthly fees that each >orm . and >orm % students has to pay are ,4$0 and ,430 respecti-ely. Using the graph in part (b)3 find (i) the ma)imum total monthly fee collected from students of these forms3 (ii) the ma)imum and minimum total monthly fees collected from students of these forms gi-en that there are !0 >orm % students. B% mar2sC 6 %. 5 tailor ta2es orders for short pants and trousers only. /he time ta2en to EcutF the materials and then EsewF the materials for each pair of short pants and trousers are as gi-en in the following table. 3lothes 3utting Ti!e 4!inutes' Se1ing Ti!e 4!inutes' +hort pants 30 %0 /rousers %0 10 /he short pants and trousers are made according to the following constraints9 .. /he minimum time for EcuttingF the materials is 1 hours. ... /he time for sewing is at least ' hours $0 minutes. .... /he ratio of number of pairs of short pants to the number of pairs of trousers is not greater than 3 9 %. .n a particular time period3 the shop manages to ma2e x pairs of short pants and y pairs of trousers. (a) Write down three inequalities3 other than x 0 and y 0, for abo-e constraints. (b) :y using a scale of $ cm to $ pairs of short pants and $ cm to $ pairs of trousers3 draw and shade a region , that satisfies all the abo-e constraints. (c) :y using the graph in part (b)3 find (i) the minimum number of pairs of trousers that are made if % pairs of short pants are made by the tailor3 (ii) the ma)imum profit made by the tailor if each pair of short pants and trousers net a profit of ,4! and ,m1 respecti-ely. 7 !. Use the graph paper pro-ided to answer this question Gunakan kertas ra! yan "ise"iakan untuk #en$a%ab s&a'an ini. 5 factory produces two types of school bags3 type ( and type ). .n a day3 it can produce x bag of type ( and y bag of type ). /he time ta2en to produce a bag of type ( is %0 minutes and a bag of type ) is !0 minutes. *ebua+ ki'an #en+asi'kan "ua $enis be sek&'a+, $enis ( "an $enis ). ,a'a# satu +ari, ki'an itu b&'e+ #en+asi'kan x be $enis ( "an y be $enis ). -asa yan "ia#bi' untuk #en+asi'kan satu be $enis ( ia'a+ 40 #init "an satu be $enis ) ia'a+ 50 #init. /he production of the bags per day is based on the following constraints9 (ene'uaran be "a'a# satu +ari a"a'a+ ber"asarkan ke.a"a kekanan beriku / .9 /he total number of bags produced is not more than '0. 0u#'a+ bi'anan be yan "i+asi'kan ti"ak #e'ebi+i 160. ..9 /he time ta2en to ma2e bag ( is not more than twice the time ta2en to ma2e bag ). -asa yan "ia#bi' untuk #e#buat be ( ti"ak #e'ebi+i "ua ka'i an"a #asa yan "ia#bi' untuk #e#buat be ). ...9 /he number of bag ) e)ceed the number of bag ( by at most 00. 1i'anan be ) #e'ebi+i bi'anan be ( se'ebi+-'ebi+nya 20. (a) Write down three inequalities3 other than 0 x and 0 y which satisfy all the abo-e constraints. B3 #arks C 3u'is tia ketaksa#aan, se'ain x 0 "an y 0, yan #e#enu+i se#ua kekanan "i atas. B3 #arka+C (b) :y using a scale of $ cm to $0 bags on both a)es3 construct and shade the region 4 that satisfies all the abo-e constraints. B3 #arksC -enunakan ska'a 2 c# ke.a"a 20 be .a"a ke"ua-"ua .aksi, bina "an '&rek rantau 4 yan #e#enu+i se#ua kekanan "i atas. B3 #arka+C (c) Use your graph in 5 (b) to answer the following9 Gunakan ra! an"a "i 5 (b) untuk #en$a%ab yan berikut/ (i) >ind the range of the number of bag ) that can be produced if the number of bag ( is !0. 5ari $u'at bi'anan be ) yan b&'e+ "i+asi'kan $ika bi'anan be ( ia'a+ 50. (ii) .f the profit of selling bag ( is ,4$0 and bag ) is ,4303 find the ma)imum profit that can be obtained. B% mar2sC 0ika untun $ua'an bai be ( ia'a+ 4-$0 "an be ) ia'a+ 4-30, cari keuntunan #aksi#u# yan b&'e+ "i.er&'e+i. B% #arka+C 8 '. 5 factory produces two models of school bags3 Gowerma) and +porty3 using machine 5 and machine :. .n a wee23 the factory produces x units of Gowerma) and y units of +porty. 4achine 5 needs "0 minutes to produce one unit of Gowerma) and %0 minutes to produce one unit of +porty. 4achine : needs $0 minutes to produce one unit of Gowerma) and 00 minutes to produce one unit of +porty. *ebua+ ki'an #ene'uarkan "ua $enis be sek&'a+, (&%er#ax "an *.&rty, #enunakan #esin 6 "an #esin 1. ,a'a# se#inu, ki'an itu #ene'uarkan x unit (&%er#ax "an y unit *.&rty. -esin 6 #e#er'ukan "0 #init untuk #en+asi'kan satu unit (&%er#ax "an %0 #init untuk #ene'uarkan satu unit *.&rty. -esin 1 #e#er'ukan $0 #init untuk #en+asi'kan satu unit (&%er#ax "an 00 #init untuk satu unit *.&rty. /he production of the factory in a wee2 is based on the following constraints. (ene'uaran ki'an itu "a'a# se#inu "i+a"kan &'e+ kekanan berikut/ . 9 /he total time machine 5 is used does not e)ceed %$00 minutes. 0u#'a+ #asa #esin 6 "iunakan ti"ak #e'ebi+i %$00 #init.
..9 /he total time machine : is used is at least '00 minutes. 0u#'a+ #asa #esin 1 "iunakan sekuran-kurannya '00 #init. ...9 /he production number of +porty is not more than two times the number of Gowerma). 1i'anan .ene'uaran *.&rty ti"ak #e'ebi+i "ua ka'i .ene'uaran (&%er#ax. (a) Write three inequalities3 other than 0 x and 0 y 3 which satisfy all of the abo-e constraints. B3 #arksC 3u'iskan tia ketaksa#aan, se'ain 0 x "an 0 y , yan #e#enu+i se#ua kekanan "i atas. B3 #arka+C (b) Using a scale of $ cm to 0 units on both a)es3 construct and shade the region 4 which satisfies all of the abo-e constraints. B3 #arksC Gunakan ska'a $ c# ke.a"a 0 unit .a"a ke"ua-"ua .aksi, bina "an '&rek rantau 4 yan #e#enu+i se#ua kekanan "i atas. B3 #arka+C
(c) Use your graph in 1&(b)3 to find Gunakan ra! an"a "i 147b8, untuk #encari (i) the ma)imum profit in a wee2 if the profit from one unit of Gowerma) and one unit of +porty are ,4 $0 and ,4 0 respecti-ely3 0u#'a+ keuntunan #aksi#u# "a'a# se#inu $ika keuntuan "ari.a"a satu unit (&%er#ax "an satu unit *.&rty ia'a+ ,4 $0 "an ,4 0 #asin-#asin, (ii) the ma)imum number of Gowerma) in a wee2 if the factory wants to produce Gowerma) that is two times the number of +porty. B% mar2sC 5arikan bi'anan unit #aksi#u# (&%er#ax "a'a# se#inu $ika ki'an itu +en"ak #ene'uarkan bi'anan unit (&%er#ax "ua ka'i bi'anan unit *.&rty. B% #arka+C
9 ". 5 teacher is as2ed to buy two type of dictionaries3 G and H. /he teacher is allocated with ,4$0.00. /he price for a G dictionary is ,4%0 and the price for a H dictionary is ,4'. /he number of dictionary H to be bought is at most four times that of the number dictionary G. While the number of dictionary H to be bought is at least fi-e boo2s. /he teacher has bought ) number of dictionary G and y number of dictionary H. *e&ran uru "ituaskan untuk #e#be'i "ua $enis ka#us,( "an ).Guru itu "i.eruntukkan %an sebanyak 4- 320. 9ara sebua+ ka#us ( ia'a+ 4- 40 "an sebua+ ka#us ) ia'a+ 4- 16. :a#us ) yan "ibe'i a"a'a+ se'ebi+-'ebi+nya4 ka'i bi'anan ka#us (. 1i'anan ka#us ) yan "ibe'i sekuran-kurannya 5 bua+. Guru itu te'a+ #e#be'i x bua+ ka#us ( "an y bua+ ka#us ) . (a) Write three inequalities3 other than 0 x and 0 y 3 which satisfy all of the abo-e constraints. B3 #arksC 3u'iskan tia ketaksa#aan, se'ain 0 x "an 0 y , yan #e#uaskan se#ua kekanan "i atas. ;3 #arka+< (b) Using a scale of $ cm to one unit of the dictionary on the x-a)es and $ cm to two unit of the dictionaries3 construct and shade the region 4 which satisfies all of the abo-e constraints. B3 #arksC ,enan #enunakan ska'a 2 c# ke.a"a sebua+ ka#us .a"a .aksi-x "an 2 c# ke.a"a 2 bua+ ka#us .a"a .aksi-y, 'ukiskan "an '&rekkan rantau 4 yan #e#uaskan se#ua syarat "i atas. ;3 #arka+< (c) Use your graph in 6(b)3 to find Gunakan ra! an"a "i !7b8, untuk #encari (i) the possible number of dictionary G and dictionary H to be bought in order the total number of dictionary to be bought is ma)imum bi'anan ka#us ( "an bi'anan ka#us ) yan #unkin "ibe'i su.aya $u#'a+ bi'anan ka#us yan "ibe'i a"a'a+ #aksi#u#, (ii) find the balance of the allocation to buy the dictionaries. B% mar2sC carikan baki .eruntukan bai .e#be'ian ka#us-ka#us itu. [4 markah] 10 0. Use the graph paper pro-ided to answer this question Gunakan kertas ra! yan "ise"iakan untuk #en$a%ab s&a'an ini. 5 printing company prints x boo2s of G and y boo2s of H in one day. /ime gi-en to print one unit of the boo2 G is $ minutes and to print one unit of boo2 H is ' minutes. /he printing of the boo2s in one particular day is to follow the following conditions3 *ebua+ syarikat #encetak x bua+ buku ( "an y bua+ buku ) "a'a# satu +ari. -asa untuk #encetak satu unit buku ( ia'a+ 12 #init "an #asa untuk #encetak satu unit buku ) ia'a+ 16 #init. (ercetakan buku- buku tersebut .a"a sesuatu +ari "i+a" &'e+ syarat-syarat berikut/ . /he number of boo2 G must not e)ceed '0 1i'anan unit buku ( ti"ak #e'ebi+i 60. .. /he number of boo2 H is two times the number of boo2 G by at most $0 boo2s 1i'anan unit buku ) #e'ebi+i "ua ka'i bi'anan unit buku ( sebanyak 20 unit atau kuran. ... /he total time used to print both the boo2 G and H must not e)ceed 000 minutes. 0u#'a+ #asa untuk #encetak buku ( "an buku ) ti"ak #e'ebi+i 200 #init. (a) Write three inequalities3 other than 0 x and 0 y 3 which satisfy all of the abo-e constraints. B3 #arksC 3u'iskan tia ketaksa#aan, se'ain 0 x "an 0 y , yan #e#uaskan se#ua kekanan "i atas. ;3 #arka+< (b) Using a scale of $ cm to 0 unit of boo2 G on the x-a)es and $ cm to $0 unit of boo2 H3 construct and shade the region 4 which satisfies all of the abo-e constraints. B3 #arksC ,enan #enunakan ska'a 2 c# ke.a"a 10 bua+ ( .a"a .aksi-x "an 2 c# ke.a"a 20 bua+ buku ) .a"a .aksi-y, 'ukiskan "an '&rekkan rantau 4 yan #e#uaskan se#ua syarat "i atas. (c) Use your graph in 7(b)3 to find Gunakan ra! an"a "i "7b8, untuk #encari (i) the range of the number of boo2 G which can be printed if 30 units of boo2 H is printed. $u'at bi'anan unit buku ( yan b&'e+ "icetak $ika 30 unit buku ) "icetak. (ii) the ma)imum profit could be generated if the profit fromeach boo2 G is ,4$ and the profit from each boo2 H is ,41. keuntunan #aksi#u# yan b&'e+ "i.er&'e+i $ika keuntunan "ari satu unit buku ( ia'a+ 4- 12 "an keuntunan "ari satu unit buku ) ia'a+ 4- =. B% mar2sC ;4 #arka+< 11 1. Iahya has an allocation of ,4 $$! to buy x 2g of prawns and y 2g of fish. /he total mass of the commodities is not less than ! 2g. /he mass of prawns is at most three times that of fish. /he price of 2g of prawns is ,4 1 and price of 2g of fish is ,4 !. (a) Write down three inequalities3 other than x0 and y03 that satisfy all of the abo-e conditions. B3 #arksC (b) 7ence3 using a scale of $ cm to ! 2g for a)es3 construct and shade the region , that satisfies all the abo-e conditions. B4 #arksC (c) .f Iahya buys 0 2g of fish3 what is the ma)imum amount of money that could remain from his allocationJ B3 #arksC 0. 5 district education office intends to organise a course on the teaching of 4athematics and +cience in Knglish. /he course will be attended by x 4athematics participants and y +cience participants. /he selection of participants is based on the following constraints9 . 9 /he total number of participants is at least %0. .. 9 /he number of +cience participant is at most twice that of 4athematics. ... 9 /he ma)imum allocation for the course is ,4"$00. /he e)penditure for a 4athematics participant is ,4$0 and for +cience participant is ,400. (a) Write down three inequalities3 other than x0 and y03 that satisfy all of the abo-e constraints. B3 #arksC (b) 7ence3 using a scale of $ cm to 0 participants on a)es3 construct and shade the region 4 which satisfies all the abo-e constraints. B3 #arksC (c) Using your graph from (b)3 find (i) the ma)imum and minimum number of 4athematics participants when the number of +cience participant is 03 (ii) the minimum cost to run the course. B% #arksC 12 . Gower ,anger Llub ta2es member of age ! and 0 ea-ch year. /he club comprised of x number of age ! members and y number of age 0 members. /he conditions for entry are as follows9 . 9 /he total inta2e is at least !0. .. 9 /he number of age ! members must not be more than three times of age 0 members. ... 9 /he total inta2e should not be more than %00 members. (a) Write three inequalities3 other than x > 0 and y > 0, which satisfy the abo-e constraints. ;3#arks< (b) Using a scale of $ cm to !0 member on both a)es3 construct and shade the region , that satisfies all the abo-e constraints. ;3 #arks< (c) :y using the graph from (b)3 find (i) the minimum collection per month if the members fees for age ! and age 0 are ,40 and ,4$0 respecti-ely3 (ii) the ma)imum and the minimum fees which can be collected if the club decides to ta2e only $00 members for age 0 in one year. ;4 #arks< 13