A double-pivot degenerate-robust simplex algorithm for linear programming

Yaguang Yang and Fabio Vitor

International Journal of Operational Research, 2025, vol. 52, issue 2, 192-210

Abstract: 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, randomly generated linear programs, and Netlib benchmark problems. The test results show that the proposed algorithm, with a careful implementation is: 1) degenerate-robust as expected; 2) more efficient than Dantzig's algorithm for large size randomly generated linear programming problems, but less efficient for Netlib benchmark problems and small size randomly generated problems in terms of CPU time.

Keywords: double pivots; degenerate-robust; simplex method; linear programming; Klee-Minty cube. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=144321 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:52:y:2025:i:2:p:192-210

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().