IMPROVEMENT OF BLAND RULE IN SIMPLEX METHOD ON DEGENERATE LINEAR PROGRAMMING

摘要

The simplex method is a practical method for solving linear programming problems. Changing basis rule is crucial for the number of steps in the method. This paper deeply elaborates the problems of Bland rule on disposal of degenerate linear programming, and from the manual variables point of view improves the changing basis rule of Bland rule in simplex method and may prevent an entering basis variation from going out a basis in alternative iteration and going in the destructive cycle.