笔者在进行新教材中增加的“简单的线性规划”教学时,发现课本和许多参考书上,对于求解形如z=ax±by的目标函数在线性约束条件下的最值,一般都是将二元一次函数(目标函数)转化为求直线在y轴上的截距的最值问题,然后利用线性规划的知识进而求得结果.本人认为还可以用向量知识来? When the author was adding “simple linear programming” to the new teaching material, he found that in textbooks and many reference books, the solution to the maximum value of the objective function with the form of z = ax ± by under linear constraints is generally The bivariate linear function (object function) is transformed into the problem of finding the intercept of the straight line on the y-axis. Then the knowledge of the linear programming is used to obtain the result. I think that we can also use vector knowledge?