摘要
本文提出一种不用人工变量,适用于求解一般线性规划问题的单纯形法.与传统单纯形法相比,本文提出的算法,除更具通用性外,迭代次数相对减少,有时甚至明显减少.事实证明,该算法是有效的.
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem. Comparing with traditional simplex method, the algorithm presented has more general character, significantly reduces the iterating frequency of and is prove to be very effective by the practice.
关键词
线性规划
单纯形法
人工变量
operations research
linear programming
simplex algorithm
