题目
A school is planning to run several training days next year for its new teachers, middle leaders and senior leaders.
Next year, the school will need to run
- at least 20 training days in total,
- at most twice as many training days for new teachers when compared to the total number of training days required for both middle and senior leaders,
- at most 25% of the training days for senior leaders.
The costs of running a training day for new teachers, middle leaders and senior leaders are £400, £550 and £750 respectively.
The school wants to minimise the total cost of running the training days.
Let be the number of training days required for new teachers. Let be the number of training days required for middle leaders. Let be the number of training days required for senior leaders.
(a) Formulate this information as a linear programming problem. State the objective and list the constraints as simplified inequalities with integer coefficients.
The school decides that the number of training days for middle leaders and the number of training days for senior leaders should be in the ratio 5:3
This reduces two of the constraints to and .
(b) (i) Express the constraint representing the requirement for a total of at least 20 training days as a simplified inequality with integer coefficients in terms of and only.
(ii) Express the objective in the form where and are integers.
(c) Represent the constraints in and only on Diagram 1 in the answer book. Hence determine, and label, the feasible region .
(d) Use the objective line method to locate the optimal vertex, , of the feasible region. You must make your objective line clear and label the optimal vertex, .
(e) Hence, determine
(i) the total cost of running the training days,
(ii) the number of training days required for senior leaders.
(Total 18 marks)
题目中文翻译
一所学校计划明年为其新教师、中层领导和高级领导开办若干培训日。
明年,学校需要开办:
- 总共至少 20 天培训日,
- 新教师的培训日天数,最多为中层领导和高级领导所需培训日总天数的两倍,
- 高级领导的培训日天数,最多占总培训日天数的 25%。
为新教师、中层领导和高级领导开办培训日的成本分别为 400 英镑、550 英镑和 750 英镑。
学校希望最小化开办培训日的总成本。
设 为新教师所需的培训日天数。 设 为中层领导所需的培训日天数。 设 为高级领导所需的培训日天数。
(a) 将此信息表述为一个线性规划问题。说明目标函数,并将约束条件列为具有整数系数的简化不等式。
学校决定,中层领导的培训日天数与高级领导的培训日天数之比应为 5:3。
这将其中两个约束条件简化为 和 。
(b) (i) 将代表总共至少 20 天培训日要求的约束条件,表示为仅含 和 且具有整数系数的简化不等式。
(ii) 将目标函数表示为 的形式,其中 和 为整数。
(c) 在答案册中的 Diagram 1 上表示出仅含 和 的约束条件。由此确定并标记可行区域 。
(d) 使用目标函数线方法确定可行区域的最优顶点 。你必须清楚画出目标函数线并标记最优顶点 。
(e) 由此,确定:
(i) 开办培训日的总成本,
(ii) 高级领导所需的培训日天数。
(总分 18 分)
解答
(a)
解法一
思路
展开
把三类培训日的每日费用乘以对应天数,得到需要最小化的总成本。三条文字约束分别对应总天数下界、新教师天数上界以及高级领导所占比例上界;百分比约束需要移项,化成整数系数不等式。
答题过程
展开
The objective is to
The total number of training days gives
There may be at most twice as many days for new teachers as for the other two groups combined, so
At most of all training days may be for senior leaders. Hence
Thus the constraints are
where are integers.
(b)(i)
解法一
思路
展开
比例 等价于 ,所以 。把它代入总天数约束,再乘以 5 清除分母。
答题过程
展开
Since ,
so
Substituting into gives
Multiplying by gives
(b)(ii)
解法一
思路
展开
同样把 代入原目标函数,合并两个关于 的成本项。
答题过程
展开
The objective becomes
(c)
解法一
思路
展开
画出三条边界线 、、。分别用轴截距或给定点定位直线,再根据不等号方向保留位于总数边界上方、同时夹在两条过原点直线之间的区域,并明确标记为 。
答题过程
展开
Draw the following boundary lines:
| Boundary | Two points on the line | Required side |
|---|---|---|
| and | ||
| and | ||
| and |
The feasible region is the unbounded region above and between the two lines through the origin. Label this region .
(d)
解法一
思路
展开
目标线可约成 。先画一条具有正确斜率的目标线,再向原点方向平行移动以减小成本;它最后接触可行域的位置是 与 的交点。
答题过程
展开
An objective line has the form
or equivalently
For example, draw , which passes through and . Moving this line parallel towards the origin, the last point of contact with is the intersection of
and
Since , substitution gives
so
Therefore label the continuous optimal vertex
The completed graph, including the objective line and , is:
(e)(i)
解法一
思路
展开
培训日数必须为整数,且 ,所以写成 。先考虑 ,即 ;由总天数约束取成本最低的最小整数 ,费用为 9800 英镑。再检查 :仅中层和高级领导的费用就至少为 10000 英镑,因此这些比例不可能得到更低费用。
答题过程
展开
Because the numbers of training days are integers and , write
for a positive integer . First consider , giving and .
The total-days constraint then requires
so . The other constraints allow , and since its coefficient in the objective is positive, the minimum occurs at .
Therefore the minimum total cost is
For any integer , the cost of the middle and senior leaders’ training days alone is
Adding the non-negative cost of the new teachers’ training days cannot reduce this amount, so no such value of gives a cheaper solution.
Hence the total cost is
(e)(ii)
解法一
思路
展开
由 (e)(i) 的最优整数方案 ,直接读取高级领导对应的变量 。
答题过程
展开
The optimal integer solution is
Therefore the number of training days required for senior leaders is