The efficient algorithms for large-scale linear programming problem have been attracting considerable attention from both theorists and practitioners in a variety of disciplines since 1970s.
关于大规模线性规划问题的有效求解问题一直受到人们的关注。
This formulation results in a large scale 0-1 programming problem with nonlinear objective function and linear or nonlinear constraints.
该数学表达式表现为一个具有非线性目标函数及线性与非线性约束条件的大规模0 - 1规划问题。
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计算时间。
It's a typical large-scale non-linear programming problem.
它是典型的大型多约束非线性规划问题。
It's a typical large-scale non-linear programming problem.
它是典型的大型多约束非线性规划问题。
应用推荐