Skip to content
CalcGospel 國際數學圖譜
返回

IAL 2021 Jan D1 Q7

A Level / Edexcel / D1

IAL 2021 Jan Paper · Question 7

题目

Problem

Figure 3 shows the constraints of a linear programming problem in xx and yy, where RR is the feasible region. The equations of two of the lines have been shown in Figure 3.

Given that kk is a positive constant,

(a) determine, in terms of kk where necessary, the inequalities that define RR.

(4)

The objective is to maximise P=5x+kyP = 5x + ky.

Given that the value of PP is 38 at the optimal vertex of RR,

(b) determine the possible value(s) of kk. You must show algebraic working and make your method clear.

(7)
题目中文翻译

图 3 显示了 xxyy 的线性规划问题的约束条件,其中 RR 是可行域。图 3 中已显示了两条直线的方程。

已知 kk 是正常数,

(a) 确定定义 RR 的不等式,必要时用 kk 表示。

目标是最大化 P=5x+kyP = 5x + ky

已知 PPRR 的最优顶点处的值为 38,

(b) 确定 kk 的可能值。必须展示代数计算并清楚说明方法。

解答

(a)

解法一

思路

展开

逐条观察可行域 RR 位于边界线的哪一侧。第三条边界经过 (0,8)(0,8)(4,0)(4,0),先由这两个截距求出直线方程,再根据阴影区域选择不等号方向。

答题过程

展开

The region RR lies below the line x+y=8x+y=8, so

x+y8.x+y\leq8.

It lies above the line 5y=x+k5y=x+k, so

5yx+k.5y\geq x+k.

The remaining boundary passes through (0,8)(0,8) and (4,0)(4,0). Its equation is

y=2x+8.y=-2x+8.

Since RR lies above this line,

y2x+8,y\geq-2x+8,

or equivalently,

2x+y8.2x+y\geq8.

Therefore the inequalities defining RR are

x+y8,5yx+k,2x+y8.\boxed{x+y\leq8,\qquad 5y\geq x+k,\qquad 2x+y\geq8}.

(b)

解法一

思路

展开

因为目标函数的两个系数都是正数,最大值只可能出现在可行域东北侧边界 x+y=8x+y=8 的两个端点:(0,8)(0,8),或 x+y=8x+y=85y=x+k5y=x+k 的交点。分别令这些候选顶点的目标值为 38,再检查它是否真的优于另一候选顶点。

答题过程

展开

At the vertex (0,8)(0,8),

P=5(0)+8k=8k.P=5(0)+8k=8k.

If this vertex gives P=38P=38, then

8k=388k=38

and hence

k=194.k=\frac{19}{4}.

The other possible optimal vertex is the intersection of

x+y=8x+y=8

and

5y=x+k.5y=x+k.

Using y=8xy=8-x gives

5(8x)=x+k,5(8-x)=x+k,

so the coordinates of this vertex are

(40k6,8+k6).\bigg(\frac{40-k}{6},\frac{8+k}{6}\bigg).

Setting the objective value at this vertex equal to 3838 gives

5(40k6)+k(8+k6)=38.5\bigg(\frac{40-k}{6}\bigg) +k\bigg(\frac{8+k}{6}\bigg)=38.

Multiplying by 66 and simplifying,

2005k+8k+k2=228,200-5k+8k+k^2=228,

so

k2+3k28=0.k^2+3k-28=0.

Therefore

(k4)(k+7)=0.(k-4)(k+7)=0.

Since kk is positive,

k=4.k=4.

It remains to check which candidate really gives a maximum value of 3838.

If k=4k=4, the intersection vertex is (6,2)(6,2) and

P(6,2)=5(6)+4(2)=38,P(6,2)=5(6)+4(2)=38,

whereas

P(0,8)=4(8)=32.P(0,8)=4(8)=32.

Thus k=4k=4 is valid.

If k=194k=\frac{19}{4}, the other vertex is

(478,178),\bigg(\frac{47}{8},\frac{17}{8}\bigg),

at which

P=5(478)+194(178)=126332>38.\begin{aligned} P=&\,5\bigg(\frac{47}{8}\bigg) +\frac{19}{4}\bigg(\frac{17}{8}\bigg) \\ =&\,\frac{1263}{32} \\ >&\,38. \end{aligned}

Therefore (0,8)(0,8) is not optimal when k=194k=\frac{19}{4}, so this value must be rejected.

Hence the only possible value is

k=4.\boxed{k=4}.