题目
A company makes three products, P, Q and R.
Each product must go through two machines, Machine 1 and Machine 2.
The time taken on each machine, in minutes per unit, is shown in the table.
| P | Q | R | |
|---|---|---|---|
| Machine 1 | 4 | 3 | 5 |
| Machine 2 | 2 | 5 | 3 |
Machine 1 is available for 240 minutes per week.
Machine 2 is available for 210 minutes per week.
The profit from selling each unit of P is £6, each unit of Q is £7 and each unit of R is £10.
The company wishes to maximise the profit from the sale of these products.
Let be the number of units of P made per week, be the number of units of Q made per week and be the number of units of R made per week.
(a) State the objective function for this problem.
(b) Write down two inequalities, other than , , , that model the constraints of this problem.
(c) The company decides to make exactly 20 units of R per week. Show that the constraints reduce to
(d) Draw the graph of these two inequalities, on the axes provided in the answer book, indicating clearly the feasible region.
(e) Hence determine the number of units of P and the number of units of Q that the company should make per week to maximise the profit.
题目中文翻译
一家公司生产三种产品 P、Q 和 R。
每种产品必须经过两台机器,机器 1 和机器 2。
在每台机器上花费的时间(单位:分钟/件)如下表所示。
| P | Q | R | |
|---|---|---|---|
| 机器 1 | 4 | 3 | 5 |
| 机器 2 | 2 | 5 | 3 |
机器 1 每周可用 240 分钟。
机器 2 每周可用 210 分钟。
销售每件 P 的利润为 £6,每件 Q 为 £7,每件 R 为 £10。
公司希望最大化这些产品的销售利润。
设 为每周生产的 P 件数, 为每周生产的 Q 件数, 为每周生产的 R 件数。
(a) 写出此问题的目标函数。
(b) 写出两个不等式(除 、、 外),模拟此问题的约束条件。
(c) 公司决定每周恰好生产 20 件 R。证明约束条件简化为
(d) 在答案本提供的坐标轴上画出这两个不等式的图,清楚标出可行域。
(e) 由此确定公司每周应生产的 P 和 Q 的件数,以最大化利润。