题目
The graph in Figure 4 is being used to solve a linear programming problem in and . The three constraints have been drawn on the graph and the rejected regions have been shaded out. The three vertices of the feasible region are labelled , and .
(a) Determine the inequalities that define .
The objective function, , is given by
where and are positive constants.
The minimum value of is 8 and the maximum value of occurs at .
(b) Find the range of possible values of . You must make your method clear.
(Total 7 marks)
题目中文翻译
图 4 中的图正用于解 和 的线性规划问题。三个约束已画在图上,被拒绝的区域已阴影标出。可行域 的三个顶点标记为 、 和 。
(a) 确定定义 的不等式。
目标函数 由 给出
其中 和 是正常数。
的最小值为 8, 的最大值出现在 处。
(b) 找到 的可能取值范围。必须清楚说明方法。
(总分 7 分)
解答
(a)
解法一
思路
展开
逐条观察可行域 位于边界线的哪一侧。图中被阴影排除的方向与 相反,因此分别选取 内一点代入三条边界式,即可确定不等号方向。
答题过程
展开
From the position of the feasible region relative to each boundary line,
and
(b)
解法一
思路
展开
先用最小值 8 所在的顶点 求出 。最大值只需比较东北侧相邻顶点 :先联立两条边界求出 ,再要求 。由于 都为正, 的目标值自动大于 ,无需另加限制。
答题过程
展开
The minimum occurs at and has value . Therefore
so
Vertex is the intersection of
and
Substituting into the second equation gives
so
and hence
Thus
while . Using ,
and
For the maximum to occur at rather than ,
Multiplying by and simplifying,
so
Therefore
解法二
思路
展开
使用目标线斜率。先同样由顶点 求出 。要使目标函数沿可行域的上边界移动到 时继续增大,目标线必须比边 更陡;比较两条直线的斜率即可得到 的范围。
答题过程
展开
As above, the minimum value at gives
The boundary through and is
or
so its gradient is .
An objective line has equation
or
and therefore has gradient .
For the maximum to occur at rather than anywhere along , the objective line must have the steeper negative gradient:
Multiplying by reverses the inequality, giving