摘要
本文分析了单纯形算法的主要特点。给出了判定单纯形算法最有效性的充分条件,提出了改进求解线性规划的方向。
This paper analyzes the principal characterbtics on simplex algorithm,gives out the sufficient condition in judging the greatest effectivecess of simplex al-gorithm, and points out the direction for improving the solving process for linearprogrammming.
关键词
单纯形法
线性规划
有效算法
simplex
linear programming
efficient algorithm