Have a personal or library account? Click to login
Aspects of the Cycling Phenomenon in the Linear Programming Problem (Lpp) Through the Example of Marshall and Suurballe Cover

Aspects of the Cycling Phenomenon in the Linear Programming Problem (Lpp) Through the Example of Marshall and Suurballe

By: Vasile Carutasu  
Open Access
|Jul 2018

References

  1. [1] Carutasu V., Consideraţii asupra fenomenului de ciclare în cazul problemei de programare liniară (LPP), Proceedings of the 24th International Conference „The Knowledge-Based Organization” of „Nicolae Bălcescu” Land Forces Academy, Sibiu, 14-16 June, 2018 - în curs de apariţie.
  2. [2] 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.
  3. [3] Hoffman AJ., Cycling in the simplex algorithm. Report 2974, Washington, DC: National Bureau of Standards: 1953.
  4. [4] Saul I. Gassa;∗, Sasirekha Vinjamurib, Cycling in linear programming problems, Computers & Operations Research 31 (2004) 303 - 311, Elsevier Ltd.10.1016/S0305-0548(02)00226-5
  5. [5] 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
Language: English
Page range: 20 - 25
Published on: Jul 26, 2018
Published by: Nicolae Balcescu Land Forces Academy
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2018 Vasile Carutasu, published by Nicolae Balcescu Land Forces Academy
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.