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.
Search in Google Scholar Back to article
[2] Gass SI., Comments on the possibility of cycling with the simplex method. Operations Research 1979; 27:848-52.10.1287/opre.27.4.848
Search in Google Scholar Back to article
[3] Gass SI, Vinjamuri S., Cycling in linear programming problems. Computers & Operations Research 2004; 31:303-11.10.1016/S0305-0548(02)00226-5
Search in Google Scholar Back to article
[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.
Search in Google Scholar Back to article
[5] Hoffman AJ., Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.
Search in Google Scholar Back to article
[6] Kotiah TCT, Steinberg DI., On the possibility of cycling with the simplex method. Operations Research 1978; 26:374-6.10.1287/opre.26.2.374
Search in Google Scholar Back to article
[7] Zörnig P., Systematic construction of examples for cycling in the simplex method, Computers & Operations Research, 33 (2006), 2247-2262, Elsevier Ltd.10.1016/j.cor.2005.02.001
Search in Google Scholar Back to article