The simplex algorithm is one of the most widely used linear optimization algorithms. Although its history goes back to the 1950’s it is still an evergreen topic because it is usually the hidden computational engine behind other algorithms. Thus its performance heavily affects other optimization systems. The implementation of the simplex algorithm is not a trivial task. An efficient implementation uses very complex methods. Since most of the open-source systems can hardly be used for research purposes the development of a structured and well-documented system is relevant. In this talk we present our own state-of-the-art solver and our development experiences.
 B. Meindl és M. Templ, „Analysis of commercial and free and open source solvers for linear optimization problems,” 23 2 2012. [Online]. Available: http://neon.vb.cbs.nl/casc/..%5Ccasc%5CESSNet2%5Cdeliverable_solverstudy.pdf.
 I. Maros, Research Monograph Computational Techniques of the Simplex Method, Springer, 2003.
 D. Gay, „Electronic mail distribution of linear programming test problems,” COAL Newsletter, pp. 10-12, 1985.
 W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi és S. J. Wichmann, „An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications,” Operations Research, pp. 240-248, 1990.
 P. Tar és I. Maros, „Product Form of the Inverse Revisited,” 3rd Student Conference on Operational Research, pp. 64-74, 2012.
 A. Koberstein, Dissertation „The Dual Simplex Method, Techniques for a fast and stable implementation,” Paderborn, 2005.
 J. Smidla, P. Tar és I. Maros, „A numerically adaptive implementation of the simplex method,” in proceedings of VOCAL - Annual Scientific Conference of NIKK, Veszprém, 2014.
 J. Smidla, Master's Thesis, „Design, Implementation and Examination of Advanced Pricing Techniques for Solving Linear Programming Problems,” University of Pannonia, Veszprém, 2012.