New Minimum Angle Algorithms For Feasibility And Optimality

摘要

In this paper we presented a simple and comparatively fast algorithm for obtaining primal feasible and optimal bases, using minimum angle rule. We also present experimental results that compare the speed of the minimum angle rule to the classical methods. The experimental results showed that this algorithm outperforms all the previous pivot rules.