A double-pivot degenerate-robust simplex algorithm for linear programming
by Yaguang Yang; Fabio Vitor
International Journal of Operational Research (IJOR), Vol. 52, No. 2, 2025

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.

Online publication date: Fri, 07-Feb-2025

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com