题目
Problem
Figure 3 shows the constraints of a linear programming problem in x and y, where R is the feasible region. The equations of two of the lines have been shown in Figure 3.
Given that k is a positive constant,
(a) determine, in terms of k where necessary, the inequalities that define R.
(4)
The objective is to maximise P=5x+ky.
Given that the value of P is 38 at the optimal vertex of R,
(b) determine the possible value(s) of k. You must show algebraic working and make your method clear.
(7)
题目中文翻译
图 3 显示了 x 和 y 的线性规划问题的约束条件,其中 R 是可行域。图 3 中已显示了两条直线的方程。
已知 k 是正常数,
(a) 确定定义 R 的不等式,必要时用 k 表示。
(4)
目标是最大化 P=5x+ky。
已知 P 在 R 的最优顶点处的值为 38,
(b) 确定 k 的可能值。必须展示代数计算并清楚说明方法。
(7)
解答
(a)
解法一
思路
展开
逐条观察可行域 R 位于边界线的哪一侧。第三条边界经过 (0,8) 与 (4,0),先由这两个截距求出直线方程,再根据阴影区域选择不等号方向。
答题过程
展开
The region R lies below the line x+y=8, so
x+y≤8.
It lies above the line 5y=x+k, so
5y≥x+k.
The remaining boundary passes through (0,8) and (4,0). Its equation is
y=−2x+8.
Since R lies above this line,
y≥−2x+8,
or equivalently,
2x+y≥8.
Therefore the inequalities defining R are
x+y≤8,5y≥x+k,2x+y≥8.
(b)
解法一
思路
展开
因为目标函数的两个系数都是正数,最大值只可能出现在可行域东北侧边界 x+y=8 的两个端点:(0,8),或 x+y=8 与 5y=x+k 的交点。分别令这些候选顶点的目标值为 38,再检查它是否真的优于另一候选顶点。
答题过程
展开
At the vertex (0,8),
P=5(0)+8k=8k.
If this vertex gives P=38, then
8k=38
and hence
k=419.
The other possible optimal vertex is the intersection of
x+y=8
and
5y=x+k.
Using y=8−x gives
5(8−x)=x+k,
so the coordinates of this vertex are
(640−k,68+k).
Setting the objective value at this vertex equal to 38 gives
5(640−k)+k(68+k)=38.
Multiplying by 6 and simplifying,
200−5k+8k+k2=228,
so
k2+3k−28=0.
Therefore
(k−4)(k+7)=0.
Since k is positive,
k=4.
It remains to check which candidate really gives a maximum value of 38.
If k=4, the intersection vertex is (6,2) and
P(6,2)==5(6)+4(2)38,
whereas
P(0,8)=4(8)=32.
Thus k=4 is valid.
If k=419, the other vertex is
(847,817),
at which
P==>5(847)+419(817)32126338.
Therefore (0,8) is not optimal when k=419, so this value must be rejected.
Hence the only possible value is
k=4.
解法二
思路
展开
在两条边界的交点处,把 y 和 k 都表示成 x 的式子。代入目标值 38 后解关于 x 的二次方程,再回代求 k。还要检查另一个候选顶点 (0,8),不能只求出一个交点就结束。
答题过程
展开
The possible optimal vertices are (0,8) and the intersection of x+y=8 with 5y=x+k.
At the intersection,
y=k==8−x,5(8−x)−x40−6x.
Setting P=38 gives
5x+(40−6x)(8−x)=38,5x+320−88x+6x2=38,6x2−83x+282=0,(6x−47)(x−6)=0.
Thus x=647 or x=6. The first gives
k=40−47=−7,
which is rejected because k>0. The second gives
k=y=40−6(6)=4,8−6=2.
For k=4, P(6,2)=38 whereas P(0,8)=32, so the maximum is 38.
If (0,8) were optimal, 8k=38 would instead give k=419. However, the intersection would then be (847,817), where
P==5(847)+419(817)321263>38.
Hence k=419 is rejected, and the only possible value is
k=4.
解法三
思路
展开
也可以在交点处把 x 和 k 都表示成 y 的式子,得到关于 y 的二次方程。求出根后回代,排除负的 k,再比较两个候选顶点的目标值。
答题过程
展开
The possible optimal vertices are (0,8) and the intersection of x+y=8 with 5y=x+k.
At the intersection,
x=k==8−y,5y−(8−y)6y−8.
Setting P=38 gives
5(8−y)+(6y−8)y=38,40−5y+6y2−8y=38,6y2−13y+2=0,(6y−1)(y−2)=0.
Thus y=61 or y=2. The first gives
k=6(61)−8=−7,
which is rejected because k>0. The second gives
k=x=6(2)−8=4,8−2=6.
For k=4, P(6,2)=38 whereas P(0,8)=32, so the maximum is 38.
If (0,8) were optimal, 8k=38 would give k=419. At the other candidate vertex (847,817),
P==5(847)+419(817)321263>38.
Therefore this vertex gives a greater value than (0,8), so k=419 is rejected. The only possible value is
k=4.