Variation of the conventional pivot rule and the application in deficient basis algorithm for linear programming

Motivated by intuitionistic geometry, in this paper, we analyze the conventional pivot rule, and obtain the ideas for varying the conventional pivot rule and dynamically creating a pivot tactic. Then, we incorporate the two new pivot ideas in the framework of a deficient basis, resulting in three new deficient basis algorithms. Our preliminary computational exeriments show that the two ideas are feasible.