线性规划问题中的最优解的常用求法是图象法,如没有特殊要求,最优解一般会在可行域的边界点处取得.但是,对于最优解必须是整数的线性规划问题,有时在原边界处取不到最优解.对于这种情况,现行课本及资料提供的方法,一是以取得非整数最优解的线 The common solution to the optimal solution in the linear programming problem is the image method. If there is no special requirement, the optimal solution will generally be obtained at the boundary of the feasible region. However, for the optimal solution, it must be an integer linear programming problem, sometimes The optimal solution is not available at the original boundary. For this case, the current textbook and method for providing data is a line for obtaining a non-integer optimal solution.