一般地,在线性约束条件下求线性目标函数(形如:z=ax+by)的最大值或最小值的问题,统称为线性规划问题.此类问题一般以选择题的形式较高频率地出现在各省市的高考数学试题中,内容丰富、解法多样.介绍解决此类问题方法的文章在杂志上也有许多,如:吕辉的《线性规划可以这样解》(《中学数学》2010年第4期)一文介绍了解线性规划问题的四种方法,王文清《利用向量数量积的几何意义解决线性规划的最值问题》(《中 Generally speaking, the problem of finding the maximum or minimum of a linear objective function (such as z = ax + by) under the linear constraint is generally referred to as a linear programming problem, which is generally in the form of multiple-choice questions Appeared in various provinces and cities entrance math test questions, rich in content, solutions and diverse. Introduction to solve such problems in the magazine article there are many, such as: Lu Hui’s “linear programming can be so solution” (“Mathematics” 2010 4) introduced four ways to understand the linear programming problem, Wang Wenqing “the use of the geometric significance of vector quantity to solve the most value of linear programming problem” ("in