Considerations on Cycling in the Case of Linear Programming Problem (Lpp)
References
- [1] Dantzig GB., Maximization of a linear function of variables subject to linear inequalities. In: Koopmans TC, editor. Activity analysis of production and allocation, New York, 1951.
- [2] Gass SI., Comments on the possibility of cycling with the simplex method. Operations Research 1979; 27:848-52.
- [3] Gass SI, Vinjamuri S., Cycling in linear programming problems. Computers & Operations Research 2004; 31:303-11.
- [4] Hall JAJ, McKinnon KIM., The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling. Mathematical Programming 2004; 100(1):133-50.
- [5] Hoffman AJ., Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.
- [6] Kotiah TCT, Steinberg DI., On the possibility of cycling with the simplex method. Operations Research 1978; 26:374-6.
- [7] Zörnig P., Systematic construction of examples for cycling in the simplex method, Computers & Operations Research, 33 (2006), 2247-2262, Elsevier Ltd.
DOI: https://doi.org/10.1515/kbo-2018-0130 | Journal eISSN: 2451-3113
Language: English
Page range: 14 - 19
Published on: Jul 26, 2018
Published by: Nicolae Balcescu Land Forces Academy
In partnership with: Paradigm Publishing Services
Publication frequency: 3 times per year
Keywords:
Related subjects:
© 2018 Vasile Carutasu, published by Nicolae Balcescu Land Forces Academy
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.