论文部分内容阅读
正如文[1]所说,“在线性规划问题中,最令学生、教师头疼的莫过于如何寻找最优整解.通常作法是用网格法,即把可行域中的整点标出,再通过代点检验来完成最优整解寻找;不过这种方法要经过大量繁复的运算才能保证结果的正确性.”笔者经过研究,找到了一种快速求解线性规划中最优整解的方法,这种方法不需要作出可行域,简化了作图这一步骤,而且计算量小,更容易掌握.
As mentioned in [1], “the most troublesome problem for linear programming students and teachers is how to find the optimal solution, which is usually done by the grid method, that is, marking the whole point in the feasible domain , And then through the generation check to complete the optimal solution to find; but this method requires a lot of complicated calculations to ensure the correctness of the results. ”After the author found a fast solution to linear programming in the optimal solution Method, this method does not need to make a feasible domain, simplifying the mapping step, and the calculation is small, easier to grasp.