A Double-Pivot Degenerate-Robust Simplex Algorithm for Linear Programming
A Double-Pivot Degenerate-Robust Simplex Algorithm for Linear Programming
A double pivot simplex algorithm that combines features of two recently published papers by these authors is proposed.The proposed algorithm is implemented in MATLAB.The MATLAB implementation is tested, along with a MATLAB implemention of Dantzig's algorithm, for several test sets, including a set of cycling linear programming problems, Klee-Minty's problems, …