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

IAL 2022 June D1 Q7

A Level / Edexcel / D1

IAL 2022 June Paper · Question 7

题目

Problem

Figure 5 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 and the three intersection points, AA, BB and CC, are shown. The coordinates of CC are (354,154)\left(\dfrac{35}{4}, \dfrac{15}{4}\right).

The objective function is P=x+3yP = x + 3y.

When the objective is to maximise x+3yx + 3y, the value of PP is 24.

When the objective is to minimise x+3yx + 3y, the value of PP is 10.

(a) (i) Find the coordinates of AA and BB.

(ii) Determine the inequalities that define RR.

(8)

An additional constraint, ykxy \geq kx, where kk is a positive constant, is added to the linear programming problem.

(b) Determine the greatest value of kk for which this additional constraint does not affect the feasible region.

(2)
题目中文翻译

图 5 显示了 xxyy 的线性规划问题的约束条件,其中 RR 是可行域。图中显示了两条直线的方程和三个交点 AABBCCCC 的坐标为 (354,154)\left(\dfrac{35}{4}, \dfrac{15}{4}\right)

目标函数为 P=x+3yP = x + 3y

当目标是最大化 x+3yx + 3y 时,PP 的值为 24。

当目标是最小化 x+3yx + 3y 时,PP 的值为 10。

(a) (i) 找到 AABB 的坐标。

(ii) 确定定义 RR 的不等式。

一个附加约束 ykxy \geq kx(其中 kk 是正常数)被添加到线性规划问题中。

(b) 确定 kk 的最大值,使得此附加约束不影响可行域。

解答

(a)(i)

解法一

思路

展开

目标函数在可行域顶点取得极值。图中 A 位于直线 x+5y=10-x+5y=10 上,且在 A 取得最小值 10;B 位于直线 4x+8y=654x+8y=65 上,且在 B 取得最大值 24。因此分别把两点代入 x+3y=10x+3y=10x+3y=24x+3y=24,解两组联立方程。

答题过程

展开

Let A=(a1,a2)A=(a_1,a_2). Since the minimum value of x+3yx+3y is 10 at AA,

a1+3a2=10,a1+5a2=10.\begin{align*} a_1+3a_2=&\,10,\\ -a_1+5a_2=&\,10. \end{align*}

Adding the equations gives 8a2=208a_2=20, so

a2=52,a1=52.a_2=\frac52,\qquad a_1=\frac52.

Let B=(b1,b2)B=(b_1,b_2). Since the maximum value of x+3yx+3y is 24 at BB,

b1+3b2=24,4b1+8b2=65.\begin{align*} b_1+3b_2=&\,24,\\ 4b_1+8b_2=&\,65. \end{align*}

Substituting b1=243b2b_1=24-3b_2 into the second equation,

4(243b2)+8b2=65,4(24-3b_2)+8b_2=65,

so b2=314b_2=\dfrac{31}{4} and b1=34b_1=\dfrac34. Hence

A=(52,52),B=(34,314).\boxed{ \begin{aligned} A=&\,\left(\frac52,\frac52\right),\\ B=&\,\left(\frac34,\frac{31}{4}\right) \end{aligned} }.

(a)(ii)

解法一

思路

展开

第三条边界线通过 A、B,先由两点求斜率与方程。然后在三条边界各取可行域内部一点判断不等号方向;从图形也可看出 RR 位于上升直线的上方,并位于另外两条下降直线的相应一侧。

答题过程

展开

The gradient of the line through AA and BB is

314523452=21474=3.\frac{\dfrac{31}{4}-\dfrac52} {\dfrac34-\dfrac52} =\frac{\dfrac{21}{4}}{-\dfrac74}=-3.

Therefore its equation is

y52=3(x52),y-\frac52=-3\left(x-\frac52\right),

or

3x+y=10.3x+y=10.

Using the position of the feasible region relative to each boundary, the inequalities defining RR are

3x+y10,x+5y10,4x+8y65.\boxed{ \begin{aligned} 3x+y\geqslant&\,10,\\ -x+5y\geqslant&\,10,\\ 4x+8y\leqslant&\,65 \end{aligned} }.

(b)

解法一

思路

展开

约束 ykxy\geq kx 表示可行点必须位于过原点、斜率为 kk 的直线上方。要使它不削去 RR 的任何部分,最大斜率的边界线应刚好通过 RRy/xy/x 最小的顶点 C。

答题过程

展开

At the greatest possible value of kk, the line y=kxy=kx passes through

C=(354,154).C=\left(\frac{35}{4},\frac{15}{4}\right).

Thus

k=154354=37.k=\frac{\dfrac{15}{4}}{\dfrac{35}{4}} =\boxed{\frac37}.