GLPK is a package intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP) problems.
GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(mip)以及相关问题的自由软件包。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
The simplex pivotal calculations based on the new criterion can reduce the iterations to the least. The new algorithm can save much CPU time, especially for the large-scale linear programming problem.
按该准则进行的枢轴运算，能使单纯形算法的迭代次数减到最少，尤其对大规划线性规划问题而言，该方法能节省相当可观的CPU计算时间。
应用推荐