Cycling problems in linear programming

From MaRDI portal

MaRDI QIDQ6357661zbMATH OpenFDO

Authors Ya-Guang Yang

Publication date 5 January 2021




Abstract: This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fact, this set of problems is used to test a recently proposed double pivot simplex algorithm for linear programming.














This page was built for publication: Cycling problems in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357661)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Cycling_problems_in_linear_programming&oldid=103263455"
Powered by MediaWiki