文[1]求线性规划的整数最优解问题的解法有点繁琐.笔者认为可以采用以下两种有效方法:(1)首先确定目标函数 z=f(x,y)的取值范围M,然后转化为求二元一次不定方程 f(x,y)=a(a∈M,若求 z 的最大值,a 从最大到小考虑;若求 z 的最小值,a 从最小到大考虑)的非负整数解,最后代入约 In [1], solving the solution of the integer optimal solution of linear programming is a bit tedious. The author believes that the following two effective methods can be used: (1) first determine the range of values ​​of the objective function z = f (x, y) M, then Convert to a bivariate indefinite equation f(x,y)=a(a∈M, if a is the maximum of z, a is considered from the largest to the smallest; if the minimum of z is sought, a is considered from the smallest to the largest) Non-negative integer solution, last substitution