Scribd
Upload
29 views3 pages

Add 4.2

The second document presents a linear programming problem about a factory producing cupboards. It gives constraints on raw materials and production for cupboards A and B. It asks to write inequalities, graph the feasible region, and determine maximum outputs or profit based on the

Uploaded by

munxin02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views3 pages

Add 4.2

The second document presents a linear programming problem about a factory producing cupboards. It gives constraints on raw materials and production for cupboards A and B. It asks to write inequalities, graph the feasible region, and determine maximum outputs or profit based on the

Uploaded by

munxin02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Add math Homework

声明
所有作业都做在作业纸上，没有遵守以下规则会导致你需要重做从而迟交：

1. a 和 b 属于两份不同的作业，请用不同页面的作业纸。
2. 字迹不得过于潦草。
3. 记得抄题并以题目答案，题目答案的方式呈现你的作业，而不是先抄完题目，才来一次过
作答。

另外，没有遵守以下规则会导致你的作业分被扣分：

1. 记得写上班号
2. 记得写上组别
3. 使用蓝笔或黑笔作答，除了画图以外，不可以使用铅笔作答
4. 迟交
5. 作业分发回去之后，记得做好 filing，弄好目录
6. 作业分发回去之后，要订正
7. 作业分发回去之后，标明自己改的作业要和同学对答案，并且自己改

星星组的同学额外增加更多规则，否则会被记缺点。满三次缺点将被移除出星星组：

1. 别抄作业
2. 题目要按照顺序排好
3. 别违反上述会被扣分或是重做的规则

老师拥有随时增删规则的权力。
4.2 Linear Programming Graph Sketching

4.2a
A factory produces two types of cupboards, namely cupboard A and cupboard B. Each cupboard requires
two types of raw materials P and Q. the amount of each raw material needed to produce each unit of
cupboard A and cupboard B are shown in the table below.

Number of raw material


Cupboard
P Q

A 2 3

B 5 2

The amount of raw materials P and Q available to the factory are 30 units and 24 units respectively. it is
given that the number of cupboard A produced is at most twice the number of cupboard B. Suppose the
factory produces 𝑥 units of cupboard A and 𝑦 units of cupboard B.

a) Write three linear inequalities, other than 𝑥 ≥ 0 and 𝑦 ≥ 0, which satisfy all the constraints
above.
b) Using a scale of 2 cm to 2 units on the 𝑥 − axis and 2 cm on 1 unit on the 𝑦 − axis, construct and
label the region 𝑅 that satisfies all the above constraints.
c) Based on the graph obtained in (b), find
i. The maximum number of cupboard B produced if the factory produces 4 units of
cupboard A,
ii. The maximum profit earned by the factory if the profit from one unit of cupboard A is
RM 200 and one unit of cupboard B is RM 250.
4.2b
A baker takes 2.5 hours to bake an orange cake and 3 hours to bake a strawberry cake. The costs of
making an orange cake and a strawberry cake are RM 15 and RM 20 respectively. In a week, the baker
can bake 𝑥 orange cakes and 𝑦 strawberry cakes based on the following conditions.

I. The baker works at least 30 hours a week.


II. The total cost of baking both cakes is not more than RM 300 a week.
III. The number or orange cakes is not more than twice the number of strawberry cakes.
a. Write three linear inequalities, other than 𝑥 ≥ 0 and 𝑦 ≥ 0, that satisfy all the
conditions above.
b. Using a 2 cm scale to represent 2 cakes on both axes, construct and label the region 𝑅
that satisfies all the above constraints.
c. Using the graph obtained in (b), find
i. Minimum number of orange cakes baked if the bakers bakes 5 strawberry cakes
in a week.
ii. Maximum profit of the baker in a week if the profits from an orange cake and a
strawberry cake are RM 17 and RM 20 respectively.

You might also like