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

IAL 2021 Oct D1 Q6

A Level / Edexcel / D1

IAL 2021 Oct Paper · Question 6

题目

Problem

A linear programming problem in xx and yy is described as follows.

Maximise P=kx+yP = kx + y, where kk is a constant

subject to:

3yx3y \geq x x+2y130x + 2y \leq 130 4x+y1004x + y \geq 100 4x+3y3004x + 3y \leq 300

(a) Add lines and shading to Diagram 1 in the answer book to represent these constraints. Hence determine the feasible region and label it RR.

(4)

(b) For the case when k=0.8k = 0.8

(i) use the objective line method to find the optimal vertex, VV, of the feasible region. You must draw and label your objective line and label vertex VV clearly.

(ii) calculate the coordinates of VV and hence calculate the corresponding value of PP at VV.

(5)

Given that for a different value of kk, VV is not the optimal vertex of RR,

(c) determine the range of possible values for kk. You must make your method and working clear.

(4)
题目中文翻译

xxyy 的线性规划问题描述如下。

最大化 P=kx+yP = kx + y,其中 kk 是常数

约束条件:

3yx3y \geq x x+2y130x + 2y \leq 130 4x+y1004x + y \geq 100 4x+3y3004x + 3y \leq 300

(a) 在答案本的图 1 上添加线条和阴影来表示这些约束条件。由此确定可行域并标注为 RR

(b) 对于 k=0.8k = 0.8 的情况

(i) 使用目标线法找到可行域的最优顶点 VV。必须画出并标注目标线,并清楚标注顶点 VV

(ii) 计算 VV 的坐标,由此计算 VV 处相应的 PP 值。

已知对于不同的 kk 值,VV 不是 RR 的最优顶点,

(c) 确定 kk 的可能取值范围。必须清楚说明方法和计算过程。

解答

(a)

解法一

思路

展开

先把四个不等式改写成边界直线,并利用两组截距画线。然后逐一判断不等式所要求的半平面:3yx3y\geq x 取直线 3y=x3y=x 上方,x+2y130x+2y\leq1304x+3y3004x+3y\leq300 取各自直线下方,4x+y1004x+y\geq100 取直线上方。四个半平面的交集就是可行域 RR

答题过程

展开

Draw the four boundary lines using the following points:

Boundary lineTwo points on the line
3y=x3y=x(0,0)(0,0) and (60,20)(60,20)
x+2y=130x+2y=130(0,65)(0,65) and (130,0)(130,0)
4x+y=1004x+y=100(0,100)(0,100) and (25,0)(25,0)
4x+3y=3004x+3y=300(0,100)(0,100) and (75,0)(75,0)

The feasible region is above 3y=x3y=x and 4x+y=1004x+y=100, and below x+2y=130x+2y=130 and 4x+3y=3004x+3y=300.

(b)(i)

解法一

思路

展开

k=0.8k=0.8 时,目标线为 0.8x+y=P0.8x+y=P,斜率是 0.8-0.8。先画任意一条这种斜率的直线,再保持平行向使 PP 增大的方向移动;最后接触可行域的顶点就是最优顶点 VV

答题过程

展开

For k=0.8k=0.8, an objective line has equation

0.8x+y=P0.8x+y=P

and gradient 0.8-0.8. Moving this line parallel in the direction of increasing PP, its final point of contact with RR is the intersection of

x+2y=130and4x+3y=300.x+2y=130 \quad\text{and}\quad 4x+3y=300.

This vertex is labelled VV.

(b)(ii)

解法一

思路

展开

由 (b)(i),VV 是直线 x+2y=130x+2y=1304x+3y=3004x+3y=300 的交点。联立求出坐标后,代入 P=0.8x+yP=0.8x+y

答题过程

展开

At VV,

x+2y=130,4x+3y=300.\begin{align*} x+2y=&\,130,\\ 4x+3y=&\,300. \end{align*}

Multiplying the first equation by 44 and subtracting the second gives

5y=220,5y=220,

so y=44y=44. Hence

x=1302(44)=42.x=130-2(44)=42.

Therefore

V=(42,44).\boxed{V=(42,44)}.

The corresponding value of PP is

P=0.8(42)+44=77.6.P=0.8(42)+44=\boxed{77.6}.

(c)

解法一

思路

展开

采用顶点值比较。与 V=(42,44)V=(42,44) 相邻、可能在目标线转动后取代它的顶点是 (10,60)(10,60)(60,20)(60,20)。分别令这两个顶点的目标值严格大于 VV 的目标值,便得到 VV 不再最优的两个范围。严格不等号很重要,因为临界值处 VV 仍是最优点之一。

答题过程

展开

At V=(42,44)V=(42,44),

PV=42k+44.P_V=42k+44.

For (10,60)(10,60) to give a greater value than VV,

10k+60>42k+4416>32kk<12.\begin{align*} 10k+60>&\,42k+44\\ 16>&\,32k\\ k<&\,\frac12. \end{align*}

For (60,20)(60,20) to give a greater value than VV,

60k+20>42k+4418k>24k>43.\begin{align*} 60k+20>&\,42k+44\\ 18k>&\,24\\ k>&\,\frac43. \end{align*}

Hence VV is not the optimal vertex when

k<12ork>43.\boxed{k<\frac12\quad\text{or}\quad k>\frac43}.

解法二

思路

展开

采用目标线斜率比较。顶点 VV 两侧边界的斜率分别为 12-\frac1243-\frac43,而目标线 kx+y=Pkx+y=P 的斜率为 k-k。当目标线斜率处于这两个边界斜率之间时,VV 是最优顶点;所以题目所求是这个闭区间之外的 kk

答题过程

展开

The two boundary lines meeting at VV are

x+2y=130and4x+3y=300,x+2y=130 \quad\text{and}\quad 4x+3y=300,

with gradients 12-\frac12 and 43-\frac43, respectively. The objective line

kx+y=Pkx+y=P

has gradient k-k. Vertex VV is optimal when

43k12,-\frac43\leq-k\leq-\frac12,

that is, when

12k43.\frac12\leq k\leq\frac43.

Therefore VV is not optimal when

k<12ork>43.\boxed{k<\frac12\quad\text{or}\quad k>\frac43}.