题目
Problem
Figure 4 shows the constraints of a linear programming problem in and .
The unshaded area, including its boundaries, forms the feasible region .
An objective line has been drawn and labelled on the graph.
(a) State the four inequalities that define the feasible region.
(2)
The maximum value of the objective function is .
The minimum value of the objective function is .
(b) Determine the objective function, showing your working clearly.
(5)
The practical solution to the linear programming problem requires integer values.
(c) State the minimum integer solution for this problem.
(1)
题目中文翻译
图 4 显示了 和 的线性规划问题的约束条件。
未阴影区域（包括其边界）构成可行域 。
图上已画出并标注了一条目标线。
(a) 写出定义可行域的四个不等式。
目标函数的最大值为 。
目标函数的最小值为 。
(b) 确定目标函数，清楚展示运算过程。
该线性规划问题的实际解需要整数值。
(c) 说明此问题的最小整数解。