大规模线性规划问题(large scale linear pro-gramming problem)亦称大型线性规划问题.变量个数和约束条件的个数都很大的线性规划问题. 求解这类线性规划问题可用: 1.直接法(参见“一般稀疏矩阵法”). 2.分解算法(参见“丹齐克一沃尔夫分解算法”).
关于大规模线性规划问题的有效求解问题一直受到人们的关注。
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.
GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(mip)以及相关问题的自由软件包。
GLPK is a package intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP) problems.
近年来，由于在解决大规模非线性规划问题上的优势，智能算法在电力系统无功优化问题中获得广泛应用。
Intelligent method has been widely used in reactive power optimization because of its superiority in solving the large-scale nonlinear programming problem.
应用推荐