Modul 21 Pengaturcaraan Linear

1
MODUL 21 / TG 5 : PENGATURCARAAN LINEAR

KERTAS 2
1. Satu syarikat !ra"#t $!%a&'arka& (ua $#(!% "aru s#)a* P (a& Q. K#s u&tuk $!$"uat
satu s#)a $#(!% P (a& satu s#)a $#(!% Q ia%a+ $asi&,-$asi&, RM.// (a& RM0//.
P!&,+asi%a& s#)a itu a(a%a+ "!r(asarka& k!ka&,a& "!rikut:
A furniture company launches two new models of sofa, P and Q. The cost of making
one model P sofa and one model Q sofa is RM .// and RM 0// respectively. The
production of the sofa is based on the following constraints:
I : 1u$%a+ k#s !&,+asi%a& s!$i&,,u t!r+a( k!a(a RM20 ///.
The total weekly production cost is limited to RM 20 ///.
II : 1u$%a+ "i%a&,a& s#)a ya&, "#%!+ (i+asi%ka& #%!+ syarikat itu (a%a$ satu
$i&,,u a(a%a+ s!kura&,-kura&,&ya 15 "ua+.
The total number of sofas that the company can produce in a week is at least
15.
III : 3i%a&,a& s#)a $#(!% P ya&, (i+asi%ka& (a%a$ satu $i&,,u ti(ak %!"i+ (ua ka%i
"i%a&,a& s#)a $#(!% Q.
The number of model P sofa produced in a week is not more than twice the
number of model Q sofa.
Syarikat itu $!&,+asi%ka& x s#)a $#(!% P (a& y s#)a $#(!% Q (a%a$ satu $i&,,u*
The company produces x model P sofa and y model Q sofa in a week.
4a5 Tu%is ti,a k!taksa$aa&* s!%ai& (aria(a x 6 / (a& y 6 /* ya&, $!$!&u+i
s!$ua k!ka&,a& (i atas.
Write three ineualities* other than x/ and y/* which satisfy all the above
constraints.
7 8 $ / Aras R 9
4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1/ "ua+ s#)a a(a k!(ua-(ua aksi* "i&a (a&
%#r!k ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 1/ sofas on both axes* construct and shade the region
! which satisfies all the above constraints.
7 8 $ / Aras S 9
4c5 M!&,,u&aka& ,ra) ya&, (i"i&a (i 14b5* 'ari
"sing the graph constructed in 14b5* find
4i5 "i%a&,a& $i&i$u$ s#)a $#(!% Q ya&, (i+asi%ka& :ika 12 s#)a $#(!% P
(i+asi%ka& (a%a$ satu $i&,,u.
the minimum number of model Q sofa produced if 12 model P sofas
are produced in a week.
7 1 $ / Aras T 9
4ii5 :u$%a+ k!u&tu&,a& $aksi$u$ s!$i&,,u :ika k!u&tu&,a& s!"ua+ s#)a
$#(!% P ia%a+ RM8// (a& k!u&tu&,a& s!"ua+ s#)a $#(!% Q ia%a+
RM85/.
the maximum total profit per week if the profit for a model P sofa is
RM8// and the profit for a model Q sofa is RM85/.
7 8 $ / Aras T 9

MODUL SOLA; MATEMATIK TAM3A<AN 2/12 M21-
2
2. S!"ua+ u&i=!rsiti i&,i& $!&,a(aka& satu kursus u&tuk x #ra&, $a+asis>a :urusa&
!ru"ata& (a& y #ra&, $a+asis>a :urusa& !r,i,ia&. Kursus i&i (ia(aka& "!r(asarka&
k!ka&,a& "!rikut:
A university wants to conduct a course for x medical undergraduates and y dentistry
undergraduates. This course is conducted based on the following constraints#
I : 1u$%a+ "i%a&,a& $a+a>is>a s!kura&,-kura&,&ya 8/.
The total number of undergraduates is at least 8/.
II : 3i%a&,a& $a+asis>a :urusa& !ru"ata& ti(ak %!"i+ (aria(a ti,a ka%i "i%a&,a&
$a+asis>a :urusa& !r,i,ia&
The number of medical undergraduates is not more than three times the
number of dentistry undergraduates.
III : P!ru&tuka& $aksi$u$ u&tuk kursus i&i a(a%a+ RM. /// (!&,a& RM1//
u&tuk s!#ra&, $a+asis>a :urusa& !ru"ata& (a& RM0/ u&tuk s!#ra&,
$a+asis>a :urusa& !r,i,ia&.
The maximum allocation for the course is RM. /// with RM1// for a
medical undergraduate and RM0/ for a dentistry undergraduate.
constraints.
7 8 $ / Aras R 9
4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1/ #ra&, $a+asis>a a(a k!(ua-(ua aksi*
"i&a (a& %#r!k ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 1/ undergraduates on both axes* construct and shade
the region ! which satisfies all the above constraints.
7 8 $ / Aras S 9
4i5 "i%a&,a& $i&i$u$ (a& $aksi$u$ "a,i $a+asis>a :urusa& !r,i,ia&
:ika "i%a&,a& $a+asis>a :urusa& !ru"ata& ya&, $!&y!rtai kursus itu
ia%a+ 2/.
t+! maximum and minimum number of dentistry undergraduates if the
number of medical undergraduates that participate in the course is 2/.
7 2 $ / Aras T 9
4ii5 !r"!%a&:aa& $i&i$u$ u&tuk $!&,!&(a%ika& kursus itu u&tuk k!s (i
24c5 4i5.
the minimum expenditure to run the course for the case in 24c5 4i5.
7 2 $ / Aras T 9

8
8. Satu usat tuisy!& $!&a>arka& (ua ak!:* $ (a& A* u&tuk !%a:ar ti&,kata& !$at.
3i%a&,a& !%a:ar u&tuk ak!: $ (a& A ia%a+ $asi&,-$asi&, x #ra&, (a& y #ra&,.
P!&,a$"i%a& !%a:ar a(a%a+ "!r(asarka& k!a(a k!ka&,a& "!rikut:
A tuition centre offers two different packages, $ and A, for %orm 2 students. The
number of students for package $ and A are x and y respectively. The intake of the
students is based on the following constraints:
I : 1u$%a+ "i%a&,a& !%a:ar ti(ak %!"i+ (aria(a ?/ #ra&,.
The total number of students is not more than ?/.
II : 3i%a&,a& !%a:ar u&tuk ak!: $ ti(ak %!"i+ (aria(a (ua ka%i "i%a&,a& !%a:ar
u&tuk ak!: A.
The number of students for package $ is at most twice the number of students
for package A.
III : 3i%a&,a& !%a:ar u&tuk ak!: A $!sti $!%!"i+i "i%a&,a& !%a:ar u&tuk ak!: $
s!"a&yak s!%!"i+-%!"i+&ya 1/ #ra&,.
The number of students for package A must exceed the number of students for
package $ by at most 1/ students.
constraints.
7 8 $ / Aras R 9
4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1/ #ra&, !%a:ar a(a k!(ua-(ua aksi* "i&a
(a& %#r!k ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 1/ students on both axes* construct and shade the
region ! which satisfies all the above constraints.
7 8 $ / Aras S 9
4i5 :u%at "i%a&,a& !%a:ar u&tu ak!: A :ika "i%a&,a& !%a:ar u&tuk ak!: $
ia%a+ 2/.
the range of the number of students for package A if the number of
students for package $ is 2/.
7 1 $ / Aras T 9
4ii5 :u$%a+ yura& $aksi$u$ s!"u%a& ya&, "#%!+ (ikuti :ika yura&
s!"u%a& u&tuk ak!: $ (a& A ia%a+ $asi&,-$asi&, RM12/ (a& RM1//.
the maximum total fees per month that can be collected if the fees per
month for package $ and & are RM12/ and RM1// respectively.
7 8 $ / Aras T 9

2
2. S!"ua+ k!(ai "ak!ri $!&,+asi%ka& x "uku r#ti :!&is ' (a& y "uku r#ti :!&is & s!+ari.
P!&,+asi%a& r#ti i&i $!%i"atka& (ua r#s!s: $!&,a(u& (a& $!$"akar. 1a(ua% 2
$!&u&:ukka& $asa ya&, (i!r%uka& u&tuk $!$"uat (ua :!&is r#ti i&i.
A bakery shop produces x loaves of type ' bread and y loaves of type & bread per
day. The production of the breads involves two processes* blending and baking. Table
2 shows the time needed to make these types of bread.
Jenis roti
Type of bread
Masa yang diperlukan( minit )
Time needed ( minutes )
Mengadun
Blending
Membakar
Baking
' 8/ 2/
& 8/ 8/
1a(ua% 2 / Table 2
P!&,+asi%a& (ua :!&is r#ti itu a(a%a+ "!r(asarka& k!a(a k!ka&,a& "!rikut:
The production of the two types of bread is based on the following constraints:
I : 1u$%a+ $asa $!&,a(u& u&tuk k!(ua-(ua :!&is r#ti ti(ak %!"i+ (aria(a 52/
$i&it s!+ari.
The maximum total time for blending both types of breads is not more than
52/ minutes per day.
II : 1u$%a+ $asa $!$"akar u&tuk k!(ua-(ua :!&is r#ti s!kura&,-kura&,&ya 20/
$i&it s!+ari.
The total time for baking both types of breads is at least 20/ minutes per day.
III : Nis"a+ "i%a&,a& "uku r#ti :!&is ' k!a(a "i%a&,a& "uku r#ti :!&is & ya&,
(i+asi%ka& s!+ari ti(ak kura&, (aria(a 1 : 2.
The ratio of the number of loaves of type ' bread to the number of loaves of
type & bread produced per day is not less than 1 : 2.
constraints.
7 8 $ / Aras R 9
4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 2 "uku r#ti a(a k!(ua-(ua aksi* "i&a (a&
"sing a scale of 2 '$ to 2 %#a=!s #) "r!a( on both axes* construct and shade
the region ! which satisfies all the above constraints.
7 8 $ / Aras S 9
4i5 "i%a&,a& $aksi$u$ r#ti :!&is ' :ika 1/ "uku r#ti :!&is & (i+asi%ka& s!+ari.
the maximum number of type ' bread if 1/ loaves of type & bread are
produced per day.
7 1 $ / Aras T 9
4ii5 :u$%a+ k!u&tu&,a& $i&i$u$ s!+ari :ika k!u&tu&,a& satu "uku r#ti :!&is '
ia%a+ RM2.// (a& k!u&tu&,a& satu "uku r#ti :!&is & ia%a+ RM2.//.
the minimum total profit per day if the profit for a loaf of type ' bread is
RM2.// and the profit for a loaf of type & bread is RM2.// .
7 8 $ / Aras T 9

5
5. S!"ua+ ki%a&, $!&,+asi%ka& x "#&!ka $#(!% A (a& y "#&!ka $#(!% ( s!"u%a&.
K!u&tu&,a& satu "#&!ka $#(!% A ia%a+ RM15 (a& k!u&tu&,a& satu "#&!ka $#(!% (
ia%a+ RM12. P!&,+asi%a& s!"u%a& (ua $#(!% "#&!ka i&i a(a%a+ "!r(asarka& k!a(a
k!ka&,a& "!rikut:
A factory produced x dolls of model A and y dolls of model ( per month. The profit for
a doll of model A is RM 15 and the profit for a doll of model ( is RM 12. The
production of these two models per month is based on the following constraints:-
I : 1u$%a+ "i%a&,a& "#&!ka ya&, (i+asi%ka& ti(ak %!"i+ (aria(a 5//.
The total number of dolls produced is not more than 5//.
II : 3i%a&,a& "#&!ka $#(!% A ya&, (i+asi%ka& s!%!"i+-%!"i+&ya ti,a ka%i "i%a&,a&
"#&!ka $#(!% (.
The number of dolls of model A produced is at most three times the number of
dolls of model (.
III : 1u$%a+ k!u&tu&,a& $i&i$u$ s!"u%a& "a,i k!(ua-(ua $#(!% "#&!ka itu ia%a+
RM2 2//.
The minimum total profit per month for the dolls of both models is RM22//.
constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 5/ "#&!ka a(a k!(ua-(ua aksi* "i&a (a&
"sing a scale of 2 '$ to 5/ (#%%s on both axes* construct and shade the region
7 8 $ / Aras S 9
4i5 "i%a&,a& $i&i$u$ "#&!ka $#(!% ( :ika "i%a&,a& "#&!ka $#(!% A
ya&, (i+asi%ka& ia%a+ 1// s!"u%a&.
the minimum number of dolls of model ( if the number of model A
produced is 1// per month.
7 1 $ / Aras T 9
4ii5 :u$%a+ k!u&tu&,a& $aksi$u$ s!"u%a&.
the maximum total profit per month.
7 8 $ / Aras T 9

.
.. S!"ua+ k#%!: t!rk!$uka $!&a>arka& (ua kursus* A (a& (. K!$asuka& !%a:ar a(a%a+
"!r(asarka& k!a(a k!ka&,a& "!rikut :
A prestigous college offers two courses* A and (. The enrolment of students is based
on the following constraints :
I : Kaasiti k#%!: a(a%a+ 1@/ #ra&, !%a:ar.
The capacity of the college is 1@/ students.
II : 1u$%a+ $i&i$u$ !&,a$"i%a& !%a:ar a(a%a+ 0/ #ra&,.
The minimum total number of students enrolled is 0/.
III : 3i%a&,a& !%a:ar ya&, (ia$"i% u&tuk kursus ( a(a%a+ $!%!"i+i (ua ka%i
"i%a&,a& !%a:ar ya&, (ia$"i% u&tuk kursus A s!kura&,-kura&,&ya 2/ #ra&,.
The number of students enrolled for course ( exceeds twice the number of
students enrolled for course A by at least 2/ students.
Di"!ri "a+a>a x #ra&, !%a:ar $!&(a)tar u&tuk kursus A (a& y #ra&, !%a:ar
$!&(a)tar u&tuk kursus (.
)iven that x students enrolled for course A and y students enrolled for course
(.
constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1/ #ra&, !%a:ar a(a aksi-x (a& 2 '$
k!a(a 2/ #ra&, !%a:ar a(a aksi-y* "i&a (a& %#r!k ra&tau ! ya&, $!$!&u+i
"sing a scale of 2 '$ to 1/ stu(!&ts on the x*axis and 2 cm to 2/ students on
the y*axis* construct and shade the region ! which satisfies all the above
constraints.
7 8 $ / Aras S 9
4i5 :u%at "i%a&,a& !%a:ar ya&, $!&(a)tar u&tuk kursus ( :ika "i%a&,a&
!%a:ar ya&, $!&(a)tar u&tuk kursus A ia%a+ 8/.
the range of the number of students enrolled for course ( if the number
of students enrolled for course A is 8/.
7 1 $ / Aras T 9
4ii5 :u$%a+ $aksi$u$ kutia& yura& s!"u%a& :ika kutia& yura& "u%a&a&
"a,i s!#ra&, !%a:ar kursus A ia%a+ RM1// (a& "a,i s!#ra&, !%a:ar
kursus ( ia%a+ RM0/.
the maximum amount of fees collected per month if the monthly fees
for course A is RM 1// per student and for course ( is RM 0/ per
student.
7 8 $ / Aras T 9

@
@. A$ira+ $!$!ru&tukka& RM2// u&tuk $!$"!%i x "uku k!r:a (a& y "uku ru:uka&.
1u$%a+ "i%a&,a& "uku ya&, (i"!%i ti(ak kura&, (aria(a 2/. 3i%a&,a& "uku k!r:a ya&,
(i"!%i a(a%a+ s!%!"i+-%!"i+&ya (ua ka%i "i%a&,a& "uku ru:uka&. <ar,a s!"ua+ "uku
k!r:a ia%a+ RM1/ (a& +ar,a s!"ua+ "uku ru:uka& ia%a+ RM5.
Amirah allocated RM2// to buy x workbooks and y reference books. The total
number of books bought is not less than 2/. The number of workbooks bought is at
most twice the number of reference books. The price of a workbook is RM1/ and the
price of a reference book is RM5.
constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 5 "uku a(a k!(ua-(ua aksi* "i&a (a& %#r!k
ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 5 "##ks on both axes* construct and shade the region
7 8 $ / Aras S 9
4c5 A$ira+ $!$"!%i 15 "uku ru:uka&.
M!&,,u&aka& ,ra) ya&, (i"i&a (i 74b5* 'ari "aki >a&, ya&, $aksi$u$.
"sing the graph constructed in 74b5* find the maximum amount of money left.
7 2 $ / Aras T 9

0
0. S!"ua+ ki%a&, $!&y!(iaka& x "as (a& y =a& u&tuk !&,a&,kuta& 20/ #ra&,
!k!r:a&ya. S!"ua+ "as "#%!+ $!$"a>a 2/ #ra&, !k!r:a (a& s!"ua+ =a& "#%!+
$!$"a>a 12 #ra&, !k!r:a. K#s !&,a&,kuta& u&tuk satu "as ia%a+ RM2// (a&
u&tuk satu =a& ia%a+ RM1//. 1u$%a+ k#s !&,a&,kuta& u&tuk s!+ari ti(ak $!%!"i+i
RM8 ///. 3i%a&,a& "as ya&, (i,u&aka& $!sti s!kura&,-kura&,&ya sa$a (!&,a&
"i%a&,a& =a&.
A factory provides transportation to 20/ workers using x buses and y vans. A bus can
carry 2/ workers and a van can carry 12 workers. The cost of transportation for a
bus is RM2// and for a van is RM1//. The total cost of transportation for a day must
not exceed RM8 ///. The number of buses used must be at least eual to the number
of vans used.
constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 2 "as a(a aksi-x (a& 2 '$ k!a(a 5 =a&
a(a aksi-y* "i&a (a& %#r!k ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 2 buses on the x*axis and 2 cm to 5 vans on the y*
axis* construct and shade the region ! which satisfies all the above
constraints.
7 8 $ / Aras S 9
4c5 M!&,,u&aka& ,ra) ya&, (i"i&a (i 84b5* 'ari k#s !&,a&,kuta& ya&, $i&i$u$
:ika 8 =a& (i,u&aka&.
"sing the graph constructed in 84b5* find the minimum cost of transportation
if 8 vans are used.
7 2 $ / Aras T 9

?
?. S!"ua+ k#!rasi $!$"!%i (ua :!&a$a "!,* A (a& (* (ari s!#ra&, !$"#r#&, $asi&,-
$asi&, (!&,a& +ar,a RM12 (a& RM0 satu "!,. 3i%a&,a& "!, :!&a$a A a(a%a+
s!kura&,-kura&,&ya satu !rti,a "i%a&,a& "!, :!&a$a (. K#!rasi itu +a&ya
$!$u&yai $#(a% RM. ///. K#!rasi itu i&,i& $!&:ua% "!, :!&a$a A (a& ( $asi&,-
$asi&, (!&,a& +ar,a RM2/ (a& RM12 satu "!, s!rta $!&!taka& :u$%a+ k!u&tu&,a&
ti(ak kura&, (aria(a RM2 2//.
Di"!ri k#!rasi itu $!&:ua% x "!, :!&a$a A (a& y "!, :!&a$a (.
A cooperative society buys two brands of bags* A and (* from a wholesaler at a price
of RM12 and RM0 per bag respectively. The number of brand A bags is at least one
third the number of brand ( bags. The cooperative society has a capital of RM. ///
only. The cooperative society intends to sell brand A bag and brand ( bag at a price
of RM2/ and RM12 per bag and fixed the total profit to be not less than RM2 2//.
+t is given that the cooperative society sells x brand A beg and y brand ( beg.
constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1// "!, a(a k!(ua-(ua aksi* "i&a (a&
"sing a scale of 2 '$ to 1// bags on both axes* construct and shade the
7 8 $ / Aras S 9
4i5 "i%a&,a& $i&i$u$ "!, :!&a$a A ya&, !r%u (i:ua%.
the minimum number of brand A bags that should be sold.
7 1 $ / Aras T 9
4ii5 k!u&tu&,a& $aksi$u$ :ika 2// "!, :!&a$a A (i:ua%.
the maximum profit if 2// brand A bags are sold.
7 8 $ / Aras T 9

1/
1/. S!"ua+ ki%a&, $!&,!%uarka& (ua :!&is !&* Su!r)i&! (a& Su!r,ri* (!&,a&
$!&,,u&aka& $!si& P (a& $!si& Q. M!si& P $!$!r%uka& $asa 1/ $i&it u&tuk
$!&,+asi%ka& s!"ata&, !& Su!r)i&! (a& . $i&it u&tuk $!&,+asi%ka& s!"ata&, !&
Su!r,ri. M!si& Q $!$!r%uka& $asa 8 $i&it u&tuk $!&,+asi%ka& s!"ata&, !&
Su!r)i&! (a& @ $i&it u&tuk $!&,+asi%ka& s!"ata&, !& Su!r,ri. Da%a$ s!+ari*
ki%a&, itu $!&,+asi%ka& x "ata&, !& Su!r)i&! (a& y "ata&, !& Su!r,ri
"!r(asarka& k!a(a k!ka&,a& "!rikut:
A factory produces two types of pens, $uperfine and $upergrip, by using machine P
and machine Q. &achine P reuires 1/ minutes to produce one $uperfine pen and .
minutes to produce one $upergrip pen. &achine Q reuires 8 minutes to produce one
$uperfine pen and @ minutes to produce one $upergrip pen. +n one day* the factory
produces x $uperfine pens and y $upergrip pens based on the following constraints:
I : 1u$%a+ $asa $!si& P (i,u&aka& ti(ak %!"i+ (aria(a .// $i&it.
The total time machine P is used is not more than .// minutes.
II : 1u$%a+ $asa $!si& Q (i,u&aka& s!kura&,-kura&,&ya 21/ $i&it.
The total time machine Q is used is at least 21/ minutes.
III : 3i%a&,a& !& Su!r,ri ya&, (i+asi%ka& ti(ak $!%!"i+i (ua ka%i !& Su!r)i&!.
The number of $upergrip pens produced is not more than twice the number of
$uperfine pens.
4a5 Tu%is ti,a k!taksa$aa&* s!%ai& (aria(a x 6 / (a& y 6 /* ya&,
$!$!&u+i s!$ua k!ka&,a& (i atas.
Write three ineualities* other than x / and y/* which satisfy all the
above constraints.
7 8 $ / Aras R 9

4b5 M!&,,u&aka& ska%a 2 '$ k!a(a 1/ !& a(a k!(ua-(ua aksi* "i&a
(a& %#r!k ra&tau ! ya&, $!$!&u+i s!$ua k!ka&,a& (i atas.
"sing a scale of 2 '$ to 1/ pens on both axes* construct and shade the
7 8 $ / Aras S 9
4i5 :u$%a+ k#s !&,!%uara& $i&i$u$ s!+ari :ika k#s u&tuk
$!&,+asi%ka& s!"ata&, !& Su!r)i&! (a& s!"ata&, !&
Su!r,ri $asi&,-$asi&, ia%a+ RM0 (a& RM5.
the minimum production cost per day if the cost for one
$uperfine pen and one $upergrip pen are RM0 and RM5
respectively.
7 2 $ / Aras T 9
4ii5 "i%a&,a& $aksi$u$ !& Su!r)i&! ya&, (aat (i+asi%ka& #%!+
ki%a&, itu (a%a$ s!+ari :ika ki%a&, itu +!&(ak "i%a&,a& !&
Su!r)i&! (ua ka%i "i%a&,a& !& Su!r,ri.
the maximum number of $uperfine pens that can be produced
by the factory if the factory wants the number of $uperfine pens
to be twice the number of $upergrip pens.
7 2 $ / Aras T 9


Modul 21 Pengaturcaraan Linear

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Modul 21 Pengaturcaraan Linear

Hochgeladen von

Copyright:

Verfügbare Formate

1

MODUL 21 / TG 5 : PENGATURCARAAN LINEAR

Das könnte Ihnen auch gefallen