简单的线性规划问题的常见解法是直线平移法和交点代入法,两种方法首先都是在直角坐标系中画出约束条件对应的可行域,再进行问题解答.画出可行域,分析目标函数是解答这类问题的常规思路,但上面的思路能否进行优化,很是困惑,一直思考着.困惑的原因是,直线方程的一般式Ax+By+C=0与对应的不等式Ax+By+C>0(<0)的关系仅符号不同,表达式是相同的,能否仅从表达式的系数入手,通过系数间的 The simple solution to the simple linear programming problem is the linear translation method and the intersection point substitution method. The two methods firstly draw the feasible region corresponding to the constraint in the rectangular coordinate system, and then solve the problem. Draw the feasible region and analyze the objective function Is to solve the general idea of ​​such problems, but the above ideas can be optimized, it is confused and always thinking about the reason for confusion is that the general equation of the linear equation Ax + By + C = 0 and the corresponding inequality Ax + By + C> 0 (<0) only the symbol of the different relations, the expression is the same, can only start with the coefficient of the expression, through the coefficient between