一、四大考点1.线性规划例1当x,y满足不等式组2≤x≤4,y≥3,x+y≤8时,目标函数k=3x-2y的最大值为,最小值为.解析这是一类考查线性规划的简单应用题.由线性规划的原理可知,解这类题的方法是:先根据约束条件画出可行域,然后把可行域中满足各条件的边界交点(当交点是整数时)的坐标 One or four test sites 1. Linear programming example 1 When x, y satisfies the inequality group 2 ≤ x ≤ 4, y ≥ 3, x + y ≤ 8, the maximum value of the objective function k = 3x-2y is, the minimum value is Analytical This is a simple application problem for examining linear programming. From the principle of linear programming, we can see that the solution to this type of problem is to first draw the feasible region according to the constraint conditions, and then use the boundary of the feasible region to satisfy each condition ( When the point of intersection is an integer)