求线性目标函数在线性约束条件下的最大(小)值问题,统称为线性规划问题.使目标函数取得最大值或最小值的解叫最优解.求最优解的具体步骤是:(1)依题意,设出变量,建立目标函数;(2)列出线性约束条件;(3)作出可行域(图形要准确,否则答案会出错); The problem of finding the maximum (small) value of a linear objective function under linear constraints is called the linear programming problem. The solution to make the objective function obtain the maximum or minimum value is called the optimal solution. The concrete steps to find the optimal solution are: (1 ) According to the meaning of the question, set the variables to establish the objective function; (2) List the linear constraints; (3) Make the feasible field (the graph should be accurate, otherwise the answer will be wrong);