摘要
本文运用旋转变换法,经有限次变换后,将普通线性规划(LP)问题,化为一个等价的易于求解的连续背包问题.对于退化的LP等问题,有时用单纯形法不能解决,或有时用单纯形法迭代次数很多.采用本法,既可使问题获得解决,又使迭代次数减少.若上机运算,本算法极易实现.
A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.As a simplex method sometimes fails to solve problems such as degeneracy LP and sometimes its iteration occurs too much this method can get the problem solved and decrease the iterations.If an operation is used by a computer,the algorithm is much easily realized.
关键词
线性
规划
旋转变换法
计算
Linear programming
algorithms
investigations
