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

IAL 2024 June D1 Q7

A Level / Edexcel / D1

IAL 2024 June Paper · Question 7

题目

Problem

Figure 4 shows the constraints of a linear programming problem in xx and yy, where RR is the feasible region.

The equations of three of the lines, and the four intersection points, AA, BB, CC and DD, are shown.

The four vertices of RR are A(94,212)A\left(\dfrac{9}{4}, \dfrac{21}{2}\right), B(5,5)B(5, 5), C(10,7)C(10, 7) and D(274,272)D\left(\dfrac{27}{4}, \dfrac{27}{2}\right).

(a) Determine the inequalities that define RR.

(4)

The objective function, PP, is given by

P=2x+kyP = 2x + ky

where kk is a positive constant.

Given that the minimum value of PP is at least half of the maximum value of PP,

(b) determine the range of possible values of kk.

(5)
题目中文翻译

图 4 显示了 xxyy 的线性规划问题的约束条件,其中 RR 是可行域。

三条直线的方程和四个交点 AABBCCDD 已标出。

RR 的四个顶点为 A(94,212)A\left(\dfrac{9}{4}, \dfrac{21}{2}\right)B(5,5)B(5, 5)C(10,7)C(10, 7)D(274,272)D\left(\dfrac{27}{4}, \dfrac{27}{2}\right)

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

目标函数 PP 由下式给出

P=2x+kyP = 2x + ky

其中 kk 是正的常数。

已知 PP 的最小值至少是 PP 最大值的一半,

(b) 确定 kk 的可能取值范围。

解答

(a)

解法一

思路

展开

前三条边界直线的方程已在图中给出。第四条边界经过 A、D,先由两点求出方程。再选取可行域内部的测试点,判断每条边界应取哪一侧。

答题过程

展开

The gradient of the line through A and D is

27221227494=23.\frac{\dfrac{27}{2}-\dfrac{21}{2}} {\dfrac{27}{4}-\dfrac94} =\frac23.

Hence

y212=23(x94),y-\frac{21}{2} =\frac23\left(x-\frac94\right),

so the fourth boundary line is

2x+3y=27.-2x+3y=27.

Testing a point inside RR gives the four constraints

2x+y15,2x+5y15,2x+3y27,2x+y27.\boxed{ \begin{aligned} 2x+y\geq&\,15,\\ -2x+5y\geq&\,15,\\ -2x+3y\leq&\,27,\\ 2x+y\leq&\,27. \end{aligned}}

(b)

解法一

思路

展开

线性目标函数的最大值和最小值必在可行域顶点取得。先把四个顶点代入 P=2x+kyP=2x+ky。当 k1k\leq1 时,最小值在 A、最大值在 C;当 k1k\geq1 时,最小值在 B、最大值在 D。分别使用“最小值至少为最大值的一半”建立不等式,最后合并两个范围。

答题过程

展开

The values of PP at the four vertices are

PA=92+212k,PB=10+5k,PC=20+7k,PD=272+272k.\begin{aligned} P_A=&\,\frac92+\frac{21}{2}k,\\ P_B=&\,10+5k,\\ P_C=&\,20+7k,\\ P_D=&\,\frac{27}{2}+\frac{27}{2}k. \end{aligned}

Also,

PBPA=112(1k),PCPD=132(1k),PDPA=9+3k>0,PCPB=10+2k>0.\begin{aligned} P_B-P_A=&\,\frac{11}{2}(1-k),\\ P_C-P_D=&\,\frac{13}{2}(1-k),\\ P_D-P_A=&\,9+3k>0,\\ P_C-P_B=&\,10+2k>0. \end{aligned}

For 0<k10<k\leq1, the minimum is at A and the maximum is at C. Therefore,

92+212k12(20+7k)9+21k20+7k14k11,\begin{aligned} \frac92+\frac{21}{2}k \geq&\,\frac12(20+7k)\\ 9+21k\geq&\,20+7k\\ 14k\geq&\,11, \end{aligned}

giving

k1114.k\geq\frac{11}{14}.

For k1k\geq1, the minimum is at B and the maximum is at D. Therefore,

10+5k12(272+272k)20+10k272+272k13272k,\begin{aligned} 10+5k \geq&\,\frac12\left(\frac{27}{2}+\frac{27}{2}k\right)\\ 20+10k\geq&\,\frac{27}{2}+\frac{27}{2}k\\ \frac{13}{2}\geq&\,\frac72k, \end{aligned}

giving

k137.k\leq\frac{13}{7}.

Combining the two cases,

1114k137.\boxed{\frac{11}{14}\leq k\leq\frac{13}{7}}.