题目
Figure 3 shows the constraints of a linear programming problem in and , where is the feasible region. The equations of two of the lines have been shown in Figure 3.
Given that is a positive constant,
(a) determine, in terms of where necessary, the inequalities that define .
The objective is to maximise .
Given that the value of is 38 at the optimal vertex of ,
(b) determine the possible value(s) of . You must show algebraic working and make your method clear.
题目中文翻译
图 3 显示了 和 的线性规划问题的约束条件,其中 是可行域。图 3 中已显示了两条直线的方程。
已知 是正常数,
(a) 确定定义 的不等式,必要时用 表示。
目标是最大化 。
已知 在 的最优顶点处的值为 38,
(b) 确定 的可能值。必须展示代数计算并清楚说明方法。
解答
(a)
解法一
思路
展开
逐条观察可行域 位于边界线的哪一侧。第三条边界经过 与 ,先由这两个截距求出直线方程,再根据阴影区域选择不等号方向。
答题过程
展开
The region lies below the line , so
It lies above the line , so
The remaining boundary passes through and . Its equation is
Since lies above this line,
or equivalently,
Therefore the inequalities defining are
(b)
解法一
思路
展开
因为目标函数的两个系数都是正数,最大值只可能出现在可行域东北侧边界 的两个端点:,或 与 的交点。分别令这些候选顶点的目标值为 38,再检查它是否真的优于另一候选顶点。
答题过程
展开
At the vertex ,
If this vertex gives , then
and hence
The other possible optimal vertex is the intersection of
and
Using gives
so the coordinates of this vertex are
Setting the objective value at this vertex equal to gives
Multiplying by and simplifying,
so
Therefore
Since is positive,
It remains to check which candidate really gives a maximum value of .
If , the intersection vertex is and
whereas
Thus is valid.
If , the other vertex is
at which
Therefore is not optimal when , so this value must be rejected.
Hence the only possible value is